TSTP Solution File: SET594+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET594+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:32 EDT 2022
% Result : Theorem 8.09s 2.38s
% Output : CNFRefutation 8.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 10 unt; 6 nHn; 18 RR)
% Number of literals : 41 ( 2 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_6) ).
cnf(i_0_21,negated_conjecture,
union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)) = esk3_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_21) ).
cnf(i_0_20,negated_conjecture,
~ subset(esk3_0,union(esk4_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_20) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_1) ).
cnf(i_0_4,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_4) ).
cnf(i_0_8,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_8) ).
cnf(i_0_5,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7a3gurnv/lgb.p',i_0_5) ).
cnf(c_0_30,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_6 ).
cnf(c_0_31,negated_conjecture,
union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)) = esk3_0,
i_0_21 ).
cnf(c_0_32,negated_conjecture,
~ subset(esk3_0,union(esk4_0,esk5_0)),
i_0_20 ).
cnf(c_0_33,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_2 ).
cnf(c_0_34,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_1 ).
cnf(c_0_35,negated_conjecture,
( member(X1,intersection(esk3_0,esk5_0))
| member(X1,intersection(esk3_0,esk4_0))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk3_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ member(esk1_2(esk3_0,union(esk4_0,esk5_0)),union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_38,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_4 ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_8 ).
cnf(c_0_40,negated_conjecture,
( member(esk1_2(esk3_0,union(esk4_0,esk5_0)),intersection(esk3_0,esk4_0))
| member(esk1_2(esk3_0,union(esk4_0,esk5_0)),intersection(esk3_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk5_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_5 ).
cnf(c_0_43,plain,
member(esk1_2(esk3_0,union(esk4_0,esk5_0)),intersection(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ member(esk1_2(esk3_0,union(esk4_0,esk5_0)),esk4_0),
inference(spm,[status(thm)],[c_0_37,c_0_42]) ).
cnf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET594+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 21:15:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.09/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.09/2.38 # No SInE strategy applied
% 8.09/2.38 # Trying AutoSched0 for 150 seconds
% 8.09/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 8.09/2.38 # and selection function MSelectComplexExceptUniqMaxHorn.
% 8.09/2.38 #
% 8.09/2.38 # Preprocessing time : 0.012 s
% 8.09/2.38 # Presaturation interreduction done
% 8.09/2.38
% 8.09/2.38 # Proof found!
% 8.09/2.38 # SZS status Theorem
% 8.09/2.38 # SZS output start CNFRefutation
% See solution above
% 8.09/2.38 # Training examples: 0 positive, 0 negative
% 8.09/2.38
% 8.09/2.38 # -------------------------------------------------
% 8.09/2.38 # User time : 0.212 s
% 8.09/2.38 # System time : 0.007 s
% 8.09/2.38 # Total time : 0.219 s
% 8.09/2.38 # Maximum resident set size: 7128 pages
% 8.09/2.38
%------------------------------------------------------------------------------