TSTP Solution File: SEU121+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU121+2 : 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:38:35 EDT 2022
% Result : Theorem 6.87s 2.19s
% Output : CNFRefutation 6.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 2 nHn; 15 RR)
% Number of literals : 29 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_7) ).
cnf(i_0_25,negated_conjecture,
subset(esk7_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_25) ).
cnf(i_0_5,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_5) ).
cnf(i_0_26,negated_conjecture,
subset(esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_26) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_6) ).
cnf(i_0_24,negated_conjecture,
~ subset(esk6_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-clb9iujw/input.p',i_0_24) ).
cnf(c_0_33,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_7 ).
cnf(c_0_34,negated_conjecture,
subset(esk7_0,esk8_0),
i_0_25 ).
cnf(c_0_35,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
i_0_5 ).
cnf(c_0_36,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
subset(esk6_0,esk7_0),
i_0_26 ).
cnf(c_0_38,plain,
( subset(X1,esk8_0)
| ~ in(esk2_2(X1,esk8_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( in(X1,esk7_0)
| ~ in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_40,plain,
( subset(X1,esk8_0)
| ~ in(esk2_2(X1,esk8_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_6 ).
cnf(c_0_42,negated_conjecture,
~ subset(esk6_0,esk8_0),
i_0_24 ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU121+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 11:53:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 6.87/2.19 # ENIGMATIC: Solved by autoschedule:
% 6.87/2.19 # No SInE strategy applied
% 6.87/2.19 # Trying AutoSched0 for 150 seconds
% 6.87/2.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 6.87/2.19 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.87/2.19 #
% 6.87/2.19 # Preprocessing time : 0.020 s
% 6.87/2.19 # Presaturation interreduction done
% 6.87/2.19
% 6.87/2.19 # Proof found!
% 6.87/2.19 # SZS status Theorem
% 6.87/2.19 # SZS output start CNFRefutation
% See solution above
% 6.87/2.19 # Training examples: 0 positive, 0 negative
% 6.87/2.19
% 6.87/2.19 # -------------------------------------------------
% 6.87/2.19 # User time : 0.028 s
% 6.87/2.19 # System time : 0.001 s
% 6.87/2.19 # Total time : 0.029 s
% 6.87/2.19 # Maximum resident set size: 7124 pages
% 6.87/2.19
%------------------------------------------------------------------------------