TSTP Solution File: GRP669-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP669-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:22:58 EDT 2023
% Result : Unsatisfiable 0.72s 0.81s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 25 unt; 7 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 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 : 50 ( 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(c10,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c09,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c08,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c_0_8,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
c10 ).
cnf(c_0_9,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_10,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_11,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
c09 ).
cnf(c_0_12,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
c07 ).
cnf(c_0_13,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
goals ).
cnf(c_0_15,plain,
mult(mult(X1,mult(X2,X3)),X1) = mult(X1,mult(mult(X2,X3),X1)),
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_16,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
c08 ).
cnf(c_0_17,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_19,negated_conjecture,
mult(mult(a,mult(mult(b,c),a)),b) != mult(mult(a,b),mult(c,mult(a,b))),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
mult(mult(X1,X2),mult(mult(X3,X1),mult(X4,mult(X3,X1)))) = mult(X1,mult(mult(X2,mult(X3,mult(mult(X1,X4),X3))),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_17]),c_0_8]),c_0_16]) ).
cnf(c_0_21,plain,
ld(mult(X1,X2),mult(X1,mult(mult(X2,X3),X1))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_22,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(b,mult(mult(c,a),b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_17]),c_0_8]) ).
cnf(c_0_23,plain,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(X1,mult(X2,mult(mult(X3,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_21]),c_0_17]),c_0_8]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP669-1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 02:05:10 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 0.72/0.81 % Version : CSE_E---1.5
% 0.72/0.81 % Problem : theBenchmark.p
% 0.72/0.81 % Proof found
% 0.72/0.81 % SZS status Theorem for theBenchmark.p
% 0.72/0.81 % SZS output start Proof
% See solution above
% 0.72/0.81 % Total time : 0.214000 s
% 0.72/0.81 % SZS output end Proof
% 0.72/0.81 % Total time : 0.217000 s
%------------------------------------------------------------------------------