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