TSTP Solution File: SWW437-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW437-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:46 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 41 ( 17 unt; 22 typ; 0 def)
% Number of atoms : 23 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 13 ( 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 : 21 ( 21 usr; 18 con; 0-2 aty)
% Number of variables : 18 ( 2 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,
x6: $i ).
tff(decl_28,type,
x7: $i ).
tff(decl_29,type,
x9: $i ).
tff(decl_30,type,
x11: $i ).
tff(decl_31,type,
x16: $i ).
tff(decl_32,type,
x12: $i ).
tff(decl_33,type,
x3: $i ).
tff(decl_34,type,
x8: $i ).
tff(decl_35,type,
x4: $i ).
tff(decl_36,type,
x15: $i ).
tff(decl_37,type,
x2: $i ).
tff(decl_38,type,
x1: $i ).
tff(decl_39,type,
x13: $i ).
tff(decl_40,type,
x14: $i ).
tff(decl_41,type,
x10: $i ).
tff(decl_42,type,
x5: $i ).
tff(decl_43,type,
emp: $i ).
cnf(premise_27,hypothesis,
heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_27) ).
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(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).
cnf(premise_10,hypothesis,
x7 != x16,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_10) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(premise_6,hypothesis,
x3 != x8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_6) ).
cnf(c_0_6,hypothesis,
heap(sep(lseg(x5,x1),sep(lseg(x12,x8),sep(lseg(x2,x6),sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x10,x15),sep(lseg(x10,x5),sep(lseg(x7,x1),sep(lseg(x3,x12),sep(lseg(x3,x16),sep(lseg(x11,x8),emp)))))))))))),
premise_27 ).
cnf(c_0_7,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_8,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
wellformedness_5 ).
cnf(c_0_9,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x3),sep(lseg(x7,x1),sep(lseg(x3,x16),sep(lseg(x3,x12),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp)))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_10,hypothesis,
x7 != x16,
premise_10 ).
cnf(c_0_11,hypothesis,
x3 = x16,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_13,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x12),sep(lseg(x7,x1),sep(lseg(x12,x8),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_12]),c_0_12]),c_0_7]) ).
cnf(c_0_14,hypothesis,
x12 = x16,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_10]) ).
cnf(c_0_15,hypothesis,
x3 != x8,
premise_6 ).
cnf(c_0_16,hypothesis,
heap(sep(lseg(x16,x7),sep(lseg(x16,x8),sep(lseg(x7,x1),sep(lseg(x10,x5),sep(lseg(x10,x15),sep(lseg(x11,x8),sep(lseg(x5,x1),sep(lseg(x2,x6),emp))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_11]),c_0_11]),c_0_11]),c_0_12]),c_0_12]),c_0_12]),c_0_7]) ).
cnf(c_0_17,hypothesis,
x8 != x16,
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_17]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW437-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 19:55:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.006000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.010000 s
%------------------------------------------------------------------------------