TSTP Solution File: GRP687-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP687-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 : n020.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:04 EDT 2023
% Result : Unsatisfiable 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 46 ( 39 unt; 7 typ; 0 def)
% Number of atoms : 39 ( 38 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 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,
unit: $i ).
tff(decl_26,type,
a: $i ).
tff(decl_27,type,
b: $i ).
tff(decl_28,type,
c: $i ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c07,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_7,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_8,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
c07 ).
cnf(c_0_9,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_11,plain,
mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rd(mult(X1,mult(X1,mult(X2,X3))),X3) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_14,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_15,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X1,X2)),ld(X3,X2)) = mult(X1,mult(X1,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rd(mult(X1,X1),ld(X2,unit)) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,plain,
ld(mult(X1,mult(X1,X2)),mult(X1,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
mult(X1,mult(X1,mult(ld(X1,X2),X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_21,plain,
ld(mult(X1,X2),mult(X1,X1)) = ld(ld(X1,X2),unit),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_22,plain,
mult(X1,mult(ld(X1,X2),X3)) = ld(X1,mult(mult(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
ld(ld(X1,unit),unit) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_7]),c_0_14]) ).
cnf(c_0_24,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_7]),c_0_14]) ).
cnf(c_0_25,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_26,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_27,plain,
mult(X1,mult(X1,rd(X2,X3))) = rd(mult(X1,mult(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_28,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_29,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_30,plain,
ld(rd(X1,X2),unit) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_31,plain,
mult(X1,mult(X1,ld(X2,unit))) = rd(mult(X1,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_7]) ).
cnf(c_0_32,plain,
mult(rd(X1,X2),X3) = ld(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
mult(X1,mult(X1,ld(X2,X3))) = ld(rd(X2,mult(X1,X1)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_31]),c_0_32]),c_0_29]) ).
cnf(c_0_34,plain,
ld(rd(X1,mult(X2,X2)),mult(X1,X3)) = mult(X2,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_35,plain,
ld(X1,mult(mult(X1,mult(X2,X2)),X3)) = mult(X2,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
goals ).
cnf(c_0_37,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP687-1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 21:19:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.029000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.031000 s
%------------------------------------------------------------------------------