TSTP Solution File: SYN074+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN074+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 21 04:49:34 EDT 2022
% Result : Theorem 8.00s 2.37s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 4 unt; 8 nHn; 14 RR)
% Number of literals : 45 ( 30 equ; 19 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( esk3_1(X1) = X1
| big_f(esk3_1(X1),X2)
| X2 != esk5_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( X1 = esk1_0
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
( X1 = esk2_0
| ~ big_f(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
( esk4_2(X1,X2) = X2
| big_f(esk3_1(X1),esk4_2(X1,X2))
| esk3_1(X1) != X1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
( big_f(X1,X2)
| X2 != esk2_0
| X1 != esk1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
( esk3_1(X1) != X1
| esk4_2(X1,X2) != X2
| ~ big_f(esk3_1(X1),esk4_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uvbu5i_5/lgb.p',i_0_7) ).
cnf(c_0_14,negated_conjecture,
( esk3_1(X1) = X1
| big_f(esk3_1(X1),X2)
| X2 != esk5_1(X1) ),
i_0_4 ).
cnf(c_0_15,plain,
( X1 = esk1_0
| ~ big_f(X1,X2) ),
i_0_3 ).
cnf(c_0_16,negated_conjecture,
( esk3_1(X1) = X1
| big_f(esk3_1(X1),esk5_1(X1)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( X1 = esk2_0
| ~ big_f(X2,X1) ),
i_0_2 ).
cnf(c_0_18,negated_conjecture,
( esk4_2(X1,X2) = X2
| big_f(esk3_1(X1),esk4_2(X1,X2))
| esk3_1(X1) != X1 ),
i_0_6 ).
cnf(c_0_19,plain,
( esk3_1(X1) = esk1_0
| esk3_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( esk4_2(X1,X2) = esk2_0
| esk4_2(X1,X2) = X2
| esk3_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
esk3_1(esk1_0) = esk1_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_19])]) ).
cnf(c_0_22,plain,
( esk4_2(esk1_0,X1) = esk2_0
| esk4_2(esk1_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( big_f(X1,X2)
| X2 != esk2_0
| X1 != esk1_0 ),
i_0_1 ).
cnf(c_0_24,negated_conjecture,
( esk3_1(X1) != X1
| esk4_2(X1,X2) != X2
| ~ big_f(esk3_1(X1),esk4_2(X1,X2)) ),
i_0_7 ).
cnf(c_0_25,plain,
esk4_2(esk1_0,esk2_0) = esk2_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_22])]) ).
cnf(c_0_26,plain,
big_f(esk1_0,esk2_0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_21]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN074+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 19:13:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.00/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.00/2.37 # No SInE strategy applied
% 8.00/2.37 # Trying AutoSched0 for 150 seconds
% 8.00/2.37 # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.00/2.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.00/2.37 #
% 8.00/2.37 # Preprocessing time : 0.012 s
% 8.00/2.37
% 8.00/2.37 # Proof found!
% 8.00/2.37 # SZS status Theorem
% 8.00/2.37 # SZS output start CNFRefutation
% See solution above
% 8.00/2.37 # Training examples: 0 positive, 0 negative
% 8.00/2.37
% 8.00/2.37 # -------------------------------------------------
% 8.00/2.37 # User time : 0.014 s
% 8.00/2.37 # System time : 0.002 s
% 8.00/2.37 # Total time : 0.016 s
% 8.00/2.37 # Maximum resident set size: 7128 pages
% 8.00/2.37
%------------------------------------------------------------------------------