TSTP Solution File: SET590+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET590+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:12:29 EDT 2022
% Result : Theorem 7.76s 2.39s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 4 unt; 3 nHn; 7 RR)
% Number of literals : 18 ( 0 equ; 6 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 : 19 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_qjb8rxv/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_qjb8rxv/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_qjb8rxv/lgb.p',i_0_4) ).
cnf(i_0_8,negated_conjecture,
~ subset(difference(esk2_0,esk3_0),esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_qjb8rxv/lgb.p',i_0_8) ).
cnf(c_0_13,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_3 ).
cnf(c_0_14,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_5 ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_4 ).
cnf(c_0_16,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ subset(difference(esk2_0,esk3_0),esk2_0),
i_0_8 ).
cnf(c_0_18,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET590+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 : n020.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 : Sat Jul 9 23:12:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.76/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.39 # No SInE strategy applied
% 7.76/2.39 # Trying AutoSched0 for 150 seconds
% 7.76/2.39 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.76/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.39 #
% 7.76/2.39 # Preprocessing time : 0.021 s
% 7.76/2.39
% 7.76/2.39 # Proof found!
% 7.76/2.39 # SZS status Theorem
% 7.76/2.39 # SZS output start CNFRefutation
% See solution above
% 7.76/2.39 # Training examples: 0 positive, 0 negative
% 7.76/2.39
% 7.76/2.39 # -------------------------------------------------
% 7.76/2.39 # User time : 0.025 s
% 7.76/2.39 # System time : 0.002 s
% 7.76/2.39 # Total time : 0.027 s
% 7.76/2.39 # Maximum resident set size: 7124 pages
% 7.76/2.39
%------------------------------------------------------------------------------