TSTP Solution File: SET688+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:13:28 EDT 2022
% Result : Theorem 7.51s 2.43s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 6 nHn; 19 RR)
% Number of literals : 45 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_20) ).
cnf(i_0_19,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_19) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| ~ equal_set(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_6) ).
cnf(i_0_24,negated_conjecture,
equal_set(esk4_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_24) ).
cnf(i_0_28,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_28) ).
cnf(i_0_25,negated_conjecture,
~ equal_set(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_25) ).
cnf(i_0_5,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_5) ).
cnf(i_0_26,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_26) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h7bm6vav/lgb.p',i_0_18) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_20 ).
cnf(c_0_39,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ equal_set(X2,X1) ),
i_0_6 ).
cnf(c_0_41,negated_conjecture,
equal_set(esk4_0,esk6_0),
i_0_24 ).
cnf(c_0_42,plain,
( member(esk2_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
subset(esk6_0,esk4_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( member(esk2_2(esk6_0,X1),esk4_0)
| subset(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( member(esk2_2(esk6_0,X1),X2)
| subset(esk6_0,X1)
| ~ subset(esk4_0,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_28 ).
cnf(c_0_47,negated_conjecture,
~ equal_set(esk5_0,esk6_0),
i_0_25 ).
cnf(c_0_48,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_49,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_26 ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ member(esk2_2(X1,X2),X2) ),
i_0_18 ).
cnf(c_0_51,negated_conjecture,
( member(esk2_2(esk6_0,X1),esk5_0)
| subset(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
~ subset(esk6_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET688+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Sun Jul 10 21:16:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.51/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.51/2.43 # No SInE strategy applied
% 7.51/2.43 # Trying AutoSched0 for 150 seconds
% 7.51/2.43 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.51/2.43 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.51/2.43 #
% 7.51/2.43 # Preprocessing time : 0.023 s
% 7.51/2.43 # Presaturation interreduction done
% 7.51/2.43
% 7.51/2.43 # Proof found!
% 7.51/2.43 # SZS status Theorem
% 7.51/2.43 # SZS output start CNFRefutation
% See solution above
% 7.51/2.43 # Training examples: 0 positive, 0 negative
% 7.51/2.43
% 7.51/2.43 # -------------------------------------------------
% 7.51/2.43 # User time : 0.025 s
% 7.51/2.43 # System time : 0.006 s
% 7.51/2.43 # Total time : 0.031 s
% 7.51/2.43 # Maximum resident set size: 7124 pages
% 7.51/2.43
%------------------------------------------------------------------------------