TSTP Solution File: SET766+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:13:57 EDT 2022
% Result : Theorem 7.69s 2.39s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 8 unt; 0 nHn; 16 RR)
% Number of literals : 29 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_129,plain,
( apply(X1,X2,X2)
| ~ member(X2,X3)
| ~ epred1_2(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_129) ).
cnf(i_0_12,plain,
( epred1_2(X1,X2)
| ~ equivalence(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_12) ).
cnf(i_0_70,negated_conjecture,
~ member(esk17_0,equivalence_class(esk17_0,esk15_0,esk16_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_70) ).
cnf(i_0_13,plain,
( member(X1,equivalence_class(X2,X3,X4))
| ~ member(X1,X3)
| ~ apply(X4,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_13) ).
cnf(i_0_71,negated_conjecture,
member(esk17_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_71) ).
cnf(i_0_72,negated_conjecture,
equivalence(esk16_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gvash9va/lgb.p',i_0_72) ).
cnf(c_0_136,plain,
( apply(X1,X2,X2)
| ~ member(X2,X3)
| ~ epred1_2(X1,X3) ),
i_0_129 ).
cnf(c_0_137,plain,
( epred1_2(X1,X2)
| ~ equivalence(X1,X2) ),
i_0_12 ).
cnf(c_0_138,negated_conjecture,
~ member(esk17_0,equivalence_class(esk17_0,esk15_0,esk16_0)),
i_0_70 ).
cnf(c_0_139,plain,
( member(X1,equivalence_class(X2,X3,X4))
| ~ member(X1,X3)
| ~ apply(X4,X2,X1) ),
i_0_13 ).
cnf(c_0_140,negated_conjecture,
member(esk17_0,esk15_0),
i_0_71 ).
cnf(c_0_141,plain,
( apply(X1,X2,X2)
| ~ equivalence(X1,X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,negated_conjecture,
equivalence(esk16_0,esk15_0),
i_0_72 ).
cnf(c_0_143,negated_conjecture,
~ apply(esk16_0,esk17_0,esk17_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]) ).
cnf(c_0_144,negated_conjecture,
( apply(esk16_0,X1,X1)
| ~ member(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_140])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET766+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.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 : Sun Jul 10 08:08:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.69/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.39 # No SInE strategy applied
% 7.69/2.39 # Trying AutoSched0 for 150 seconds
% 7.69/2.39 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 7.69/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.69/2.39 #
% 7.69/2.39 # Preprocessing time : 0.013 s
% 7.69/2.39
% 7.69/2.39 # Proof found!
% 7.69/2.39 # SZS status Theorem
% 7.69/2.39 # SZS output start CNFRefutation
% See solution above
% 7.69/2.39 # Training examples: 0 positive, 0 negative
% 7.69/2.39
% 7.69/2.39 # -------------------------------------------------
% 7.69/2.39 # User time : 0.020 s
% 7.69/2.39 # System time : 0.001 s
% 7.69/2.39 # Total time : 0.021 s
% 7.69/2.39 # Maximum resident set size: 7124 pages
% 7.69/2.39
%------------------------------------------------------------------------------