TSTP Solution File: SEU264+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU264+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 08:40:13 EDT 2022
% Result : Theorem 7.64s 2.54s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 9 unt; 0 nHn; 17 RR)
% Number of literals : 29 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 23 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_497,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_497) ).
cnf(i_0_482,negated_conjecture,
subset(esk108_0,esk109_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_482) ).
cnf(i_0_456,lemma,
( subset(relation_rng(X1),X2)
| ~ relation_of2_as_subset(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_456) ).
cnf(i_0_483,negated_conjecture,
relation_of2_as_subset(esk111_0,esk110_0,esk108_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_483) ).
cnf(i_0_474,lemma,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X4)
| ~ subset(relation_rng(X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_474) ).
cnf(i_0_481,negated_conjecture,
~ relation_of2_as_subset(esk111_0,esk110_0,esk109_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfrox549/lgb.p',i_0_481) ).
cnf(c_0_504,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_497 ).
cnf(c_0_505,negated_conjecture,
subset(esk108_0,esk109_0),
i_0_482 ).
cnf(c_0_506,lemma,
( subset(relation_rng(X1),X2)
| ~ relation_of2_as_subset(X1,X3,X2) ),
i_0_456 ).
cnf(c_0_507,negated_conjecture,
relation_of2_as_subset(esk111_0,esk110_0,esk108_0),
i_0_483 ).
cnf(c_0_508,negated_conjecture,
( subset(X1,esk109_0)
| ~ subset(X1,esk108_0) ),
inference(spm,[status(thm)],[c_0_504,c_0_505]) ).
cnf(c_0_509,negated_conjecture,
subset(relation_rng(esk111_0),esk108_0),
inference(spm,[status(thm)],[c_0_506,c_0_507]) ).
cnf(c_0_510,lemma,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X4)
| ~ subset(relation_rng(X1),X3) ),
i_0_474 ).
cnf(c_0_511,negated_conjecture,
subset(relation_rng(esk111_0),esk109_0),
inference(spm,[status(thm)],[c_0_508,c_0_509]) ).
cnf(c_0_512,negated_conjecture,
( relation_of2_as_subset(esk111_0,X1,esk109_0)
| ~ relation_of2_as_subset(esk111_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_510,c_0_511]) ).
cnf(c_0_513,negated_conjecture,
~ relation_of2_as_subset(esk111_0,esk110_0,esk109_0),
i_0_481 ).
cnf(c_0_514,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_512,c_0_507]),c_0_513]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU264+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 13:23:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.64/2.54 # No SInE strategy applied
% 7.64/2.54 # Trying AutoSched0 for 150 seconds
% 7.64/2.54 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 7.64/2.54 # and selection function SelectAntiRROptimalLit.
% 7.64/2.54 #
% 7.64/2.54 # Preprocessing time : 0.023 s
% 7.64/2.54 # Presaturation interreduction done
% 7.64/2.54
% 7.64/2.54 # Proof found!
% 7.64/2.54 # SZS status Theorem
% 7.64/2.54 # SZS output start CNFRefutation
% See solution above
% 7.64/2.54 # Training examples: 0 positive, 0 negative
% 7.64/2.54
% 7.64/2.54 # -------------------------------------------------
% 7.64/2.54 # User time : 0.038 s
% 7.64/2.54 # System time : 0.007 s
% 7.64/2.54 # Total time : 0.045 s
% 7.64/2.54 # Maximum resident set size: 7124 pages
% 7.64/2.54
%------------------------------------------------------------------------------