TSTP Solution File: ALG210+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG210+2 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : 600s
% DateTime : Thu Jul 14 15:33:00 EDT 2022
% Result : Theorem 7.53s 2.35s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 17 unt; 0 nHn; 21 RR)
% Number of literals : 37 ( 21 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_1) ).
cnf(i_0_6,negated_conjecture,
times(esk2_0,esk3_0) = esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_6) ).
cnf(i_0_4,plain,
( times(X1,esk1_1(X1)) = X1
| ~ element(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( times(X1,X1) = esk1_1(X1)
| ~ element(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_3) ).
cnf(i_0_7,negated_conjecture,
element(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_7) ).
cnf(i_0_2,plain,
( element(X1)
| times(X1,X2) != X1
| times(X1,X1) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
~ element(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_5) ).
cnf(i_0_8,negated_conjecture,
element(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0f7d9_70/lgb.p',i_0_8) ).
cnf(c_0_17,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
i_0_1 ).
cnf(c_0_18,negated_conjecture,
times(esk2_0,esk3_0) = esk4_0,
i_0_6 ).
cnf(c_0_19,negated_conjecture,
times(esk3_0,times(X1,esk2_0)) = times(esk4_0,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( times(X1,esk1_1(X1)) = X1
| ~ element(X1) ),
i_0_4 ).
cnf(c_0_21,plain,
( times(X1,X1) = esk1_1(X1)
| ~ element(X1) ),
i_0_3 ).
cnf(c_0_22,plain,
times(esk2_0,times(esk3_0,times(X1,X2))) = times(X1,times(X2,esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_23,plain,
( times(X1,times(X1,X1)) = X1
| ~ element(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
element(esk3_0),
i_0_7 ).
cnf(c_0_25,plain,
times(esk3_0,times(esk3_0,esk4_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_24])]) ).
cnf(c_0_26,plain,
( element(X1)
| times(X1,X2) != X1
| times(X1,X1) != X2 ),
i_0_2 ).
cnf(c_0_27,plain,
times(esk3_0,times(esk4_0,esk4_0)) = times(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_28,plain,
( element(X1)
| times(X1,times(X1,X1)) != X1 ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,plain,
times(esk4_0,times(esk4_0,esk4_0)) = times(esk2_0,times(esk2_0,esk4_0)),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ element(esk4_0),
i_0_5 ).
cnf(c_0_31,plain,
( times(X1,times(X1,times(X1,X2))) = times(X1,X2)
| ~ element(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_17]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
element(esk2_0),
i_0_8 ).
cnf(c_0_33,plain,
times(esk2_0,times(esk2_0,esk4_0)) != esk4_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_18]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG210+2 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : 600
% 0.12/0.33 % DateTime : Wed Jun 8 22:24:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.53/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.53/2.35 # No SInE strategy applied
% 7.53/2.35 # Trying AutoSched0 for 150 seconds
% 7.53/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.53/2.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.53/2.35 #
% 7.53/2.35 # Preprocessing time : 0.012 s
% 7.53/2.35 # Presaturation interreduction done
% 7.53/2.35
% 7.53/2.35 # Proof found!
% 7.53/2.35 # SZS status Theorem
% 7.53/2.35 # SZS output start CNFRefutation
% See solution above
% 7.53/2.35 # Training examples: 0 positive, 0 negative
% 7.53/2.35
% 7.53/2.35 # -------------------------------------------------
% 7.53/2.35 # User time : 0.027 s
% 7.53/2.35 # System time : 0.004 s
% 7.53/2.35 # Total time : 0.031 s
% 7.53/2.35 # Maximum resident set size: 7128 pages
% 7.53/2.35
%------------------------------------------------------------------------------