TSTP Solution File: SET923+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET923+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:16 EDT 2022
% Result : Theorem 7.93s 2.40s
% Output : CNFRefutation 7.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 12 RR)
% Number of literals : 18 ( 12 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-00zywd_w/lgb.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
set_difference(esk3_0,singleton(esk4_0)) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-00zywd_w/lgb.p',i_0_12) ).
cnf(i_0_4,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-00zywd_w/lgb.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
singleton(esk4_0) != esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-00zywd_w/lgb.p',i_0_10) ).
cnf(i_0_11,negated_conjecture,
empty_set != esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-00zywd_w/lgb.p',i_0_11) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
i_0_9 ).
cnf(c_0_19,negated_conjecture,
set_difference(esk3_0,singleton(esk4_0)) = empty_set,
i_0_12 ).
cnf(c_0_20,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
i_0_4 ).
cnf(c_0_21,negated_conjecture,
subset(esk3_0,singleton(esk4_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
singleton(esk4_0) != esk3_0,
i_0_10 ).
cnf(c_0_23,negated_conjecture,
empty_set != esk3_0,
i_0_11 ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET923+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 09:31:43 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 7.93/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.93/2.40 # No SInE strategy applied
% 7.93/2.40 # Trying AutoSched0 for 150 seconds
% 7.93/2.40 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.93/2.40 # and selection function SelectNewComplexAHP.
% 7.93/2.40 #
% 7.93/2.40 # Preprocessing time : 0.023 s
% 7.93/2.40
% 7.93/2.40 # Proof found!
% 7.93/2.40 # SZS status Theorem
% 7.93/2.40 # SZS output start CNFRefutation
% See solution above
% 7.93/2.40 # Training examples: 0 positive, 0 negative
% 7.93/2.40
% 7.93/2.40 # -------------------------------------------------
% 7.93/2.40 # User time : 0.022 s
% 7.93/2.40 # System time : 0.008 s
% 7.93/2.40 # Total time : 0.029 s
% 7.93/2.40 # Maximum resident set size: 7124 pages
% 7.93/2.40
%------------------------------------------------------------------------------