TSTP Solution File: GRP756-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP756-1 : 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 00:23:37 EDT 2023
% Result : Unsatisfiable 0.16s 0.56s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 30 unt; 6 typ; 0 def)
% Number of atoms : 30 ( 29 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 : 66 ( 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(f05,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_6,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
f05 ).
cnf(c_0_7,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_8,plain,
mult(rd(X1,X2),mult(mult(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_10,plain,
mult(rd(X1,X2),mult(X2,mult(mult(X2,X2),X3))) = mult(X1,mult(X2,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
mult(X1,mult(X2,ld(mult(X2,X2),X3))) = mult(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
mult(rd(X1,X2),mult(X2,X3)) = mult(X1,mult(rd(X2,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_13,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_14,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_15,plain,
mult(X1,mult(mult(X2,X2),ld(X2,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_16,plain,
mult(mult(X1,X2),mult(rd(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
ld(X1,mult(mult(X1,X2),X3)) = mult(mult(X2,X2),ld(X2,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,plain,
mult(X1,ld(X2,mult(mult(X2,X3),X4))) = mult(mult(X1,X3),X4),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
mult(mult(X1,X1),ld(X1,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_21,plain,
mult(mult(X1,ld(X2,X2)),X3) = mult(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]) ).
cnf(c_0_22,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_13]) ).
cnf(c_0_23,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_7]),c_0_22]) ).
cnf(c_0_24,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_25,plain,
mult(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_24]) ).
cnf(c_0_26,plain,
mult(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
goals ).
cnf(c_0_28,plain,
mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP756-1 : 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.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 29 01:53:40 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.53 start to proof: theBenchmark
% 0.16/0.56 % Version : CSE_E---1.5
% 0.16/0.56 % Problem : theBenchmark.p
% 0.16/0.56 % Proof found
% 0.16/0.56 % SZS status Theorem for theBenchmark.p
% 0.16/0.56 % SZS output start Proof
% See solution above
% 0.16/0.56 % Total time : 0.014000 s
% 0.16/0.56 % SZS output end Proof
% 0.16/0.56 % Total time : 0.016000 s
%------------------------------------------------------------------------------