TSTP Solution File: SEU121+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 8.19s 2.41s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 4 nHn; 13 RR)
% Number of literals : 33 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_4) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_3) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_2) ).
cnf(i_0_11,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
~ subset(esk4_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_10) ).
cnf(i_0_12,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfsqqpe4/input.p',i_0_12) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_4 ).
cnf(c_0_20,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_21,plain,
( in(esk1_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_23,plain,
( in(esk1_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X4,X3)
| ~ subset(X1,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_11 ).
cnf(c_0_26,negated_conjecture,
~ subset(esk4_0,esk6_0),
i_0_10 ).
cnf(c_0_27,negated_conjecture,
( subset(X1,esk6_0)
| ~ subset(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_12 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 20 06:48:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 8.19/2.41 # ENIGMATIC: Solved by autoschedule:
% 8.19/2.41 # No SInE strategy applied
% 8.19/2.41 # Trying AutoSched0 for 150 seconds
% 8.19/2.41 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S039I
% 8.19/2.41 # and selection function PSelectUnlessUniqMaxPos.
% 8.19/2.41 #
% 8.19/2.41 # Preprocessing time : 0.012 s
% 8.19/2.41 # Presaturation interreduction done
% 8.19/2.41
% 8.19/2.41 # Proof found!
% 8.19/2.41 # SZS status Theorem
% 8.19/2.41 # SZS output start CNFRefutation
% See solution above
% 8.19/2.41 # Training examples: 0 positive, 0 negative
% 8.19/2.41
% 8.19/2.41 # -------------------------------------------------
% 8.19/2.41 # User time : 0.012 s
% 8.19/2.41 # System time : 0.006 s
% 8.19/2.41 # Total time : 0.018 s
% 8.19/2.41 # Maximum resident set size: 7120 pages
% 8.19/2.41
%------------------------------------------------------------------------------