TSTP Solution File: SET793+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Tue Jul 19 00:14:13 EDT 2022
% Result : Theorem 7.89s 2.31s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 12 unt; 8 nHn; 30 RR)
% Number of literals : 80 ( 4 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( member(X1,X2)
| ~ max(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_28) ).
cnf(i_0_37,negated_conjecture,
max(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_37) ).
cnf(i_0_43,plain,
( apply(X1,X2,X3)
| apply(X1,X3,X2)
| ~ member(X2,X4)
| ~ member(X3,X4)
| ~ total_order(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_43) ).
cnf(i_0_2,plain,
( greatest(X1,X2,X3)
| member(esk1_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_2) ).
cnf(i_0_38,negated_conjecture,
total_order(esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_38) ).
cnf(i_0_1,plain,
( greatest(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,esk1_3(X2,X3,X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_1) ).
cnf(i_0_36,negated_conjecture,
~ greatest(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_36) ).
cnf(i_0_35,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_35) ).
cnf(i_0_44,plain,
( order(X1,X2)
| ~ total_order(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_44) ).
cnf(i_0_27,plain,
( X1 = X2
| ~ member(X1,X3)
| ~ apply(X4,X2,X1)
| ~ max(X2,X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_27) ).
cnf(i_0_110,plain,
( apply(X1,X2,X2)
| ~ member(X2,X3)
| ~ epred1_2(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n0ugukr7/lgb.p',i_0_110) ).
cnf(c_0_122,plain,
( member(X1,X2)
| ~ max(X1,X3,X2) ),
i_0_28 ).
cnf(c_0_123,negated_conjecture,
max(esk10_0,esk8_0,esk9_0),
i_0_37 ).
cnf(c_0_124,plain,
( apply(X1,X2,X3)
| apply(X1,X3,X2)
| ~ member(X2,X4)
| ~ member(X3,X4)
| ~ total_order(X1,X4) ),
i_0_43 ).
cnf(c_0_125,negated_conjecture,
member(esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_126,plain,
( greatest(X1,X2,X3)
| member(esk1_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
i_0_2 ).
cnf(c_0_127,negated_conjecture,
( apply(X1,X2,esk10_0)
| apply(X1,esk10_0,X2)
| ~ member(X2,esk9_0)
| ~ total_order(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,negated_conjecture,
( member(esk1_3(X1,esk9_0,esk10_0),esk9_0)
| greatest(esk10_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_126,c_0_125]) ).
cnf(c_0_129,negated_conjecture,
( apply(X1,esk10_0,esk1_3(X2,esk9_0,esk10_0))
| apply(X1,esk1_3(X2,esk9_0,esk10_0),esk10_0)
| greatest(esk10_0,X2,esk9_0)
| ~ total_order(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_130,negated_conjecture,
total_order(esk8_0,esk9_0),
i_0_38 ).
cnf(c_0_131,plain,
( greatest(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,esk1_3(X2,X3,X1),X1) ),
i_0_1 ).
cnf(c_0_132,negated_conjecture,
( apply(esk8_0,esk1_3(X1,esk9_0,esk10_0),esk10_0)
| apply(esk8_0,esk10_0,esk1_3(X1,esk9_0,esk10_0))
| greatest(esk10_0,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_133,negated_conjecture,
~ greatest(esk10_0,esk8_0,esk9_0),
i_0_36 ).
cnf(c_0_134,plain,
( epred1_2(X1,X2)
| ~ order(X1,X2) ),
i_0_35 ).
cnf(c_0_135,plain,
( order(X1,X2)
| ~ total_order(X1,X2) ),
i_0_44 ).
cnf(c_0_136,plain,
( X1 = X2
| ~ member(X1,X3)
| ~ apply(X4,X2,X1)
| ~ max(X2,X4,X3) ),
i_0_27 ).
cnf(c_0_137,plain,
apply(esk8_0,esk10_0,esk1_3(esk8_0,esk9_0,esk10_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_125])]),c_0_133]) ).
cnf(c_0_138,plain,
( apply(X1,X2,X2)
| ~ member(X2,X3)
| ~ epred1_2(X1,X3) ),
i_0_110 ).
cnf(c_0_139,plain,
( epred1_2(X1,X2)
| ~ total_order(X1,X2) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_140,plain,
( esk1_3(esk8_0,esk9_0,esk10_0) = esk10_0
| ~ member(esk1_3(esk8_0,esk9_0,esk10_0),X1)
| ~ max(esk10_0,esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,negated_conjecture,
( apply(X1,esk10_0,esk10_0)
| ~ epred1_2(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_138,c_0_125]) ).
cnf(c_0_142,negated_conjecture,
epred1_2(esk8_0,esk9_0),
inference(spm,[status(thm)],[c_0_139,c_0_130]) ).
cnf(c_0_143,negated_conjecture,
esk1_3(esk8_0,esk9_0,esk10_0) = esk10_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_128]),c_0_123])]),c_0_133]) ).
cnf(c_0_144,negated_conjecture,
apply(esk8_0,esk10_0,esk10_0),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_143]),c_0_125]),c_0_144])]),c_0_133]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n007.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jul 10 01:53:33 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.89/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.89/2.31 # No SInE strategy applied
% 7.89/2.31 # Trying AutoSched0 for 150 seconds
% 7.89/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.89/2.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.89/2.31 #
% 7.89/2.31 # Preprocessing time : 0.012 s
% 7.89/2.31 # Presaturation interreduction done
% 7.89/2.31
% 7.89/2.31 # Proof found!
% 7.89/2.31 # SZS status Theorem
% 7.89/2.31 # SZS output start CNFRefutation
% See solution above
% 7.89/2.31 # Training examples: 0 positive, 0 negative
% 7.89/2.31
% 7.89/2.31 # -------------------------------------------------
% 7.89/2.31 # User time : 0.016 s
% 7.89/2.31 # System time : 0.004 s
% 7.89/2.31 # Total time : 0.020 s
% 7.89/2.31 # Maximum resident set size: 7128 pages
% 7.89/2.31
%------------------------------------------------------------------------------