%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET911+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:15:11 EDT 2022
% Result : Theorem 7.64s 2.32s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
set_intersection2(esk4_0,singleton(esk3_0)) != singleton(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztu42foj/input.p',i_0_6) ).
cnf(i_0_8,plain,
( set_intersection2(X1,singleton(X2)) = singleton(X2)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztu42foj/input.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
in(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ztu42foj/input.p',i_0_7) ).
cnf(c_0_12,negated_conjecture,
set_intersection2(esk4_0,singleton(esk3_0)) != singleton(esk3_0),
i_0_6 ).
cnf(c_0_13,plain,
( set_intersection2(X1,singleton(X2)) = singleton(X2)
| ~ in(X2,X1) ),
i_0_8 ).
cnf(c_0_14,negated_conjecture,
in(esk3_0,esk4_0),
i_0_7 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET911+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 Jul 11 01:12:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.64/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.64/2.32 # No SInE strategy applied
% 7.64/2.32 # Trying AutoSched0 for 150 seconds
% 7.64/2.32 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.64/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.64/2.32 #
% 7.64/2.32 # Preprocessing time : 0.023 s
% 7.64/2.32
% 7.64/2.32 # Proof found!
% 7.64/2.32 # SZS status Theorem
% 7.64/2.32 # SZS output start CNFRefutation
% See solution above
% 7.64/2.32 # Training examples: 0 positive, 0 negative
% 7.64/2.32
% 7.64/2.32 # -------------------------------------------------
% 7.64/2.32 # User time : 0.024 s
% 7.64/2.32 # System time : 0.007 s
% 7.64/2.32 # Total time : 0.031 s
% 7.64/2.32 # Maximum resident set size: 7120 pages
% 7.64/2.32
%------------------------------------------------------------------------------