TSTP Solution File: SEU124+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU124+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:38:37 EDT 2022
% Result : Theorem 8.70s 2.49s
% Output : CNFRefutation 8.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 5 unt; 2 nHn; 8 RR)
% Number of literals : 21 ( 2 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tisx7qdx/lgb.p',i_0_13) ).
cnf(i_0_49,negated_conjecture,
~ subset(esk9_0,set_union2(esk9_0,esk10_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tisx7qdx/lgb.p',i_0_49) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tisx7qdx/lgb.p',i_0_16) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tisx7qdx/lgb.p',i_0_15) ).
cnf(c_0_54,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_55,negated_conjecture,
~ subset(esk9_0,set_union2(esk9_0,esk10_0)),
i_0_49 ).
cnf(c_0_56,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_57,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_58,negated_conjecture,
in(esk3_2(esk9_0,set_union2(esk9_0,esk10_0)),esk9_0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_60,negated_conjecture,
in(esk3_2(esk9_0,set_union2(esk9_0,esk10_0)),set_union2(esk9_0,X1)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 09:59:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.70/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.70/2.49 # No SInE strategy applied
% 8.70/2.49 # Trying AutoSched0 for 150 seconds
% 8.70/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.70/2.49 # and selection function SelectLargestNegLit.
% 8.70/2.49 #
% 8.70/2.49 # Preprocessing time : 0.023 s
% 8.70/2.49 # Presaturation interreduction done
% 8.70/2.49
% 8.70/2.49 # Proof found!
% 8.70/2.49 # SZS status Theorem
% 8.70/2.49 # SZS output start CNFRefutation
% See solution above
% 8.70/2.49 # Training examples: 0 positive, 0 negative
% 8.70/2.49
% 8.70/2.49 # -------------------------------------------------
% 8.70/2.49 # User time : 0.033 s
% 8.70/2.49 # System time : 0.008 s
% 8.70/2.49 # Total time : 0.041 s
% 8.70/2.49 # Maximum resident set size: 7124 pages
% 8.70/2.49
%------------------------------------------------------------------------------