TSTP Solution File: GRP730-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP730-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 : n022.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:23 EDT 2023
% Result : Unsatisfiable 1.00s 1.07s
% Output : CNFRefutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 38 ( 25 unt; 13 typ; 0 def)
% Number of atoms : 25 ( 24 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 : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 47 ( 14 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 ).
tff(decl_34,type,
d: $i ).
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
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(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c11,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c21,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21) ).
cnf(goals,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_9,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_12,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_13,plain,
mult(i(mult(X1,mult(X2,X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_15,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
c11 ).
cnf(c_0_17,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_13,c_0_14]),c_0_15]),c_0_11]) ).
cnf(c_0_18,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_19,plain,
mult(i(mult(X1,X2)),mult(X2,X1)) = op_k(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_20,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
c21 ).
cnf(c_0_21,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_17,c_0_9]),c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
goals ).
cnf(c_0_23,plain,
asoc(op_k(X1,X2),X3,X4) = unit,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
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.08/0.10 % Problem : GRP730-1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.09/0.31 % Computer : n022.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Aug 28 22:34:39 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.53 start to proof: theBenchmark
% 1.00/1.07 % Version : CSE_E---1.5
% 1.00/1.07 % Problem : theBenchmark.p
% 1.00/1.07 % Proof found
% 1.00/1.07 % SZS status Theorem for theBenchmark.p
% 1.00/1.07 % SZS output start Proof
% See solution above
% 1.00/1.07 % Total time : 0.520000 s
% 1.00/1.07 % SZS output end Proof
% 1.00/1.07 % Total time : 0.523000 s
%------------------------------------------------------------------------------