%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:39:25 EDT 2022
% Result : Theorem 4.47s 2.25s
% Output : CNFRefutation 4.47s
% 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_324,negated_conjecture,
~ subset(relation_rng(relation_dom_restriction(esk59_0,esk58_0)),relation_rng(esk59_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ornvf_2f/lgb.p',i_0_324) ).
cnf(i_0_236,lemma,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ornvf_2f/lgb.p',i_0_236) ).
cnf(i_0_325,negated_conjecture,
relation(esk59_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ornvf_2f/lgb.p',i_0_325) ).
cnf(i_0_317,lemma,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ornvf_2f/lgb.p',i_0_317) ).
cnf(i_0_149,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ornvf_2f/lgb.p',i_0_149) ).
cnf(c_0_331,negated_conjecture,
~ subset(relation_rng(relation_dom_restriction(esk59_0,esk58_0)),relation_rng(esk59_0)),
i_0_324 ).
cnf(c_0_332,lemma,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
i_0_236 ).
cnf(c_0_333,negated_conjecture,
relation(esk59_0),
i_0_325 ).
cnf(c_0_334,negated_conjecture,
( ~ relation(relation_dom_restriction(esk59_0,esk58_0))
| ~ subset(relation_dom_restriction(esk59_0,esk58_0),esk59_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_331,c_0_332]),c_0_333])]) ).
cnf(c_0_335,lemma,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1) ),
i_0_317 ).
cnf(c_0_336,lemma,
~ relation(relation_dom_restriction(esk59_0,esk58_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_334,c_0_335]),c_0_333])]) ).
cnf(c_0_337,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_149 ).
cnf(c_0_338,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_336,c_0_337]),c_0_333])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 09:05:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.47/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.47/2.25 # No SInE strategy applied
% 4.47/2.25 # Trying AutoSched0 for 150 seconds
% 4.47/2.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.47/2.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.47/2.25 #
% 4.47/2.25 # Preprocessing time : 0.027 s
% 4.47/2.25 # Presaturation interreduction done
% 4.47/2.25
% 4.47/2.25 # Proof found!
% 4.47/2.25 # SZS status Theorem
% 4.47/2.25 # SZS output start CNFRefutation
% See solution above
% 4.47/2.25 # Training examples: 0 positive, 0 negative
% 4.47/2.25
% 4.47/2.25 # -------------------------------------------------
% 4.47/2.25 # User time : 0.032 s
% 4.47/2.25 # System time : 0.006 s
% 4.47/2.25 # Total time : 0.037 s
% 4.47/2.25 # Maximum resident set size: 7120 pages
% 4.47/2.25
%------------------------------------------------------------------------------