TSTP Solution File: GRP710+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP710+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 : n007.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.55s 0.57s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 51 ( 31 unt; 9 typ; 0 def)
% Number of atoms : 53 ( 42 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 29 ( 18 ~; 7 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 8 sgn; 26 !; 4 ?; 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 ).
tff(decl_28,type,
esk4_0: $i ).
tff(decl_29,type,
epred1_0: $o ).
tff(decl_30,type,
epred2_0: $o ).
fof(f01,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f05,axiom,
! [X1] : mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f04,axiom,
! [X1] : mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
fof(goals,conjecture,
( ! [X4,X5] :
? [X6] : mult(X4,X6) = X5
& ! [X7,X8] :
? [X9] : mult(X9,X8) = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X10] : mult(X10,unit) = X10,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_7,plain,
! [X12,X13,X14] : mult(X14,mult(X13,mult(X13,X12))) = mult(mult(mult(X14,X13),X13),X12),
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_8,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_11,plain,
! [X16] : mult(i(X16),X16) = unit,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_12,plain,
! [X11] : mult(unit,X11) = X11,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_13,plain,
! [X15] : mult(X15,i(X15)) = unit,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_14,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
mult(i(X1),X1) = unit,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
mult(X1,i(X1)) = unit,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_16]) ).
cnf(c_0_20,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
i(mult(X1,X1)) = mult(i(X1),i(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_8]) ).
cnf(c_0_22,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_16]) ).
cnf(c_0_23,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
fof(c_0_24,negated_conjecture,
~ ( ! [X4,X5] :
? [X6] : mult(X4,X6) = X5
& ! [X7,X8] :
? [X9] : mult(X9,X8) = X7 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_25,plain,
( ~ epred2_0
<=> ! [X1] : mult(esk1_0,X1) != esk2_0 ),
introduced(definition) ).
cnf(c_0_26,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_15]),c_0_8]) ).
fof(c_0_28,negated_conjecture,
! [X19,X22] :
( mult(esk1_0,X19) != esk2_0
| mult(X22,esk4_0) != esk3_0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
cnf(c_0_29,negated_conjecture,
( epred2_0
| mult(esk1_0,X1) != esk2_0 ),
inference(split_equiv,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
( ~ epred1_0
<=> ! [X2] : mult(X2,esk4_0) != esk3_0 ),
introduced(definition) ).
cnf(c_0_32,negated_conjecture,
( mult(esk1_0,X1) != esk2_0
| mult(X2,esk4_0) != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( epred2_0
| X1 != esk2_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( epred1_0
| mult(X1,esk4_0) != esk3_0 ),
inference(split_equiv,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_32,c_0_31]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
epred2_0,
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( epred1_0
| mult(X1,mult(esk4_0,esk4_0)) != esk3_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_38,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
mult(X1,mult(X2,mult(X2,mult(esk4_0,esk4_0)))) != esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
X1 != esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_15]),c_0_8]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Aug 28 22:40:43 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.55/0.55 start to proof: theBenchmark
% 0.55/0.57 % Version : CSE_E---1.5
% 0.55/0.57 % Problem : theBenchmark.p
% 0.55/0.57 % Proof found
% 0.55/0.57 % SZS status Theorem for theBenchmark.p
% 0.55/0.57 % SZS output start Proof
% See solution above
% 0.55/0.58 % Total time : 0.014000 s
% 0.55/0.58 % SZS output end Proof
% 0.55/0.58 % Total time : 0.016000 s
%------------------------------------------------------------------------------