TSTP Solution File: GRP728-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP728-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:22 EDT 2023
% Result : Unsatisfiable 1.02s 1.10s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 26
% Syntax : Number of formulae : 70 ( 58 unt; 12 typ; 0 def)
% Number of atoms : 58 ( 57 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 : 18 ( 8 >; 10 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 131 ( 34 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
unit: $i ).
tff(decl_23,type,
mult: ( $i * $i ) > $i ).
tff(decl_24,type,
i: $i > $i ).
tff(decl_25,type,
rd: ( $i * $i ) > $i ).
tff(decl_26,type,
asoc: ( $i * $i * $i ) > $i ).
tff(decl_27,type,
op_k: ( $i * $i ) > $i ).
tff(decl_28,type,
op_l: ( $i * $i * $i ) > $i ).
tff(decl_29,type,
op_r: ( $i * $i * $i ) > $i ).
tff(decl_30,type,
op_t: ( $i * $i ) > $i ).
tff(decl_31,type,
a: $i ).
tff(decl_32,type,
b: $i ).
tff(decl_33,type,
c: $i ).
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c02,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c08,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c07,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c09,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c22,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c22) ).
cnf(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c11,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c21,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21) ).
cnf(goals,negated_conjecture,
op_k(op_k(a,b),c) != unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_14,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_15,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_16,axiom,
mult(X1,unit) = X1,
c02 ).
cnf(c_0_17,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_19,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_20,plain,
mult(X1,i(mult(X1,X2))) = i(X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
mult(rd(X1,X2),X2) = X1,
c08 ).
cnf(c_0_22,axiom,
rd(mult(X1,X2),X2) = X1,
c07 ).
cnf(c_0_23,plain,
mult(rd(X1,X2),i(X1)) = i(X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
c09 ).
cnf(c_0_25,plain,
rd(i(X1),i(X2)) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
rd(mult(X1,mult(X2,mult(X1,X3))),X3) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_27,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_28,plain,
rd(X1,i(X2)) = rd(X2,i(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_29,plain,
rd(X1,i(mult(X1,X2))) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_28]) ).
cnf(c_0_30,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_31,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
c22 ).
cnf(c_0_32,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_33,plain,
mult(X1,mult(mult(i(X1),X2),X1)) = rd(X1,i(X2)),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_34,plain,
mult(mult(X1,X2),asoc(X3,X4,X5)) = mult(X1,mult(X2,asoc(X3,X4,X5))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_35,plain,
mult(i(mult(X1,mult(X2,X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_36,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_37,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
c11 ).
cnf(c_0_38,plain,
rd(asoc(X1,X2,X3),i(X4)) = mult(X4,asoc(X1,X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_18]) ).
cnf(c_0_39,plain,
asoc(i(mult(X1,X2)),X1,X2) = mult(mult(i(mult(X1,X2)),X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_15]),c_0_36]),c_0_32]) ).
cnf(c_0_40,plain,
mult(i(mult(X1,X2)),mult(X2,X1)) = op_k(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_41,plain,
mult(i(mult(X1,X2)),op_k(i(X2),i(X1))) = i(mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_19]),c_0_19]) ).
cnf(c_0_42,plain,
rd(X1,mult(X2,X1)) = i(X2),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_43,plain,
rd(asoc(X1,X2,X3),X4) = mult(i(X4),asoc(X1,X2,X3)),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_44,plain,
asoc(i(X1),i(X2),mult(X2,X1)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_14]),c_0_19]),c_0_40]) ).
cnf(c_0_45,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
c21 ).
cnf(c_0_46,plain,
i(op_k(i(X1),i(X2))) = op_k(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_41]),c_0_17]),c_0_40]) ).
cnf(c_0_47,plain,
rd(op_k(X1,X2),mult(X1,X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_48,plain,
rd(op_k(X1,X2),X3) = mult(i(X3),op_k(X1,X2)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
asoc(op_k(X1,X2),X3,X4) = unit,
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_50,plain,
op_k(i(X1),i(X2)) = i(op_k(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_51,plain,
mult(i(mult(X1,X2)),op_k(X1,X2)) = i(mult(X2,X1)),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
asoc(i(op_k(X1,X2)),X3,X4) = unit,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
i(op_k(X1,X2)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_51]),c_0_17]),c_0_40]) ).
cnf(c_0_54,plain,
op_k(X1,op_k(X2,X3)) = unit,
inference(spm,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
op_k(op_k(a,b),c) != unit,
goals ).
cnf(c_0_56,plain,
op_k(op_k(X1,X2),X3) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_36]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP728-1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 00:38:58 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 1.02/1.10 % Version : CSE_E---1.5
% 1.02/1.10 % Problem : theBenchmark.p
% 1.02/1.10 % Proof found
% 1.02/1.10 % SZS status Theorem for theBenchmark.p
% 1.02/1.10 % SZS output start Proof
% See solution above
% 1.07/1.10 % Total time : 0.516000 s
% 1.07/1.10 % SZS output end Proof
% 1.07/1.10 % Total time : 0.519000 s
%------------------------------------------------------------------------------