TSTP Solution File: SEU248+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU248+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:04 EDT 2022
% Result : Theorem 7.65s 2.45s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 24 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_338,negated_conjecture,
~ subset(relation_dom(relation_rng_restriction(esk78_0,esk79_0)),relation_dom(esk79_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q4as9jeu/lgb.p',i_0_338) ).
cnf(i_0_479,lemma,
( subset(relation_dom(X1),relation_dom(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q4as9jeu/lgb.p',i_0_479) ).
cnf(i_0_339,negated_conjecture,
relation(esk79_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q4as9jeu/lgb.p',i_0_339) ).
cnf(i_0_426,lemma,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q4as9jeu/lgb.p',i_0_426) ).
cnf(i_0_267,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q4as9jeu/lgb.p',i_0_267) ).
cnf(c_0_485,negated_conjecture,
~ subset(relation_dom(relation_rng_restriction(esk78_0,esk79_0)),relation_dom(esk79_0)),
i_0_338 ).
cnf(c_0_486,lemma,
( subset(relation_dom(X1),relation_dom(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
i_0_479 ).
cnf(c_0_487,negated_conjecture,
relation(esk79_0),
i_0_339 ).
cnf(c_0_488,negated_conjecture,
( ~ relation(relation_rng_restriction(esk78_0,esk79_0))
| ~ subset(relation_rng_restriction(esk78_0,esk79_0),esk79_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_485,c_0_486]),c_0_487])]) ).
cnf(c_0_489,lemma,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
i_0_426 ).
cnf(c_0_490,lemma,
~ relation(relation_rng_restriction(esk78_0,esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_488,c_0_489]),c_0_487])]) ).
cnf(c_0_491,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_267 ).
cnf(c_0_492,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_490,c_0_491]),c_0_487])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU248+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 18:56:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.65/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.65/2.45 # No SInE strategy applied
% 7.65/2.45 # Trying AutoSched0 for 150 seconds
% 7.65/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.65/2.45 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.65/2.45 #
% 7.65/2.45 # Preprocessing time : 0.030 s
% 7.65/2.45 # Presaturation interreduction done
% 7.65/2.45
% 7.65/2.45 # Proof found!
% 7.65/2.45 # SZS status Theorem
% 7.65/2.45 # SZS output start CNFRefutation
% See solution above
% 7.65/2.45 # Training examples: 0 positive, 0 negative
% 7.65/2.45
% 7.65/2.45 # -------------------------------------------------
% 7.65/2.45 # User time : 0.038 s
% 7.65/2.45 # System time : 0.005 s
% 7.65/2.45 # Total time : 0.043 s
% 7.65/2.45 # Maximum resident set size: 7124 pages
% 7.65/2.45
%------------------------------------------------------------------------------