TSTP Solution File: SET169+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET169+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:10:06 EDT 2022
% Result : Theorem 12.49s 2.92s
% Output : CNFRefutation 12.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 10 unt; 5 nHn; 28 RR)
% Number of literals : 66 ( 6 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)) != intersection(esk3_0,union(esk4_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_20) ).
cnf(i_0_17,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_17) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_1) ).
cnf(i_0_4,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_6) ).
cnf(i_0_16,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_16) ).
cnf(i_0_5,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ss0jax_d/lgb.p',i_0_3) ).
cnf(c_0_30,negated_conjecture,
union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)) != intersection(esk3_0,union(esk4_0,esk5_0)),
i_0_20 ).
cnf(c_0_31,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
i_0_17 ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)))
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,union(esk4_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_34,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_35,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,union(esk4_0,esk5_0)))
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_4 ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_6 ).
cnf(c_0_38,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,union(esk4_0,esk5_0)))
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_39,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_40,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk4_0))
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),union(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_5 ).
cnf(c_0_42,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk5_0))
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),union(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_37]) ).
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,
( member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0)))
| member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,union(esk4_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39])]) ).
cnf(c_0_45,plain,
~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk4_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_41]) ).
cnf(c_0_46,plain,
~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,esk5_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_41]) ).
cnf(c_0_47,plain,
member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),intersection(esk3_0,union(esk4_0,esk5_0))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_48,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk4_0)
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk3_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_49,plain,
member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk3_0),
inference(spm,[status(thm)],[c_0_37,c_0_47]) ).
cnf(c_0_50,plain,
( ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk5_0)
| ~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk3_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_36]) ).
cnf(c_0_51,plain,
member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_52,plain,
~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_53,plain,
~ member(esk2_2(intersection(esk3_0,union(esk4_0,esk5_0)),union(intersection(esk3_0,esk4_0),intersection(esk3_0,esk5_0))),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_51]),c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET169+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 02:41:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 12.49/2.92 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.49/2.92 # No SInE strategy applied
% 12.49/2.92 # Trying AutoSched0 for 150 seconds
% 12.49/2.92 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 12.49/2.92 # and selection function MSelectComplexExceptUniqMaxHorn.
% 12.49/2.92 #
% 12.49/2.92 # Preprocessing time : 0.023 s
% 12.49/2.92 # Presaturation interreduction done
% 12.49/2.92
% 12.49/2.92 # Proof found!
% 12.49/2.92 # SZS status Theorem
% 12.49/2.92 # SZS output start CNFRefutation
% See solution above
% 12.49/2.92 # Training examples: 0 positive, 0 negative
% 12.49/2.92
% 12.49/2.92 # -------------------------------------------------
% 12.49/2.92 # User time : 0.328 s
% 12.49/2.92 # System time : 0.018 s
% 12.49/2.92 # Total time : 0.346 s
% 12.49/2.92 # Maximum resident set size: 7124 pages
% 12.49/2.92
%------------------------------------------------------------------------------