%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET196+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 00:10:20 EDT 2022
% Result : Theorem 7.82s 2.49s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 5 unt; 2 nHn; 9 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 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 : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,negated_conjecture,
~ subset(intersection(esk3_0,esk4_0),esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ejy06q02/lgb.p',i_0_13) ).
cnf(i_0_5,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ejy06q02/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ejy06q02/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ejy06q02/lgb.p',i_0_3) ).
cnf(c_0_18,negated_conjecture,
~ subset(intersection(esk3_0,esk4_0),esk3_0),
i_0_13 ).
cnf(c_0_19,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_5 ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_4 ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_3 ).
cnf(c_0_22,negated_conjecture,
member(esk1_2(intersection(esk3_0,esk4_0),esk3_0),intersection(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ member(esk1_2(intersection(esk3_0,esk4_0),esk3_0),esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET196+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 05:06:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 7.82/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.49 # No SInE strategy applied
% 7.82/2.49 # Trying AutoSched0 for 150 seconds
% 7.82/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 7.82/2.49 # and selection function MSelectComplexExceptUniqMaxHorn.
% 7.82/2.49 #
% 7.82/2.49 # Preprocessing time : 0.023 s
% 7.82/2.49 # Presaturation interreduction done
% 7.82/2.49
% 7.82/2.49 # Proof found!
% 7.82/2.49 # SZS status Theorem
% 7.82/2.49 # SZS output start CNFRefutation
% See solution above
% 7.82/2.49 # Training examples: 0 positive, 0 negative
% 7.82/2.49
% 7.82/2.49 # -------------------------------------------------
% 7.82/2.49 # User time : 0.026 s
% 7.82/2.49 # System time : 0.003 s
% 7.82/2.49 # Total time : 0.029 s
% 7.82/2.49 # Maximum resident set size: 7124 pages
% 7.82/2.49
%------------------------------------------------------------------------------