TSTP Solution File: SET584+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET584+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:25 EDT 2022
% Result : Theorem 8.08s 2.49s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 10 unt; 4 nHn; 17 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,negated_conjecture,
~ subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_13) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_2) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_6) ).
cnf(i_0_14,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_14) ).
cnf(i_0_5,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_5) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b307uu0r/lgb.p',i_0_3) ).
cnf(c_0_23,negated_conjecture,
~ subset(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),
i_0_13 ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_4 ).
cnf(c_0_25,negated_conjecture,
~ member(esk1_2(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_27,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_6 ).
cnf(c_0_28,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_14 ).
cnf(c_0_29,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_5 ).
cnf(c_0_30,negated_conjecture,
~ member(esk1_2(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),esk4_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_33,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_34,negated_conjecture,
member(esk1_2(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),union(esk3_0,esk5_0)),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
~ member(esk1_2(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),esk3_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
~ member(esk1_2(union(esk3_0,esk5_0),union(esk4_0,esk5_0)),esk5_0),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET584+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 03:01:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.08/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.08/2.49 # No SInE strategy applied
% 8.08/2.49 # Trying AutoSched0 for 150 seconds
% 8.08/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 8.08/2.49 # and selection function MSelectComplexExceptUniqMaxHorn.
% 8.08/2.49 #
% 8.08/2.49 # Preprocessing time : 0.023 s
% 8.08/2.49 # Presaturation interreduction done
% 8.08/2.49
% 8.08/2.49 # Proof found!
% 8.08/2.49 # SZS status Theorem
% 8.08/2.49 # SZS output start CNFRefutation
% See solution above
% 8.08/2.49 # Training examples: 0 positive, 0 negative
% 8.08/2.49
% 8.08/2.49 # -------------------------------------------------
% 8.08/2.49 # User time : 0.026 s
% 8.08/2.49 # System time : 0.005 s
% 8.08/2.49 # Total time : 0.032 s
% 8.08/2.49 # Maximum resident set size: 7124 pages
% 8.08/2.49
%------------------------------------------------------------------------------