TSTP Solution File: GRP681-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP681-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 : n023.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:01 EDT 2023
% Result : Unsatisfiable 1.55s 1.60s
% Output : CNFRefutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 57 ( 50 unt; 7 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 65 ( 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,
op_c: $i ).
tff(decl_27,type,
op_d: $i ).
tff(decl_28,type,
a: $i ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c09,axiom,
mult(op_d,X1) = mult(X1,op_d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(mult(mult(op_c,op_c),op_d),a) != mult(a,mult(mult(op_c,op_c),op_d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c_0_10,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_13,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_14,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,axiom,
mult(op_d,X1) = mult(X1,op_d),
c09 ).
cnf(c_0_16,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_18,plain,
mult(op_c,mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,op_c))),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_19,plain,
mult(op_c,mult(X1,X1)) = mult(X1,mult(X1,op_c)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
mult(op_d,mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,op_d))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,plain,
mult(mult(op_d,mult(op_d,X1)),X2) = mult(op_d,mult(X1,mult(op_d,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_22,plain,
mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]) ).
cnf(c_0_23,plain,
mult(op_d,mult(X1,mult(op_c,op_d))) = mult(op_c,mult(op_d,mult(X1,op_d))),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,plain,
mult(op_c,mult(X1,X1)) = mult(X1,mult(op_c,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_25,plain,
mult(op_d,mult(op_c,mult(op_c,X1))) = mult(op_c,mult(X1,mult(op_c,op_d))),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_26,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_27,plain,
mult(op_c,mult(mult(op_d,X1),mult(op_c,op_d))) = mult(op_c,mult(op_d,mult(op_d,mult(op_c,X1)))),
inference(rw,[status(thm)],[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_21,c_0_22]),c_0_23]),c_0_24]),c_0_17]),c_0_14]),c_0_14]),c_0_25]) ).
cnf(c_0_28,plain,
ld(op_d,mult(X1,op_d)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_29,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_30,plain,
ld(X1,mult(op_c,mult(X1,mult(X2,X1)))) = mult(X2,mult(X1,op_c)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_31,plain,
rd(mult(X1,mult(X2,mult(X1,X3))),X3) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_32,plain,
mult(mult(op_d,X1),mult(op_c,op_d)) = mult(op_d,mult(op_d,mult(op_c,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_12]) ).
cnf(c_0_33,plain,
rd(X1,op_d) = ld(op_d,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
ld(op_d,mult(op_c,mult(op_d,mult(op_d,X1)))) = mult(X1,mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_13]) ).
cnf(c_0_35,negated_conjecture,
mult(mult(mult(op_c,op_c),op_d),a) != mult(a,mult(mult(op_c,op_c),op_d)),
goals ).
cnf(c_0_36,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_37,plain,
mult(mult(op_c,X1),mult(op_c,op_d)) = mult(op_c,mult(op_c,mult(op_d,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_13]) ).
cnf(c_0_38,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_39,negated_conjecture,
mult(mult(op_d,mult(op_c,op_c)),a) != mult(a,mult(op_d,mult(op_c,op_c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_15]),c_0_15]) ).
cnf(c_0_40,plain,
mult(op_d,mult(op_c,op_c)) = mult(op_c,mult(op_c,op_d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_11]) ).
cnf(c_0_41,plain,
mult(op_c,mult(op_c,mult(op_d,ld(op_c,X1)))) = mult(X1,mult(op_c,op_d)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
mult(mult(op_c,mult(op_c,op_d)),a) != mult(a,mult(op_c,mult(op_c,op_d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]) ).
cnf(c_0_43,plain,
mult(mult(X1,mult(X1,op_d)),X2) = mult(X1,mult(op_d,mult(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_44,plain,
mult(op_c,mult(op_d,ld(op_c,X1))) = ld(op_c,mult(X1,mult(op_c,op_d))),
inference(spm,[status(thm)],[c_0_12,c_0_41]) ).
cnf(c_0_45,plain,
ld(op_c,mult(X1,mult(op_c,op_c))) = mult(op_c,X1),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_46,plain,
mult(mult(X1,mult(op_c,op_c)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_47,negated_conjecture,
mult(a,mult(op_c,mult(op_c,op_d))) != mult(op_c,mult(op_d,mult(op_c,a))),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
mult(op_c,mult(op_d,mult(op_c,X1))) = mult(X1,mult(op_c,mult(op_c,op_d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_12]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP681-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 23:11:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.41/0.61 start to proof: theBenchmark
% 1.55/1.60 % Version : CSE_E---1.5
% 1.55/1.60 % Problem : theBenchmark.p
% 1.55/1.60 % Proof found
% 1.55/1.60 % SZS status Theorem for theBenchmark.p
% 1.55/1.60 % SZS output start Proof
% See solution above
% 1.55/1.60 % Total time : 0.980000 s
% 1.55/1.60 % SZS output end Proof
% 1.55/1.60 % Total time : 0.984000 s
%------------------------------------------------------------------------------