TSTP Solution File: SWW400-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:22:30 EDT 2022
% Result : Unsatisfiable 1.95s 2.12s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 11 unt; 1 nHn; 14 RR)
% Number of literals : 23 ( 4 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ heap(sep(next(nil,A),B)),
file('SWW400-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ heap(sep(lseg(nil,A),B))
| A = nil ),
file('SWW400-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ heap(sep(next(A,B),sep(lseg(B,C),D)))
| A = B
| heap(sep(lseg(A,C),D)) ),
file('SWW400-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ heap(sep(lseg(A,B),sep(lseg(B,nil),C)))
| heap(sep(lseg(A,nil),C)) ),
file('SWW400-1.p',unknown),
[] ).
cnf(14,axiom,
~ heap(sep(lseg(x1,nil),emp)),
file('SWW400-1.p',unknown),
[] ).
cnf(17,axiom,
sep(A,sep(B,C)) = sep(B,sep(A,C)),
file('SWW400-1.p',unknown),
[] ).
cnf(19,axiom,
sep(lseg(A,A),B) = B,
file('SWW400-1.p',unknown),
[] ).
cnf(20,axiom,
heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
file('SWW400-1.p',unknown),
[] ).
cnf(92,plain,
~ heap(sep(lseg(nil,x2),A)),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[20,2]),1]),
[iquote('para_into,20.1.1.1.1,2.2.1,unit_del,1')] ).
cnf(202,plain,
~ heap(sep(A,sep(lseg(nil,x2),B))),
inference(para_into,[status(thm),theory(equality)],[92,17]),
[iquote('para_into,92.1.1,17.1.1')] ).
cnf(246,plain,
( ~ heap(sep(A,sep(lseg(nil,B),C)))
| ~ heap(sep(next(x2,B),sep(lseg(B,D),E)))
| heap(sep(lseg(x2,D),E)) ),
inference(para_into,[status(thm),theory(equality)],[202,6]),
[iquote('para_into,202.1.1.2.1.2,6.2.1')] ).
cnf(273,plain,
( ~ heap(sep(next(x2,nil),A))
| heap(sep(lseg(x2,nil),A)) ),
inference(demod,[status(thm),theory(equality)],[inference(factor,[status(thm)],[246]),19]),
[iquote('factor,246.1.2,demod,19')] ).
cnf(785,plain,
heap(sep(lseg(x2,nil),sep(lseg(x1,x2),emp))),
inference(hyper,[status(thm)],[273,20]),
[iquote('hyper,273,20')] ).
cnf(786,plain,
heap(sep(lseg(x1,x2),sep(lseg(x2,nil),emp))),
inference(para_into,[status(thm),theory(equality)],[785,17]),
[iquote('para_into,785.1.1,17.1.1')] ).
cnf(787,plain,
heap(sep(lseg(x1,nil),emp)),
inference(hyper,[status(thm)],[786,7]),
[iquote('hyper,786,7')] ).
cnf(788,plain,
$false,
inference(binary,[status(thm)],[787,14]),
[iquote('binary,787.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 03:00:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox2 on n024.cluster.edu,
% 1.95/2.12 Wed Jul 27 03:00:25 2022
% 1.95/2.12 The command was "./otter". The process ID is 5732.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] A=A.
% 1.95/2.12 0 [] sep(S,sep(T,Sigma))=sep(T,sep(S,Sigma)).
% 1.95/2.12 0 [] sep(lseg(X,X),Sigma)=Sigma.
% 1.95/2.12 0 [] -heap(sep(next(nil,Y),Sigma)).
% 1.95/2.12 0 [] -heap(sep(lseg(nil,Y),Sigma))|Y=nil.
% 1.95/2.12 0 [] -heap(sep(next(X,Y),sep(next(X,Z),Sigma))).
% 1.95/2.12 0 [] -heap(sep(next(X,Y),sep(lseg(X,Z),Sigma)))|X=Z.
% 1.95/2.12 0 [] -heap(sep(lseg(X,Y),sep(lseg(X,Z),Sigma)))|X=Y|X=Z.
% 1.95/2.12 0 [] -heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma)))|X=Y|heap(sep(lseg(X,Z),Sigma)).
% 1.95/2.12 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,nil),Sigma)))|heap(sep(lseg(X,nil),Sigma)).
% 1.95/2.12 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma))))|heap(sep(lseg(X,Z),sep(next(Z,W),Sigma))).
% 1.95/2.12 0 [] -heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(lseg(Z,W),Sigma))))|Z=W|heap(sep(lseg(X,Z),sep(lseg(Z,W),Sigma))).
% 1.95/2.12 0 [] nil!=x1.
% 1.95/2.12 0 [] nil!=x2.
% 1.95/2.12 0 [] heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))).
% 1.95/2.12 0 [] -heap(sep(lseg(x1,nil),emp)).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.95/2.12
% 1.95/2.12 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.12 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.12 deletion, with positive clauses in sos and nonpositive
% 1.95/2.12 clauses in usable.
% 1.95/2.12
% 1.95/2.12 dependent: set(knuth_bendix).
% 1.95/2.12 dependent: set(anl_eq).
% 1.95/2.12 dependent: set(para_from).
% 1.95/2.12 dependent: set(para_into).
% 1.95/2.12 dependent: clear(para_from_right).
% 1.95/2.12 dependent: clear(para_into_right).
% 1.95/2.12 dependent: set(para_from_vars).
% 1.95/2.12 dependent: set(eq_units_both_ways).
% 1.95/2.12 dependent: set(dynamic_demod_all).
% 1.95/2.12 dependent: set(dynamic_demod).
% 1.95/2.12 dependent: set(order_eq).
% 1.95/2.12 dependent: set(back_demod).
% 1.95/2.12 dependent: set(lrpo).
% 1.95/2.12 dependent: set(hyper_res).
% 1.95/2.12 dependent: set(unit_deletion).
% 1.95/2.12 dependent: set(factor).
% 1.95/2.12
% 1.95/2.12 ------------> process usable:
% 1.95/2.12 ** KEPT (pick-wt=6): 1 [] -heap(sep(next(nil,A),B)).
% 1.95/2.12 ** KEPT (pick-wt=9): 2 [] -heap(sep(lseg(nil,A),B))|A=nil.
% 1.95/2.12 ** KEPT (pick-wt=10): 3 [] -heap(sep(next(A,B),sep(next(A,C),D))).
% 1.95/2.12 ** KEPT (pick-wt=13): 4 [] -heap(sep(next(A,B),sep(lseg(A,C),D)))|A=C.
% 1.95/2.12 ** KEPT (pick-wt=16): 5 [] -heap(sep(lseg(A,B),sep(lseg(A,C),D)))|A=B|A=C.
% 1.95/2.12 ** KEPT (pick-wt=19): 6 [] -heap(sep(next(A,B),sep(lseg(B,C),D)))|A=B|heap(sep(lseg(A,C),D)).
% 1.95/2.12 ** KEPT (pick-wt=16): 7 [] -heap(sep(lseg(A,B),sep(lseg(B,nil),C)))|heap(sep(lseg(A,nil),C)).
% 1.95/2.12 ** KEPT (pick-wt=24): 8 [] -heap(sep(lseg(A,B),sep(lseg(B,C),sep(next(C,D),E))))|heap(sep(lseg(A,C),sep(next(C,D),E))).
% 1.95/2.12 ** KEPT (pick-wt=27): 9 [] -heap(sep(lseg(A,B),sep(lseg(B,C),sep(lseg(C,D),E))))|C=D|heap(sep(lseg(A,C),sep(lseg(C,D),E))).
% 1.95/2.12 ** KEPT (pick-wt=3): 11 [copy,10,flip.1] x1!=nil.
% 1.95/2.12 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] x2!=nil.
% 1.95/2.12 ** KEPT (pick-wt=6): 14 [] -heap(sep(lseg(x1,nil),emp)).
% 1.95/2.12
% 1.95/2.12 ------------> process sos:
% 1.95/2.12 ** KEPT (pick-wt=3): 16 [] A=A.
% 1.95/2.12 ** KEPT (pick-wt=11): 17 [] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.95/2.12 ** KEPT (pick-wt=7): 18 [] sep(lseg(A,A),B)=B.
% 1.95/2.12 ---> New Demodulator: 19 [new_demod,18] sep(lseg(A,A),B)=B.
% 1.95/2.12 ** KEPT (pick-wt=10): 20 [] heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))).
% 1.95/2.12 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 1.95/2.12 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] sep(A,sep(B,C))=sep(B,sep(A,C)).
% 1.95/2.12 >>>> Starting back demodulation with 19.
% 1.95/2.12
% 1.95/2.12 ======= end of input processing =======
% 1.95/2.12
% 1.95/2.12 =========== start of search ===========
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Resetting weight limit to 14.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Resetting weight limit to 14.
% 1.95/2.12
% 1.95/2.12 sos_size=721
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Resetting weight limit to 13.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Resetting weight limit to 13.
% 1.95/2.12
% 1.95/2.12 sos_size=722
% 1.95/2.12
% 1.95/2.12 -------- PROOF --------
% 1.95/2.12
% 1.95/2.12 ----> UNIT CONFLICT at 0.24 sec ----> 788 [binary,787.1,14.1] $F.
% 1.95/2.12
% 1.95/2.12 Length of proof is 7. Level of proof is 7.
% 1.95/2.12
% 1.95/2.12 ---------------- PROOF ----------------
% 1.95/2.12 % SZS status Unsatisfiable
% 1.95/2.12 % SZS output start Refutation
% See solution above
% 1.95/2.12 ------------ end of proof -------------
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12 ============ end of search ============
% 1.95/2.12
% 1.95/2.12 -------------- statistics -------------
% 1.95/2.12 clauses given 52
% 1.95/2.12 clauses generated 5034
% 1.95/2.12 clauses kept 784
% 1.95/2.12 clauses forward subsumed 441
% 1.95/2.12 clauses back subsumed 3
% 1.95/2.12 Kbytes malloced 5859
% 1.95/2.12
% 1.95/2.12 ----------- times (seconds) -----------
% 1.95/2.12 user CPU time 0.24 (0 hr, 0 min, 0 sec)
% 1.95/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.12
% 1.95/2.12 That finishes the proof of the theorem.
% 1.95/2.12
% 1.95/2.12 Process 5732 finished Wed Jul 27 03:00:27 2022
% 1.95/2.12 Otter interrupted
% 1.95/2.12 PROOF FOUND
%------------------------------------------------------------------------------