TSTP Solution File: SET910+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET910+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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.54s 2.29s
% Output : CNFRefutation 7.54s
% 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,
~ in(esk4_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-83iygxcd/lgb.p',i_0_6) ).
cnf(i_0_8,plain,
( in(X1,X2)
| set_intersection2(X2,singleton(X1)) != singleton(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-83iygxcd/lgb.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
set_intersection2(esk3_0,singleton(esk4_0)) = singleton(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-83iygxcd/lgb.p',i_0_7) ).
cnf(c_0_12,negated_conjecture,
~ in(esk4_0,esk3_0),
i_0_6 ).
cnf(c_0_13,plain,
( in(X1,X2)
| set_intersection2(X2,singleton(X1)) != singleton(X1) ),
i_0_8 ).
cnf(c_0_14,negated_conjecture,
set_intersection2(esk3_0,singleton(esk4_0)) = singleton(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.07/0.13 % Problem : SET910+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n016.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 02:24:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.54/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.29 # No SInE strategy applied
% 7.54/2.29 # Trying AutoSched0 for 150 seconds
% 7.54/2.29 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.54/2.29 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.54/2.29 #
% 7.54/2.29 # Preprocessing time : 0.017 s
% 7.54/2.29 # Presaturation interreduction done
% 7.54/2.29
% 7.54/2.29 # Proof found!
% 7.54/2.29 # SZS status Theorem
% 7.54/2.29 # SZS output start CNFRefutation
% See solution above
% 7.54/2.29 # Training examples: 0 positive, 0 negative
% 7.54/2.29
% 7.54/2.29 # -------------------------------------------------
% 7.54/2.29 # User time : 0.015 s
% 7.54/2.29 # System time : 0.008 s
% 7.54/2.29 # Total time : 0.022 s
% 7.54/2.29 # Maximum resident set size: 7120 pages
% 7.54/2.29
%------------------------------------------------------------------------------