TSTP Solution File: SET624+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:56 EDT 2022
% Result : Theorem 4.48s 2.29s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 5 unt; 10 nHn; 28 RR)
% Number of literals : 84 ( 0 equ; 39 neg)
% Maximal clause size : 3 ( 2 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 : 64 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_4) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_1) ).
cnf(i_0_6,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_6) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_5) ).
cnf(i_0_8,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_8) ).
cnf(i_0_13,negated_conjecture,
( intersect(esk3_0,esk4_0)
| intersect(esk3_0,esk5_0)
| intersect(esk3_0,union(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
( ~ intersect(esk3_0,esk5_0)
| ~ intersect(esk3_0,union(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
( ~ intersect(esk3_0,esk4_0)
| ~ intersect(esk3_0,union(esk4_0,esk5_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_15) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-w47os9ry/lgb.p',i_0_3) ).
cnf(c_0_26,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_4 ).
cnf(c_0_27,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_28,plain,
( intersect(X1,union(X2,X3))
| ~ member(X4,X1)
| ~ member(X4,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_6 ).
cnf(c_0_30,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_31,plain,
( intersect(X1,union(X2,X3))
| ~ member(esk1_2(X1,X4),X3)
| ~ intersect(X1,X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_5 ).
cnf(c_0_33,plain,
( intersect(X1,union(X2,X3))
| ~ member(X4,X1)
| ~ member(X4,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_34,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
i_0_8 ).
cnf(c_0_35,negated_conjecture,
( intersect(esk3_0,esk4_0)
| intersect(esk3_0,esk5_0)
| intersect(esk3_0,union(esk4_0,esk5_0)) ),
i_0_13 ).
cnf(c_0_36,negated_conjecture,
( ~ intersect(esk3_0,esk5_0)
| ~ intersect(esk3_0,union(esk4_0,esk5_0)) ),
i_0_14 ).
cnf(c_0_37,plain,
( intersect(X1,union(X2,X3))
| ~ intersect(X1,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( intersect(X1,union(X2,X3))
| ~ member(esk1_2(X1,X4),X2)
| ~ intersect(X1,X4) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( intersect(union(esk4_0,esk5_0),esk3_0)
| intersect(esk3_0,esk4_0)
| intersect(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ intersect(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( ~ intersect(esk3_0,esk4_0)
| ~ intersect(esk3_0,union(esk4_0,esk5_0)) ),
i_0_15 ).
cnf(c_0_42,plain,
( intersect(X1,union(X2,X3))
| ~ intersect(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_43,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_44,negated_conjecture,
( intersect(union(esk4_0,esk5_0),esk3_0)
| intersect(esk3_0,esk4_0) ),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
~ intersect(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( member(esk1_2(union(X1,X2),X3),X1)
| member(esk1_2(union(X1,X2),X3),X2)
| ~ intersect(union(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
intersect(union(esk4_0,esk5_0),esk3_0),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( intersect(X1,X2)
| ~ member(esk1_2(X3,X2),X1)
| ~ intersect(X3,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_49,plain,
( member(esk1_2(union(esk4_0,esk5_0),esk3_0),esk5_0)
| member(esk1_2(union(esk4_0,esk5_0),esk3_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( member(esk1_2(union(esk4_0,esk5_0),esk3_0),esk4_0)
| intersect(esk5_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_47])]) ).
cnf(c_0_51,plain,
( intersect(esk5_0,esk3_0)
| intersect(esk4_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_50]),c_0_47])]) ).
cnf(c_0_52,plain,
intersect(esk4_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_51]),c_0_40]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_52]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET624+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 10 21:15:40 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 4.48/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.48/2.29 # No SInE strategy applied
% 4.48/2.29 # Trying AutoSched0 for 150 seconds
% 4.48/2.29 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 4.48/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.48/2.29 #
% 4.48/2.29 # Preprocessing time : 0.012 s
% 4.48/2.29
% 4.48/2.29 # Proof found!
% 4.48/2.29 # SZS status Theorem
% 4.48/2.29 # SZS output start CNFRefutation
% See solution above
% 4.48/2.29 # Training examples: 0 positive, 0 negative
% 4.48/2.29
% 4.48/2.29 # -------------------------------------------------
% 4.48/2.29 # User time : 0.017 s
% 4.48/2.29 # System time : 0.003 s
% 4.48/2.29 # Total time : 0.020 s
% 4.48/2.29 # Maximum resident set size: 7120 pages
% 4.48/2.29
%------------------------------------------------------------------------------