TSTP Solution File: LDA004-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LDA004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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 : Thu Aug 31 09:03:02 EDT 2023
% Result : Unsatisfiable 13.95s 14.04s
% Output : CNFRefutation 13.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of formulae : 69 ( 53 unt; 11 typ; 0 def)
% Number of atoms : 66 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 55 ( 13 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: ( $i * $i ) > $i ).
tff(decl_23,type,
left: ( $i * $i ) > $o ).
tff(decl_24,type,
n2: $i ).
tff(decl_25,type,
n1: $i ).
tff(decl_26,type,
n3: $i ).
tff(decl_27,type,
u: $i ).
tff(decl_28,type,
u1: $i ).
tff(decl_29,type,
u2: $i ).
tff(decl_30,type,
u3: $i ).
tff(decl_31,type,
a: $i ).
tff(decl_32,type,
b: $i ).
cnf(a2,axiom,
left(X1,f(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
cnf(a1,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
cnf(clause_7,axiom,
u1 = f(u,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_5,axiom,
n3 = f(n2,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
n2 = f(n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(a3,axiom,
( left(X1,X3)
| ~ left(X1,X2)
| ~ left(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).
cnf(clause_10,axiom,
a = f(f(n3,n2),u2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_8,axiom,
u2 = f(u,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_9,axiom,
u3 = f(u,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,axiom,
u = f(n2,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_11,axiom,
b = f(u1,u3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(prove_equation,negated_conjecture,
~ left(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_0_12,axiom,
left(X1,f(X1,X2)),
a2 ).
cnf(c_0_13,axiom,
f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)),
a1 ).
cnf(c_0_14,axiom,
u1 = f(u,n1),
clause_7 ).
cnf(c_0_15,axiom,
n3 = f(n2,n1),
clause_5 ).
cnf(c_0_16,axiom,
n2 = f(n1,n1),
clause_4 ).
cnf(c_0_17,axiom,
( left(X1,X3)
| ~ left(X1,X2)
| ~ left(X2,X3) ),
a3 ).
cnf(c_0_18,plain,
left(f(X1,X2),f(X1,f(X2,X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,axiom,
a = f(f(n3,n2),u2),
clause_10 ).
cnf(c_0_20,plain,
f(f(u,X1),u1) = f(u,f(X1,n1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,axiom,
u2 = f(u,n2),
clause_8 ).
cnf(c_0_22,axiom,
u3 = f(u,n3),
clause_9 ).
cnf(c_0_23,plain,
f(f(n2,X1),n3) = f(n2,f(X1,n1)),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_24,axiom,
u = f(n2,n2),
clause_6 ).
cnf(c_0_25,plain,
f(f(n1,X1),n2) = f(n1,f(X1,n1)),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_26,plain,
( left(X1,f(X2,X3))
| ~ left(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_27,plain,
left(a,f(f(n3,n2),f(u2,X1))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
f(u2,u1) = u3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]),c_0_22]) ).
cnf(c_0_29,plain,
f(n3,n3) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_16]),c_0_24]) ).
cnf(c_0_30,plain,
f(f(n2,X1),u) = f(n2,f(X1,n2)),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_31,plain,
f(n1,n2) = u,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_24]),c_0_16]) ).
cnf(c_0_32,plain,
( left(X1,f(X2,X3))
| ~ left(X1,X4)
| ~ left(X4,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_33,plain,
left(a,f(f(n3,n2),u3)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
left(f(X1,f(X2,X3)),f(X1,f(X2,f(X3,X4)))),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_35,plain,
f(u,f(n3,X1)) = f(n3,f(n3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_36,plain,
f(n2,f(n1,X1)) = f(n1,f(n1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_37,plain,
f(n2,u) = f(n3,u),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_31]) ).
cnf(c_0_38,plain,
( left(a,f(X1,X2))
| ~ left(f(f(n3,n2),u3),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
left(f(X1,u3),f(X1,f(n3,f(n3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_22]),c_0_35]) ).
cnf(c_0_40,plain,
f(n3,f(n2,X1)) = f(n1,f(n1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_36]) ).
cnf(c_0_41,plain,
f(f(n1,X1),u) = f(n1,f(X1,n2)),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_42,plain,
f(n1,n3) = u2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_21]),c_0_15]) ).
cnf(c_0_43,plain,
f(u,u) = f(n3,u),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_24]),c_0_37]) ).
cnf(c_0_44,plain,
f(n3,u) = f(n1,u),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_37]) ).
cnf(c_0_45,plain,
left(a,f(f(n1,f(n1,f(n3,X1))),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_13]),c_0_40]) ).
cnf(c_0_46,plain,
f(n1,f(n3,n2)) = f(u2,u),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
f(f(X1,f(X2,X3)),f(f(X1,X2),X4)) = f(f(X1,X2),f(f(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_48,plain,
f(u,u) = f(n1,u),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
left(a,f(f(n1,f(u2,u)),X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
f(f(X1,u2),f(f(X1,u),X2)) = f(f(X1,u),f(f(X1,n2),X2)),
inference(spm,[status(thm)],[c_0_47,c_0_21]) ).
cnf(c_0_51,plain,
f(f(n1,u),f(u,X1)) = f(u,f(u,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_48]) ).
cnf(c_0_52,plain,
f(f(u,X1),u3) = f(u,f(X1,n3)),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_53,axiom,
b = f(u1,u3),
clause_11 ).
cnf(c_0_54,plain,
left(a,f(u,f(u,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_47]),c_0_50]),c_0_31]),c_0_51]) ).
cnf(c_0_55,plain,
f(u,u2) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_14]),c_0_53]),c_0_42]) ).
cnf(c_0_56,negated_conjecture,
~ left(a,b),
prove_equation ).
cnf(c_0_57,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_21]),c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LDA004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Aug 27 01:25:18 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 13.95/14.04 % Version : CSE_E---1.5
% 13.95/14.04 % Problem : theBenchmark.p
% 13.95/14.04 % Proof found
% 13.95/14.04 % SZS status Theorem for theBenchmark.p
% 13.95/14.04 % SZS output start Proof
% See solution above
% 13.95/14.05 % Total time : 13.481000 s
% 13.95/14.05 % SZS output end Proof
% 13.95/14.05 % Total time : 13.484000 s
%------------------------------------------------------------------------------