TSTP Solution File: SWV817-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV817-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:21:37 EDT 2022
% Result : Unsatisfiable 1.93s 2.10s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 8 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 2 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2
| ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
file('SWV817-1.p',unknown),
[] ).
cnf(4,plain,
( v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2 != v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1
| ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,flip.1')] ).
cnf(9,axiom,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('SWV817-1.p',unknown),
[] ).
cnf(10,axiom,
A = v_x,
file('SWV817-1.p',unknown),
[] ).
cnf(11,plain,
v_x = A,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(12,plain,
$false,
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[10,4]),11,9]),
[iquote('para_from,10.1.1,4.1.1,unit_del,11,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV817-1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 06:01:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.10 ----- Otter 3.3f, August 2004 -----
% 1.93/2.10 The process was started by sandbox2 on n011.cluster.edu,
% 1.93/2.10 Wed Jul 27 06:01:55 2022
% 1.93/2.10 The command was "./otter". The process ID is 28825.
% 1.93/2.10
% 1.93/2.10 set(prolog_style_variables).
% 1.93/2.10 set(auto).
% 1.93/2.10 dependent: set(auto1).
% 1.93/2.10 dependent: set(process_input).
% 1.93/2.10 dependent: clear(print_kept).
% 1.93/2.10 dependent: clear(print_new_demod).
% 1.93/2.10 dependent: clear(print_back_demod).
% 1.93/2.10 dependent: clear(print_back_sub).
% 1.93/2.10 dependent: set(control_memory).
% 1.93/2.10 dependent: assign(max_mem, 12000).
% 1.93/2.10 dependent: assign(pick_given_ratio, 4).
% 1.93/2.10 dependent: assign(stats_level, 1).
% 1.93/2.10 dependent: assign(max_seconds, 10800).
% 1.93/2.10 clear(print_given).
% 1.93/2.10
% 1.93/2.10 list(usable).
% 1.93/2.10 0 [] A=A.
% 1.93/2.10 0 [] c_Fun_Oid(V_x,T_a)=V_x.
% 1.93/2.10 0 [] c_Fun_Oid(v_x,t_a)=v_x.
% 1.93/2.10 0 [] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10 0 [] c_Hoare__Mirabelle_Ostate__not__singleton|V_x=V_xa.
% 1.93/2.10 0 [] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10 0 [] c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10 0 [] V_s=v_x.
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.93/2.10
% 1.93/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.10 deletion, with positive clauses in sos and nonpositive
% 1.93/2.10 clauses in usable.
% 1.93/2.10
% 1.93/2.10 dependent: set(knuth_bendix).
% 1.93/2.10 dependent: set(anl_eq).
% 1.93/2.10 dependent: set(para_from).
% 1.93/2.10 dependent: set(para_into).
% 1.93/2.10 dependent: clear(para_from_right).
% 1.93/2.10 dependent: clear(para_into_right).
% 1.93/2.10 dependent: set(para_from_vars).
% 1.93/2.10 dependent: set(eq_units_both_ways).
% 1.93/2.10 dependent: set(dynamic_demod_all).
% 1.93/2.10 dependent: set(dynamic_demod).
% 1.93/2.10 dependent: set(order_eq).
% 1.93/2.10 dependent: set(back_demod).
% 1.93/2.10 dependent: set(lrpo).
% 1.93/2.10 dependent: set(hyper_res).
% 1.93/2.10 dependent: set(unit_deletion).
% 1.93/2.10 dependent: set(factor).
% 1.93/2.10
% 1.93/2.10 ------------> process usable:
% 1.93/2.10 ** KEPT (pick-wt=4): 2 [copy,1,flip.1] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10 ** KEPT (pick-wt=4): 4 [copy,3,flip.1] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10
% 1.93/2.10 ------------> process sos:
% 1.93/2.10 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.93/2.10 ** KEPT (pick-wt=5): 6 [] c_Fun_Oid(A,B)=A.
% 1.93/2.10 ---> New Demodulator: 7 [new_demod,6] c_Fun_Oid(A,B)=A.
% 1.93/2.10 Following clause subsumed by 5 during input processing: 0 [demod,7] v_x=v_x.
% 1.93/2.10 ** KEPT (pick-wt=4): 8 [] c_Hoare__Mirabelle_Ostate__not__singleton|A=B.
% 1.93/2.10 ** KEPT (pick-wt=1): 9 [] c_Hoare__Mirabelle_Ostate__not__singleton.
% 1.93/2.10 ** KEPT (pick-wt=3): 10 [] A=v_x.
% 1.93/2.10 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.93/2.10 >>>> Starting back demodulation with 7.
% 1.93/2.10 9 back subsumes 8.
% 1.93/2.10 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] v_x=A.
% 1.93/2.10 Following clause subsumed by 10 during input processing: 0 [copy,11,flip.1] A=v_x.
% 1.93/2.10
% 1.93/2.10 ======= end of input processing =======
% 1.93/2.10
% 1.93/2.10 =========== start of search ===========
% 1.93/2.10
% 1.93/2.10 -------- PROOF --------
% 1.93/2.10
% 1.93/2.10 -----> EMPTY CLAUSE at 0.00 sec ----> 12 [para_from,10.1.1,4.1.1,unit_del,11,9] $F.
% 1.93/2.10
% 1.93/2.10 Length of proof is 2. Level of proof is 1.
% 1.93/2.10
% 1.93/2.10 ---------------- PROOF ----------------
% 1.93/2.10 % SZS status Unsatisfiable
% 1.93/2.10 % SZS output start Refutation
% See solution above
% 1.93/2.10 ------------ end of proof -------------
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10 ============ end of search ============
% 1.93/2.10
% 1.93/2.10 -------------- statistics -------------
% 1.93/2.10 clauses given 3
% 1.93/2.10 clauses generated 1
% 1.93/2.10 clauses kept 8
% 1.93/2.10 clauses forward subsumed 3
% 1.93/2.10 clauses back subsumed 1
% 1.93/2.10 Kbytes malloced 976
% 1.93/2.10
% 1.93/2.10 ----------- times (seconds) -----------
% 1.93/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.10
% 1.93/2.10 That finishes the proof of the theorem.
% 1.93/2.10
% 1.93/2.10 Process 28825 finished Wed Jul 27 06:01:57 2022
% 1.93/2.10 Otter interrupted
% 1.93/2.10 PROOF FOUND
%------------------------------------------------------------------------------