TSTP Solution File: GRP711+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP711+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 : n029.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:18 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 26 unt; 6 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 25 ( 8 ~; 8 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn; 20 !; 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,
esk1_0: $i ).
tff(decl_26,type,
esk2_0: $i ).
tff(decl_27,type,
esk3_0: $i ).
fof(f01,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f03,axiom,
! [X2,X3,X1] : mult(X1,mult(X3,mult(X3,X2))) = mult(mult(mult(X1,X3),X3),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( ( mult(X4,X5) = mult(X4,X6)
=> X5 = X6 )
& ( mult(X5,X4) = mult(X6,X4)
=> X5 = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f05,axiom,
! [X1] : mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f04,axiom,
! [X1] : mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(c_0_6,plain,
! [X7] : mult(X7,unit) = X7,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_7,plain,
! [X9,X10,X11] : mult(X11,mult(X10,mult(X10,X9))) = mult(mult(mult(X11,X10),X10),X9),
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6] :
( ( mult(X4,X5) = mult(X4,X6)
=> X5 = X6 )
& ( mult(X5,X4) = mult(X6,X4)
=> X5 = X6 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_9,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X13] : mult(i(X13),X13) = unit,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_12,plain,
! [X8] : mult(unit,X8) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_13,plain,
! [X12] : mult(X12,i(X12)) = unit,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_14,negated_conjecture,
( ( mult(esk2_0,esk1_0) = mult(esk3_0,esk1_0)
| mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0) )
& ( esk2_0 != esk3_0
| mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0) )
& ( mult(esk2_0,esk1_0) = mult(esk3_0,esk1_0)
| esk2_0 != esk3_0 )
& ( esk2_0 != esk3_0
| esk2_0 != esk3_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_15,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_16,plain,
mult(i(X1),X1) = unit,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
mult(X1,i(X1)) = unit,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( mult(esk2_0,esk1_0) = mult(esk3_0,esk1_0)
| mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_21,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
mult(X1,mult(X2,mult(X2,i(mult(mult(X1,X2),X2))))) = unit,
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_23,negated_conjecture,
( mult(esk2_0,mult(esk1_0,esk1_0)) = mult(esk3_0,mult(esk1_0,esk1_0))
| mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_15]) ).
cnf(c_0_24,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
mult(X1,mult(X1,i(mult(X1,X1)))) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( esk2_0 != esk3_0
| esk2_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( mult(esk2_0,mult(esk1_0,mult(esk1_0,X1))) = mult(esk3_0,mult(esk1_0,mult(esk1_0,X1)))
| mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_20]) ).
cnf(c_0_28,plain,
mult(X1,i(mult(X1,X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_9]) ).
cnf(c_0_29,negated_conjecture,
esk3_0 != esk2_0,
inference(cn,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),c_0_9]),c_0_18]),c_0_9]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP711+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 20:55:41 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.013000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.016000 s
%------------------------------------------------------------------------------