TSTP Solution File: SET798+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET798+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:14 EDT 2022
% Result : Theorem 7.82s 2.44s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 19 ~; 16 |; 13 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV10,conjecture,
! [X6,X4] :
( order(X6,X4)
=> ! [X3,X5] :
( ( subset(X3,X4)
& subset(X5,X4)
& subset(X3,X5) )
=> ! [X8] :
( lower_bound(X8,X6,X5)
=> lower_bound(X8,X6,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV10) ).
fof(lower_bound,axiom,
! [X6,X4,X8] :
( lower_bound(X8,X6,X4)
<=> ! [X3] :
( member(X3,X4)
=> apply(X6,X8,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',lower_bound) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X4] :
( order(X6,X4)
=> ! [X3,X5] :
( ( subset(X3,X4)
& subset(X5,X4)
& subset(X3,X5) )
=> ! [X8] :
( lower_bound(X8,X6,X5)
=> lower_bound(X8,X6,X3) ) ) ),
inference(assume_negation,[status(cth)],[thIV10]) ).
fof(c_0_4,negated_conjecture,
( order(esk14_0,esk15_0)
& subset(esk16_0,esk15_0)
& subset(esk17_0,esk15_0)
& subset(esk16_0,esk17_0)
& lower_bound(esk18_0,esk14_0,esk17_0)
& ~ lower_bound(esk18_0,esk14_0,esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X64,X65,X66,X67,X68,X69,X70] :
( ( ~ lower_bound(X66,X64,X65)
| ~ member(X67,X65)
| apply(X64,X66,X67) )
& ( member(esk7_3(X68,X69,X70),X69)
| lower_bound(X70,X68,X69) )
& ( ~ apply(X68,X70,esk7_3(X68,X69,X70))
| lower_bound(X70,X68,X69) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[lower_bound])])])])])]) ).
cnf(c_0_6,negated_conjecture,
~ lower_bound(esk18_0,esk14_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( lower_bound(X2,X1,X3)
| ~ apply(X1,X2,esk7_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( apply(X2,X1,X4)
| ~ lower_bound(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
lower_bound(esk18_0,esk14_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ member(X11,X9)
| member(X11,X10) )
& ( member(esk1_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ member(esk1_2(X12,X13),X13)
| subset(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ apply(esk14_0,esk18_0,esk7_3(esk14_0,esk16_0,esk18_0)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( apply(esk14_0,esk18_0,X1)
| ~ member(X1,esk17_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
subset(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
~ member(esk7_3(esk14_0,esk16_0,esk18_0),esk17_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( member(X1,esk17_0)
| ~ member(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( member(esk7_3(X1,X2,X3),X2)
| lower_bound(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ member(esk7_3(esk14_0,esk16_0,esk18_0),esk16_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET798+4 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 : Mon Jul 11 02:12:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.82/2.44 # ENIGMATIC: Solved by autoschedule:
% 7.82/2.44 # No SInE strategy applied
% 7.82/2.44 # Trying AutoSched0 for 150 seconds
% 7.82/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I
% 7.82/2.44 # and selection function SelectOptimalRestrPDepth2.
% 7.82/2.44 #
% 7.82/2.44 # Preprocessing time : 0.016 s
% 7.82/2.44 # Presaturation interreduction done
% 7.82/2.44
% 7.82/2.44 # Proof found!
% 7.82/2.44 # SZS status Theorem
% 7.82/2.44 # SZS output start CNFRefutation
% See solution above
% 7.82/2.44 # Training examples: 0 positive, 0 negative
% 7.82/2.44
% 7.82/2.44 # -------------------------------------------------
% 7.82/2.44 # User time : 0.022 s
% 7.82/2.44 # System time : 0.007 s
% 7.82/2.44 # Total time : 0.028 s
% 7.82/2.44 # Maximum resident set size: 7120 pages
% 7.82/2.44
%------------------------------------------------------------------------------