TSTP Solution File: SET596+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:34 EDT 2022
% Result : Theorem 7.51s 2.31s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 15 unt; 4 nHn; 17 RR)
% Number of literals : 42 ( 10 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_16) ).
cnf(i_0_8,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_8) ).
cnf(i_0_2,plain,
( subset(intersection(X1,X2),intersection(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_2) ).
cnf(i_0_23,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_23) ).
cnf(i_0_10,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_10) ).
cnf(i_0_22,negated_conjecture,
intersection(esk5_0,esk6_0) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_22) ).
cnf(i_0_13,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_13) ).
cnf(i_0_3,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_3) ).
cnf(i_0_15,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_15) ).
cnf(i_0_21,negated_conjecture,
intersection(esk4_0,esk6_0) != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pdgieytg/lgb.p',i_0_21) ).
cnf(c_0_34,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
i_0_16 ).
cnf(c_0_35,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_8 ).
cnf(c_0_36,plain,
( subset(intersection(X1,X2),intersection(X3,X2))
| ~ subset(X1,X3) ),
i_0_2 ).
cnf(c_0_37,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_23 ).
cnf(c_0_38,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_10 ).
cnf(c_0_39,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
subset(intersection(esk4_0,X1),intersection(esk5_0,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
intersection(esk5_0,esk6_0) = empty_set,
i_0_22 ).
cnf(c_0_42,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_13 ).
cnf(c_0_43,plain,
~ member(X1,empty_set),
i_0_3 ).
cnf(c_0_44,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
i_0_15 ).
cnf(c_0_45,negated_conjecture,
intersection(esk4_0,esk6_0) != empty_set,
i_0_21 ).
cnf(c_0_46,plain,
( X1 = X2
| ~ empty(X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
subset(intersection(esk6_0,esk4_0),empty_set),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,plain,
empty(empty_set),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
intersection(esk6_0,esk4_0) != empty_set,
inference(rw,[status(thm)],[c_0_45,c_0_42]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 19:13:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.51/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.51/2.31 # No SInE strategy applied
% 7.51/2.31 # Trying AutoSched0 for 150 seconds
% 7.51/2.31 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.51/2.31 # and selection function SelectNewComplexAHPNS.
% 7.51/2.31 #
% 7.51/2.31 # Preprocessing time : 0.022 s
% 7.51/2.31
% 7.51/2.31 # Proof found!
% 7.51/2.31 # SZS status Theorem
% 7.51/2.31 # SZS output start CNFRefutation
% See solution above
% 7.51/2.31 # Training examples: 0 positive, 0 negative
% 7.51/2.31
% 7.51/2.31 # -------------------------------------------------
% 7.51/2.31 # User time : 0.023 s
% 7.51/2.31 # System time : 0.004 s
% 7.51/2.31 # Total time : 0.028 s
% 7.51/2.31 # Maximum resident set size: 7124 pages
% 7.51/2.31
%------------------------------------------------------------------------------