TSTP Solution File: SET802+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET802+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:16 EDT 2022
% Result : Theorem 8.52s 2.46s
% Output : CNFRefutation 8.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 145 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 169 ( 67 ~; 70 |; 20 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 82 ( 2 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV14,conjecture,
! [X6,X4] :
( order(X6,X4)
=> ! [X3] :
( subset(X3,X4)
=> ! [X8] :
( least(X8,X6,X3)
<=> ( member(X8,X3)
& greatest_lower_bound(X8,X3,X6,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV14) ).
fof(least,axiom,
! [X6,X4,X8] :
( least(X8,X6,X4)
<=> ( member(X8,X4)
& ! [X3] :
( member(X3,X4)
=> apply(X6,X8,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',least) ).
fof(greatest_lower_bound,axiom,
! [X1,X3,X6,X4] :
( greatest_lower_bound(X1,X3,X6,X4)
<=> ( member(X1,X3)
& lower_bound(X1,X6,X3)
& ! [X8] :
( ( member(X8,X4)
& lower_bound(X8,X6,X3) )
=> apply(X6,X8,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',greatest_lower_bound) ).
fof(lower_bound,axiom,
! [X6,X4,X8] :
( lower_bound(X8,X6,X4)
<=> ! [X3] :
( member(X3,X4)
=> apply(X6,X8,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',lower_bound) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X4] :
( order(X6,X4)
=> ! [X3] :
( subset(X3,X4)
=> ! [X8] :
( least(X8,X6,X3)
<=> ( member(X8,X3)
& greatest_lower_bound(X8,X3,X6,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[thIV14]) ).
fof(c_0_5,plain,
! [X80,X81,X82,X83,X84,X85,X86] :
( ( member(X82,X81)
| ~ least(X82,X80,X81) )
& ( ~ member(X83,X81)
| apply(X80,X82,X83)
| ~ least(X82,X80,X81) )
& ( member(esk9_3(X84,X85,X86),X85)
| ~ member(X86,X85)
| least(X86,X84,X85) )
& ( ~ apply(X84,X86,esk9_3(X84,X85,X86))
| ~ member(X86,X85)
| least(X86,X84,X85) ) ),
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)],[least])])])])])]) ).
fof(c_0_6,negated_conjecture,
( order(esk14_0,esk15_0)
& subset(esk16_0,esk15_0)
& ( ~ least(esk17_0,esk14_0,esk16_0)
| ~ member(esk17_0,esk16_0)
| ~ greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0) )
& ( member(esk17_0,esk16_0)
| least(esk17_0,esk14_0,esk16_0) )
& ( greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)
| least(esk17_0,esk14_0,esk16_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,plain,
( member(X1,X2)
| ~ least(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( member(esk17_0,esk16_0)
| least(esk17_0,esk14_0,esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ least(esk17_0,esk14_0,esk16_0)
| ~ member(esk17_0,esk16_0)
| ~ greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
member(esk17_0,esk16_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
! [X114,X115,X116,X117,X118,X119,X120,X121,X122] :
( ( member(X114,X115)
| ~ greatest_lower_bound(X114,X115,X116,X117) )
& ( lower_bound(X114,X116,X115)
| ~ greatest_lower_bound(X114,X115,X116,X117) )
& ( ~ member(X118,X117)
| ~ lower_bound(X118,X116,X115)
| apply(X116,X118,X114)
| ~ greatest_lower_bound(X114,X115,X116,X117) )
& ( member(esk13_4(X119,X120,X121,X122),X122)
| ~ member(X119,X120)
| ~ lower_bound(X119,X121,X120)
| greatest_lower_bound(X119,X120,X121,X122) )
& ( lower_bound(esk13_4(X119,X120,X121,X122),X121,X120)
| ~ member(X119,X120)
| ~ lower_bound(X119,X121,X120)
| greatest_lower_bound(X119,X120,X121,X122) )
& ( ~ apply(X121,esk13_4(X119,X120,X121,X122),X119)
| ~ member(X119,X120)
| ~ lower_bound(X119,X121,X120)
| greatest_lower_bound(X119,X120,X121,X122) ) ),
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)],[greatest_lower_bound])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)
| ~ least(esk17_0,esk14_0,esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,plain,
( lower_bound(esk13_4(X1,X2,X3,X4),X3,X2)
| greatest_lower_bound(X1,X2,X3,X4)
| ~ member(X1,X2)
| ~ lower_bound(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( apply(X3,X4,X1)
| ~ member(X1,X2)
| ~ least(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)
| least(esk17_0,esk14_0,esk16_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,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_17,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| ~ least(esk17_0,esk14_0,esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
cnf(c_0_18,plain,
( least(X2,X1,X3)
| ~ apply(X1,X2,esk9_3(X1,X3,X2))
| ~ member(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( lower_bound(X1,X2,X3)
| ~ greatest_lower_bound(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)
| apply(esk14_0,esk17_0,X1)
| ~ member(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( apply(X2,X1,X4)
| ~ lower_bound(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( member(esk9_3(X1,X2,X3),X2)
| least(X3,X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0)
| ~ apply(esk14_0,esk17_0,esk9_3(esk14_0,esk16_0,esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10])]) ).
cnf(c_0_24,negated_conjecture,
( apply(esk14_0,esk17_0,X1)
| ~ member(X1,esk16_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| member(esk9_3(esk14_0,esk16_0,esk17_0),esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_10])]) ).
cnf(c_0_26,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,plain,
( lower_bound(X2,X1,X3)
| ~ apply(X1,X2,esk7_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| ~ apply(esk14_0,esk17_0,esk7_3(esk14_0,esk16_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( member(esk7_3(X1,X2,X3),X2)
| lower_bound(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0)
| ~ member(esk7_3(esk14_0,esk16_0,esk17_0),esk16_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
lower_bound(esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk14_0,esk16_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
( greatest_lower_bound(X2,X3,X1,X4)
| ~ apply(X1,esk13_4(X2,X3,X1,X4),X2)
| ~ member(X2,X3)
| ~ lower_bound(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( apply(esk14_0,esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),X1)
| ~ member(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( ~ least(esk17_0,esk14_0,esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0)
| ~ apply(esk14_0,esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk17_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_32]),c_0_10])]) ).
cnf(c_0_35,negated_conjecture,
apply(esk14_0,esk13_4(esk17_0,esk16_0,esk14_0,esk15_0),esk17_0),
inference(spm,[status(thm)],[c_0_33,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
( ~ least(esk17_0,esk14_0,esk16_0)
| ~ lower_bound(esk17_0,esk14_0,esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
( ~ lower_bound(esk17_0,esk14_0,esk16_0)
| ~ apply(esk14_0,esk17_0,esk9_3(esk14_0,esk16_0,esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_18]),c_0_10])]) ).
cnf(c_0_38,negated_conjecture,
( ~ lower_bound(esk17_0,esk14_0,esk16_0)
| ~ member(esk9_3(esk14_0,esk16_0,esk17_0),esk16_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_39,negated_conjecture,
~ lower_bound(esk17_0,esk14_0,esk16_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_22]),c_0_10])]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
~ apply(esk14_0,esk17_0,esk7_3(esk14_0,esk16_0,esk17_0)),
inference(spm,[status(thm)],[c_0_39,c_0_27]) ).
cnf(c_0_41,negated_conjecture,
member(esk7_3(esk14_0,esk16_0,esk17_0),esk16_0),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET802+4 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 09:04:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.52/2.46 # ENIGMATIC: Solved by autoschedule:
% 8.52/2.46 # No SInE strategy applied
% 8.52/2.46 # Trying AutoSched0 for 150 seconds
% 8.52/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I
% 8.52/2.46 # and selection function SelectOptimalRestrPDepth2.
% 8.52/2.46 #
% 8.52/2.46 # Preprocessing time : 0.031 s
% 8.52/2.46 # Presaturation interreduction done
% 8.52/2.46
% 8.52/2.46 # Proof found!
% 8.52/2.46 # SZS status Theorem
% 8.52/2.46 # SZS output start CNFRefutation
% See solution above
% 8.52/2.46 # Training examples: 0 positive, 0 negative
% 8.52/2.46
% 8.52/2.46 # -------------------------------------------------
% 8.52/2.46 # User time : 0.185 s
% 8.52/2.46 # System time : 0.012 s
% 8.52/2.46 # Total time : 0.197 s
% 8.52/2.46 # Maximum resident set size: 7124 pages
% 8.52/2.46
%------------------------------------------------------------------------------