TSTP Solution File: SET810+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET810+4 : TPTP v8.1.0. Released v3.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:14:19 EDT 2022
% Result : Theorem 9.18s 2.62s
% Output : CNFRefutation 9.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 13 unt; 0 nHn; 27 RR)
% Number of literals : 53 ( 0 equ; 29 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_22) ).
cnf(i_0_75,negated_conjecture,
member(esk15_0,on),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_75) ).
cnf(i_0_21,plain,
( subset(X1,X2)
| ~ member(X1,X2)
| ~ member(X2,on) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_21) ).
cnf(i_0_74,negated_conjecture,
member(esk14_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_74) ).
cnf(i_0_64,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_64) ).
cnf(i_0_67,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_67) ).
cnf(i_0_59,plain,
( ~ member(X1,X2)
| ~ member(X3,X2)
| ~ strict_order(X4,X2)
| ~ apply(X4,X1,X3)
| ~ apply(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_59) ).
cnf(i_0_29,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_29) ).
cnf(i_0_73,negated_conjecture,
member(esk15_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xs2_c09f/lgb.p',i_0_73) ).
cnf(c_0_85,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
i_0_22 ).
cnf(c_0_86,negated_conjecture,
member(esk15_0,on),
i_0_75 ).
cnf(c_0_87,plain,
( subset(X1,X2)
| ~ member(X1,X2)
| ~ member(X2,on) ),
i_0_21 ).
cnf(c_0_88,negated_conjecture,
member(esk14_0,esk15_0),
i_0_74 ).
cnf(c_0_89,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
i_0_64 ).
cnf(c_0_90,negated_conjecture,
strict_well_order(member_predicate,esk15_0),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_67 ).
cnf(c_0_92,negated_conjecture,
subset(esk14_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_86])]) ).
cnf(c_0_93,plain,
( ~ member(X1,X2)
| ~ member(X3,X2)
| ~ strict_order(X4,X2)
| ~ apply(X4,X1,X3)
| ~ apply(X4,X3,X1) ),
i_0_59 ).
cnf(c_0_94,plain,
strict_order(member_predicate,esk15_0),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
i_0_29 ).
cnf(c_0_96,negated_conjecture,
member(esk15_0,esk14_0),
i_0_73 ).
cnf(c_0_97,plain,
( member(X1,esk15_0)
| ~ member(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_98,plain,
( ~ apply(member_predicate,X1,X2)
| ~ apply(member_predicate,X2,X1)
| ~ member(X1,esk15_0)
| ~ member(X2,esk15_0) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_99,negated_conjecture,
apply(member_predicate,esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_95,c_0_88]) ).
cnf(c_0_100,negated_conjecture,
apply(member_predicate,esk15_0,esk14_0),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,negated_conjecture,
member(esk15_0,esk15_0),
inference(spm,[status(thm)],[c_0_97,c_0_96]) ).
cnf(c_0_102,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_88]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 10 07:26:34 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.18/2.62 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.18/2.62 # No SInE strategy applied
% 9.18/2.62 # Trying AutoSched0 for 150 seconds
% 9.18/2.62 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 9.18/2.62 # and selection function SelectNegativeLiterals.
% 9.18/2.62 #
% 9.18/2.62 # Preprocessing time : 0.024 s
% 9.18/2.62
% 9.18/2.62 # Proof found!
% 9.18/2.62 # SZS status Theorem
% 9.18/2.62 # SZS output start CNFRefutation
% See solution above
% 9.18/2.62 # Training examples: 0 positive, 0 negative
% 9.18/2.62
% 9.18/2.62 # -------------------------------------------------
% 9.18/2.62 # User time : 0.031 s
% 9.18/2.62 # System time : 0.004 s
% 9.18/2.62 # Total time : 0.035 s
% 9.18/2.62 # Maximum resident set size: 7120 pages
% 9.18/2.62
%------------------------------------------------------------------------------