TSTP Solution File: GRP751-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP751-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n008.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:23:36 EDT 2023
% Result : Unsatisfiable 1.21s 1.30s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 53 unt; 6 typ; 0 def)
% Number of atoms : 53 ( 52 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 140 ( 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,
a: $i ).
tff(decl_26,type,
b: $i ).
tff(decl_27,type,
c: $i ).
cnf(f07,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f06,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_8,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
f07 ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_11,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X2)) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rd(mult(X1,mult(X2,X3)),mult(X3,X3)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
rd(mult(X1,X2),mult(X3,X3)) = mult(rd(X1,X3),rd(X2,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_14,plain,
mult(rd(rd(X1,X2),X3),rd(X2,X3)) = rd(X1,mult(X3,X3)),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X3)) = mult(X1,mult(X3,X3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,plain,
rd(rd(X1,mult(X2,X2)),rd(X3,X2)) = rd(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
f05 ).
cnf(c_0_18,plain,
rd(mult(X1,mult(X2,X2)),mult(X3,X2)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_19,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
f06 ).
cnf(c_0_20,plain,
rd(rd(X1,mult(X2,X2)),X3) = rd(rd(X1,mult(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
rd(mult(mult(X1,mult(X1,X1)),mult(X2,X3)),mult(mult(X1,X1),X3)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
rd(mult(X1,mult(X2,X2)),X3) = mult(rd(X1,rd(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_23,plain,
rd(mult(mult(X1,X2),mult(X1,X3)),mult(X2,X3)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_24,plain,
mult(rd(X1,rd(X2,X1)),rd(X3,X1)) = rd(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]),c_0_22]),c_0_13]),c_0_10]) ).
cnf(c_0_25,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_26,plain,
rd(mult(rd(mult(X1,X2),X3),X1),X2) = rd(mult(X1,X1),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_12]) ).
cnf(c_0_27,plain,
rd(rd(mult(X1,X2),X3),rd(X2,X1)) = rd(X1,rd(X3,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_28,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_25]) ).
cnf(c_0_29,plain,
mult(rd(X1,rd(X2,X3)),rd(X1,X3)) = rd(mult(X1,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_22]),c_0_10]) ).
cnf(c_0_30,plain,
rd(X1,rd(ld(X2,mult(X1,X3)),X1)) = rd(X2,rd(X3,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
rd(mult(X1,X1),ld(X2,mult(X1,X3))) = rd(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_32,plain,
mult(rd(X1,rd(X2,X3)),rd(X3,X3)) = rd(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_33,plain,
rd(mult(X1,X2),mult(X3,X2)) = mult(rd(X1,X3),rd(X2,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_10]) ).
cnf(c_0_34,plain,
mult(rd(rd(X1,X2),X3),rd(X2,X2)) = rd(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_9]) ).
cnf(c_0_35,plain,
rd(rd(X1,mult(X2,X3)),rd(X3,X3)) = rd(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_10,c_0_34]) ).
cnf(c_0_36,plain,
rd(rd(mult(X1,mult(X2,X3)),X3),X2) = rd(X1,rd(X3,X3)),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_37,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(rd(X1,rd(X3,X3)),X2),
inference(spm,[status(thm)],[c_0_9,c_0_36]) ).
cnf(c_0_38,plain,
mult(mult(rd(X1,rd(X2,X2)),X3),X2) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_37]) ).
cnf(c_0_39,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_40,plain,
mult(mult(X1,rd(X2,X2)),mult(X3,X2)) = mult(mult(X1,X3),X2),
inference(spm,[status(thm)],[c_0_38,c_0_10]) ).
cnf(c_0_41,plain,
mult(mult(X1,rd(X2,X3)),mult(X1,X3)) = mult(mult(X1,X1),X2),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_42,plain,
mult(mult(X1,X2),mult(X1,ld(X2,X3))) = mult(mult(X1,X1),X3),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_43,plain,
ld(mult(X1,rd(X2,X2)),mult(mult(X1,X3),X2)) = mult(X3,X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
mult(mult(X1,rd(X2,ld(X1,X3))),X3) = mult(mult(X1,X1),X2),
inference(spm,[status(thm)],[c_0_41,c_0_25]) ).
cnf(c_0_45,plain,
ld(mult(X1,X2),mult(mult(X1,X1),X3)) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_39,c_0_42]) ).
cnf(c_0_46,plain,
mult(rd(X1,ld(X2,X3)),X3) = mult(X2,ld(rd(X3,X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_47,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_39,c_0_9]) ).
cnf(c_0_48,plain,
mult(rd(X1,X2),ld(rd(X1,X1),X3)) = mult(rd(X3,X2),X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
mult(rd(mult(rd(X1,X1),X2),X3),X1) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_50,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
goals ).
cnf(c_0_51,plain,
mult(mult(rd(X1,X1),X2),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_49]),c_0_11]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP751-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 21:10:32 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 1.21/1.30 % Version : CSE_E---1.5
% 1.21/1.30 % Problem : theBenchmark.p
% 1.21/1.30 % Proof found
% 1.21/1.30 % SZS status Theorem for theBenchmark.p
% 1.21/1.30 % SZS output start Proof
% See solution above
% 1.21/1.30 % Total time : 0.708000 s
% 1.21/1.30 % SZS output end Proof
% 1.21/1.30 % Total time : 0.710000 s
%------------------------------------------------------------------------------