TSTP Solution File: SEU200+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU200+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:27 EDT 2022
% Result : Theorem 4.42s 2.15s
% Output : CNFRefutation 4.42s
% 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_32,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6iswk8yg/lgb.p',i_0_32) ).
cnf(i_0_35,plain,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6iswk8yg/lgb.p',i_0_35) ).
cnf(i_0_33,negated_conjecture,
relation(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6iswk8yg/lgb.p',i_0_33) ).
cnf(i_0_31,plain,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6iswk8yg/lgb.p',i_0_31) ).
cnf(i_0_7,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6iswk8yg/lgb.p',i_0_7) ).
cnf(c_0_41,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(esk8_0,esk9_0)),relation_rng(esk9_0)),
i_0_32 ).
cnf(c_0_42,plain,
( subset(relation_rng(X1),relation_rng(X2))
| ~ relation(X2)
| ~ relation(X1)
| ~ subset(X1,X2) ),
i_0_35 ).
cnf(c_0_43,negated_conjecture,
relation(esk9_0),
i_0_33 ).
cnf(c_0_44,negated_conjecture,
( ~ relation(relation_rng_restriction(esk8_0,esk9_0))
| ~ subset(relation_rng_restriction(esk8_0,esk9_0),esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_45,plain,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
i_0_31 ).
cnf(c_0_46,plain,
~ relation(relation_rng_restriction(esk8_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_43])]) ).
cnf(c_0_47,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_7 ).
cnf(c_0_48,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU200+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Mon Jun 20 13:42:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.42/2.15 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.42/2.15 # No SInE strategy applied
% 4.42/2.15 # Trying AutoSched0 for 150 seconds
% 4.42/2.15 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05CN
% 4.42/2.15 # and selection function PSelectUnlessUniqMaxSmallestOrientable.
% 4.42/2.15 #
% 4.42/2.15 # Preprocessing time : 0.023 s
% 4.42/2.15 # Presaturation interreduction done
% 4.42/2.15
% 4.42/2.15 # Proof found!
% 4.42/2.15 # SZS status Theorem
% 4.42/2.15 # SZS output start CNFRefutation
% See solution above
% 4.42/2.15 # Training examples: 0 positive, 0 negative
% 4.42/2.15
% 4.42/2.15 # -------------------------------------------------
% 4.42/2.15 # User time : 0.024 s
% 4.42/2.15 # System time : 0.004 s
% 4.42/2.15 # Total time : 0.028 s
% 4.42/2.15 # Maximum resident set size: 7124 pages
% 4.42/2.15
%------------------------------------------------------------------------------