TSTP Solution File: SWW407-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW407-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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 : Fri Sep 1 00:17:40 EDT 2023
% Result : Unsatisfiable 1.30s 1.44s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 35 ( 17 unt; 10 typ; 0 def)
% Number of atoms : 37 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
sep: ( $i * $i ) > $i ).
tff(decl_23,type,
lseg: ( $i * $i ) > $i ).
tff(decl_24,type,
nil: $i ).
tff(decl_25,type,
next: ( $i * $i ) > $i ).
tff(decl_26,type,
heap: $i > $o ).
tff(decl_27,type,
x1: $i ).
tff(decl_28,type,
x2: $i ).
tff(decl_29,type,
x3: $i ).
tff(decl_30,type,
x4: $i ).
tff(decl_31,type,
emp: $i ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(unfolding_2,axiom,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(unfolding_4,axiom,
( heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_4) ).
cnf(premise_9,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_9) ).
cnf(premise_5,hypothesis,
x1 != x2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_5) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).
cnf(c_0_7,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_8,axiom,
( X1 = X2
| heap(sep(lseg(X1,X3),X4))
| ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
unfolding_2 ).
cnf(c_0_9,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_10,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,axiom,
( heap(sep(lseg(X1,X3),sep(next(X3,X4),X5)))
| ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5)))) ),
unfolding_4 ).
cnf(c_0_12,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),X3))
| ~ heap(sep(next(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X4,sep(X1,sep(X2,sep(X3,X5)))),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
premise_9 ).
cnf(c_0_15,plain,
( heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5))))
| ~ heap(sep(lseg(X1,X6),sep(lseg(X6,X2),sep(X3,sep(next(X2,X4),X5))))) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_16,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X2,sep(X1,X4))),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_17,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),sep(X3,sep(X4,sep(X5,X6)))))
| ~ heap(sep(X3,sep(X4,sep(X5,sep(next(X1,X2),X6))))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x3,x1),sep(next(x2,x4),sep(next(x1,x2),emp))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_19,hypothesis,
x1 != x2,
premise_5 ).
cnf(c_0_20,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
conclusion_1 ).
cnf(c_0_21,plain,
( heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5))))
| ~ heap(sep(X3,sep(lseg(X6,X2),sep(lseg(X1,X6),sep(next(X2,X4),X5))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x1,x2),sep(lseg(x3,x1),sep(next(x2,x4),emp))))),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(lseg(x3,x2),sep(next(x2,x4),emp)))),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_7]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW407-1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n001.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 : Sun Aug 27 21:59:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 1.30/1.44 % Version : CSE_E---1.5
% 1.30/1.44 % Problem : theBenchmark.p
% 1.30/1.44 % Proof found
% 1.30/1.44 % SZS status Theorem for theBenchmark.p
% 1.30/1.44 % SZS output start Proof
% See solution above
% 1.30/1.44 % Total time : 0.862000 s
% 1.30/1.44 % SZS output end Proof
% 1.30/1.44 % Total time : 0.864000 s
%------------------------------------------------------------------------------