TSTP Solution File: NUM420-1.000 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 10:37:15 EDT 2023
% Result : Unsatisfiable 1.12s 1.21s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 27
% Syntax : Number of formulae : 62 ( 33 unt; 12 typ; 0 def)
% Number of atoms : 73 ( 47 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 55 ( 32 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 19 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less: ( $i * $i ) > $o ).
tff(decl_23,type,
times: ( $i * $i ) > $i ).
tff(decl_24,type,
plus: ( $i * $i ) > $i ).
tff(decl_25,type,
n0: $i ).
tff(decl_26,type,
n1: $i ).
tff(decl_27,type,
p__0: $i ).
tff(decl_28,type,
element: ( $i * $i ) > $o ).
tff(decl_29,type,
s_5: ( $i * $i ) > $i ).
tff(decl_30,type,
s_6: ( $i * $i ) > $i ).
tff(decl_31,type,
s_7: $i > $i ).
tff(decl_32,type,
s_1: $i > $i ).
tff(decl_33,type,
s_4: $i > $i ).
cnf(clause_34,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_34) ).
cnf(clause_36,negated_conjecture,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_36) ).
cnf(clause_44,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_44) ).
cnf(axiom_14,axiom,
plus(n1,plus(X1,n1)) != n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
cnf(axiom_5,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
cnf(clause_18,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
cnf(axiom_6,axiom,
plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
cnf(clause_53,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_53) ).
cnf(clause_24,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
cnf(axiom_8,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
cnf(axiom_20,axiom,
times(n1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_20) ).
cnf(axiom_30,axiom,
less(n0,plus(X1,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).
cnf(axiom_2,axiom,
plus(X1,n0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
cnf(clause_48,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_48) ).
cnf(axiom_15,axiom,
times(X1,X2) = times(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
cnf(c_0_15,negated_conjecture,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
clause_34 ).
cnf(c_0_16,negated_conjecture,
plus(n0,n1) = n1,
clause_36 ).
cnf(c_0_17,negated_conjecture,
( less(n1,X1)
| X1 != p__0 ),
clause_44 ).
cnf(c_0_18,negated_conjecture,
( less(n0,p__0)
| ~ less(n1,p__0) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
less(n1,p__0),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,axiom,
plus(n1,plus(X1,n1)) != n1,
axiom_14 ).
cnf(c_0_21,axiom,
plus(X1,plus(X2,X3)) = plus(plus(X1,X2),X3),
axiom_5 ).
cnf(c_0_22,negated_conjecture,
( p__0 = plus(s_7(p__0),n1)
| ~ less(n0,p__0) ),
clause_18 ).
cnf(c_0_23,negated_conjecture,
less(n0,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,plain,
plus(n1,plus(X1,plus(X2,n1))) != n1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
plus(s_7(p__0),n1) = p__0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
plus(n1,plus(X1,p__0)) != n1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
plus(X1,X2) = plus(X2,X1),
axiom_6 ).
cnf(c_0_28,negated_conjecture,
plus(X1,plus(p__0,n1)) != n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( X1 = n1
| s_1(X1) = p__0 ),
clause_53 ).
cnf(c_0_30,negated_conjecture,
( ~ less(n0,X1)
| ~ less(n0,p__0)
| ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != plus(n0,times(X3,p__0)) ),
clause_24 ).
cnf(c_0_31,axiom,
plus(n0,X1) = X1,
axiom_8 ).
cnf(c_0_32,negated_conjecture,
plus(p__0,plus(n1,X1)) != n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( plus(n1,X1) = plus(X2,plus(X3,X1))
| s_1(plus(X2,X3)) = p__0 ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( plus(X1,times(X2,p__0)) != times(X3,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_23])]) ).
cnf(c_0_35,axiom,
times(n1,X1) = X1,
axiom_20 ).
cnf(c_0_36,axiom,
less(n0,plus(X1,n1)),
axiom_30 ).
cnf(c_0_37,negated_conjecture,
( s_1(plus(p__0,n1)) = p__0
| plus(n1,X1) != n1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
plus(X1,n0) = X1,
axiom_2 ).
cnf(c_0_39,negated_conjecture,
plus(n1,p__0) != n1,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_40,negated_conjecture,
( plus(X1,p__0) != times(X2,p__0)
| ~ less(X1,p__0)
| ~ less(n0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_42,negated_conjecture,
( X1 = n1
| times(s_1(X1),s_4(X1)) = X1 ),
clause_48 ).
cnf(c_0_43,negated_conjecture,
s_1(plus(p__0,n1)) = p__0,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
plus(p__0,n1) != n1,
inference(rw,[status(thm)],[c_0_39,c_0_27]) ).
cnf(c_0_45,negated_conjecture,
plus(p__0,n1) != times(X1,p__0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_19]),c_0_27]),c_0_41])]) ).
cnf(c_0_46,axiom,
times(X1,X2) = times(X2,X1),
axiom_15 ).
cnf(c_0_47,negated_conjecture,
times(p__0,s_4(plus(p__0,n1))) = plus(p__0,n1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
plus(p__0,n1) != times(p__0,X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_47,c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n015.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 : Fri Aug 25 16:39:52 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.53 start to proof: theBenchmark
% 1.12/1.21 % Version : CSE_E---1.5
% 1.12/1.21 % Problem : theBenchmark.p
% 1.12/1.21 % Proof found
% 1.12/1.21 % SZS status Theorem for theBenchmark.p
% 1.12/1.21 % SZS output start Proof
% See solution above
% 1.12/1.22 % Total time : 0.671000 s
% 1.12/1.22 % SZS output end Proof
% 1.12/1.22 % Total time : 0.673000 s
%------------------------------------------------------------------------------