TSTP Solution File: GRP700+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP700+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 : n027.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:12 EDT 2023
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 35 ( 25 unt; 5 typ; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn; 25 !; 2 ?; 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,
esk1_0: $i ).
fof(f08,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(X1,mult(X3,X1))) = mult(mult(X2,mult(X1,mult(X1,X3))),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(goals,conjecture,
! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(c_0_7,plain,
! [X19,X20,X21] : mult(mult(X21,X20),mult(X20,mult(X19,X20))) = mult(mult(X21,mult(X20,mult(X20,X19))),X20),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_8,plain,
! [X15] : mult(unit,X15) = X15,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_9,plain,
! [X12,X13] : rd(mult(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
fof(c_0_14,plain,
! [X10,X11] : mult(rd(X11,X10),X10) = X11,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X1,mult(X2,X1))),X1) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X14] : mult(X14,unit) = X14,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_19,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_20,negated_conjecture,
! [X23] :
( mult(X23,esk1_0) != unit
| mult(esk1_0,X23) != unit ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_21,plain,
rd(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,rd(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( mult(X1,esk1_0) != unit
| mult(esk1_0,X1) != unit ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
mult(X1,mult(X1,rd(unit,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]) ).
cnf(c_0_26,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( mult(esk1_0,rd(X1,esk1_0)) != unit
| X1 != unit ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_28,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP700+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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 00:53:22 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.012000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.015000 s
%------------------------------------------------------------------------------