TSTP Solution File: SET175+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET175+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:10 EDT 2022
% Result : Theorem 8.35s 2.49s
% Output : CNFRefutation 8.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 4 nHn; 12 RR)
% Number of literals : 32 ( 6 equ; 13 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
union(esk3_0,intersection(esk3_0,esk4_0)) != esk3_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtprdo2m/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-rtprdo2m/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-rtprdo2m/lgb.p',i_0_2) ).
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-rtprdo2m/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtprdo2m/lgb.p',i_0_3) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rtprdo2m/lgb.p',i_0_6) ).
cnf(c_0_27,negated_conjecture,
union(esk3_0,intersection(esk3_0,esk4_0)) != esk3_0,
i_0_20 ).
cnf(c_0_28,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
i_0_17 ).
cnf(c_0_29,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_30,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_31,negated_conjecture,
~ member(esk2_2(esk3_0,union(esk3_0,intersection(esk3_0,esk4_0))),esk3_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29]) ).
cnf(c_0_32,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_33,negated_conjecture,
member(esk2_2(esk3_0,union(esk3_0,intersection(esk3_0,esk4_0))),union(esk3_0,intersection(esk3_0,esk4_0))),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30])]),c_0_31]) ).
cnf(c_0_34,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_6 ).
cnf(c_0_35,plain,
member(esk2_2(esk3_0,union(esk3_0,intersection(esk3_0,esk4_0))),intersection(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 11:13:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected complete mode:
% 8.35/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.35/2.49 # No SInE strategy applied
% 8.35/2.49 # Trying AutoSched0 for 150 seconds
% 8.35/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 8.35/2.49 # and selection function MSelectComplexExceptUniqMaxHorn.
% 8.35/2.49 #
% 8.35/2.49 # Preprocessing time : 0.020 s
% 8.35/2.49 # Presaturation interreduction done
% 8.35/2.49
% 8.35/2.49 # Proof found!
% 8.35/2.49 # SZS status Theorem
% 8.35/2.49 # SZS output start CNFRefutation
% See solution above
% 8.35/2.49 # Training examples: 0 positive, 0 negative
% 8.35/2.49
% 8.35/2.49 # -------------------------------------------------
% 8.35/2.49 # User time : 0.046 s
% 8.35/2.49 # System time : 0.011 s
% 8.35/2.49 # Total time : 0.056 s
% 8.35/2.49 # Maximum resident set size: 7128 pages
% 8.35/2.49
%------------------------------------------------------------------------------