TSTP Solution File: SET027+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET027+3 : TPTP v8.1.0. Released v2.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:08:21 EDT 2022
% Result : Theorem 7.76s 2.43s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 7 unt; 4 nHn; 13 RR)
% Number of literals : 29 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_3) ).
cnf(i_0_7,negated_conjecture,
subset(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_6) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_2) ).
cnf(i_0_1,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
~ subset(esk2_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r90vgdxv/input.p',i_0_5) ).
cnf(c_0_14,plain,
( member(X1,X2)
| ~ subset(X3,X2)
| ~ member(X1,X3) ),
i_0_3 ).
cnf(c_0_15,negated_conjecture,
subset(esk2_0,esk3_0),
i_0_7 ).
cnf(c_0_16,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_6 ).
cnf(c_0_17,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_2 ).
cnf(c_0_19,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,plain,
( member(esk1_2(esk2_0,X1),esk3_0)
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_1 ).
cnf(c_0_22,negated_conjecture,
( member(esk1_2(esk2_0,X1),esk4_0)
| subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ subset(esk2_0,esk4_0),
i_0_5 ).
cnf(c_0_24,plain,
$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.12 % Problem : SET027+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Sun Jul 10 04:56:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.76/2.43 # ENIGMATIC: Solved by autoschedule:
% 7.76/2.43 # No SInE strategy applied
% 7.76/2.43 # Trying AutoSched0 for 150 seconds
% 7.76/2.43 # AutoSched0-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 7.76/2.43 # and selection function SelectNewComplexAHPNS.
% 7.76/2.43 #
% 7.76/2.43 # Preprocessing time : 0.022 s
% 7.76/2.43 # Presaturation interreduction done
% 7.76/2.43
% 7.76/2.43 # Proof found!
% 7.76/2.43 # SZS status Theorem
% 7.76/2.43 # SZS output start CNFRefutation
% See solution above
% 7.76/2.43 # Training examples: 0 positive, 0 negative
% 7.76/2.43
% 7.76/2.43 # -------------------------------------------------
% 7.76/2.43 # User time : 0.023 s
% 7.76/2.43 # System time : 0.006 s
% 7.76/2.43 # Total time : 0.029 s
% 7.76/2.43 # Maximum resident set size: 7120 pages
% 7.76/2.43
%------------------------------------------------------------------------------