TSTP Solution File: GRP660-11 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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 00:22:50 EDT 2023
% Result : Unsatisfiable 0.51s 0.92s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 46 unt; 5 typ; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ld: ( $i * $i ) > $i ).
tff(decl_23,type,
mult: ( $i * $i ) > $i ).
tff(decl_24,type,
rd: ( $i * $i ) > $i ).
tff(decl_25,type,
x0: $i ).
tff(decl_26,type,
x1: $i ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(goal,negated_conjecture,
mult(x0,rd(x1,x1)) != x0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
f05 ).
cnf(c_0_8,plain,
rd(mult(X1,mult(X2,mult(X3,X1))),X1) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_10,plain,
rd(mult(X1,mult(X2,X3)),X1) = mult(mult(X1,X2),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
mult(mult(X1,rd(X2,X3)),rd(X3,X1)) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_13,plain,
rd(rd(mult(X1,X2),X1),rd(X3,X1)) = mult(X1,rd(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
rd(X1,rd(X2,X1)) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_16,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_17,plain,
rd(rd(mult(X1,X2),X1),X3) = mult(X1,rd(X2,mult(X3,X1))),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_18,plain,
ld(mult(X1,rd(X1,X2)),X1) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_20,plain,
mult(X1,rd(ld(X1,X2),mult(X3,X1))) = rd(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
rd(ld(X1,X2),X2) = ld(mult(X2,X1),X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
rd(ld(X1,X2),mult(X3,X1)) = ld(X1,rd(rd(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_23,plain,
ld(mult(mult(X1,X2),X2),mult(X1,X2)) = ld(X2,rd(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6]) ).
cnf(c_0_24,plain,
ld(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_6]),c_0_12]) ).
cnf(c_0_25,plain,
mult(rd(X1,X2),mult(X2,mult(X3,rd(X1,X2)))) = mult(mult(X1,X3),rd(X1,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_26,plain,
mult(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_27,plain,
rd(rd(X1,X2),rd(X3,X2)) = mult(X2,rd(ld(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_28,plain,
mult(rd(X1,X1),mult(X1,rd(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11]),c_0_6]) ).
cnf(c_0_29,plain,
mult(X1,rd(ld(X1,mult(X2,X1)),X3)) = rd(X2,rd(X3,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_6]) ).
cnf(c_0_30,plain,
mult(X1,rd(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_14]) ).
cnf(c_0_31,plain,
mult(mult(X1,X2),rd(ld(X2,X3),X1)) = rd(mult(X1,X3),X1),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_32,plain,
rd(ld(X1,mult(X2,X1)),X3) = ld(X1,rd(X2,rd(X3,X1))),
inference(spm,[status(thm)],[c_0_12,c_0_29]) ).
cnf(c_0_33,plain,
rd(X1,X1) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_30]) ).
cnf(c_0_34,plain,
mult(mult(X1,X2),ld(X2,rd(X3,rd(X1,X2)))) = mult(mult(X1,X3),rd(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_10]) ).
cnf(c_0_35,plain,
mult(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_33]),c_0_33]),c_0_33]) ).
cnf(c_0_36,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_33]),c_0_33]),c_0_33]) ).
cnf(c_0_37,plain,
mult(X1,mult(ld(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_38,plain,
mult(mult(ld(X1,X1),X2),ld(X1,X1)) = rd(X2,ld(X1,X1)),
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_34,c_0_35]),c_0_33]),c_0_36]),c_0_16]),c_0_33]),c_0_36]) ).
cnf(c_0_39,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(X3,mult(ld(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_37,c_0_9]) ).
cnf(c_0_40,negated_conjecture,
mult(x0,rd(x1,x1)) != x0,
goal ).
cnf(c_0_41,plain,
mult(ld(X1,X1),mult(X2,ld(X1,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_38]),c_0_9]),c_0_35]) ).
cnf(c_0_42,plain,
mult(mult(X1,ld(X2,X2)),X2) = mult(X2,mult(ld(X2,X1),X2)),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_43,negated_conjecture,
mult(x0,ld(x1,x1)) != x0,
inference(rw,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_44,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_41]),c_0_16]),c_0_36]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP660-11 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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 : Mon Aug 28 23:42:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.51/0.92 % Version : CSE_E---1.5
% 0.51/0.92 % Problem : theBenchmark.p
% 0.51/0.92 % Proof found
% 0.51/0.92 % SZS status Theorem for theBenchmark.p
% 0.51/0.92 % SZS output start Proof
% See solution above
% 0.51/0.93 % Total time : 0.361000 s
% 0.51/0.93 % SZS output end Proof
% 0.51/0.93 % Total time : 0.364000 s
%------------------------------------------------------------------------------