TSTP Solution File: SET802+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET802+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:20:54 EDT 2023
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 152 ( 55 ~; 65 |; 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 : 93 ( 3 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/sandbox2/tmp/tmp.0YkbeIg3Ao/E---3.1_19878.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/sandbox2/tmp/tmp.0YkbeIg3Ao/E---3.1_19878.p',least) ).
fof(lower_bound,axiom,
! [X6,X4,X8] :
( lower_bound(X8,X6,X4)
<=> ! [X3] :
( member(X3,X4)
=> apply(X6,X8,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0YkbeIg3Ao/E---3.1_19878.p',lower_bound) ).
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/sandbox2/tmp/tmp.0YkbeIg3Ao/E---3.1_19878.p',greatest_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,
! [X23,X24,X25,X26,X27,X28,X29] :
( ( member(X25,X24)
| ~ least(X25,X23,X24) )
& ( ~ member(X26,X24)
| apply(X23,X25,X26)
| ~ least(X25,X23,X24) )
& ( member(esk6_3(X27,X28,X29),X28)
| ~ member(X29,X28)
| least(X29,X27,X28) )
& ( ~ apply(X27,X29,esk6_3(X27,X28,X29))
| ~ member(X29,X28)
| least(X29,X27,X28) ) ),
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(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& ( ~ least(esk4_0,esk1_0,esk3_0)
| ~ member(esk4_0,esk3_0)
| ~ greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0) )
& ( member(esk4_0,esk3_0)
| least(esk4_0,esk1_0,esk3_0) )
& ( greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| least(esk4_0,esk1_0,esk3_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,
( apply(X3,X4,X1)
| ~ member(X1,X2)
| ~ least(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| least(esk4_0,esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X39,X40,X41,X42,X43,X44,X45] :
( ( ~ lower_bound(X41,X39,X40)
| ~ member(X42,X40)
| apply(X39,X41,X42) )
& ( member(esk8_3(X43,X44,X45),X44)
| lower_bound(X45,X43,X44) )
& ( ~ apply(X43,X45,esk8_3(X43,X44,X45))
| lower_bound(X45,X43,X44) ) ),
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_10,negated_conjecture,
( greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| apply(esk1_0,esk4_0,X1)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( member(esk8_3(X1,X2,X3),X2)
| lower_bound(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20,X21] :
( ( member(X13,X14)
| ~ greatest_lower_bound(X13,X14,X15,X16) )
& ( lower_bound(X13,X15,X14)
| ~ greatest_lower_bound(X13,X14,X15,X16) )
& ( ~ member(X17,X16)
| ~ lower_bound(X17,X15,X14)
| apply(X15,X17,X13)
| ~ greatest_lower_bound(X13,X14,X15,X16) )
& ( member(esk5_4(X18,X19,X20,X21),X21)
| ~ member(X18,X19)
| ~ lower_bound(X18,X20,X19)
| greatest_lower_bound(X18,X19,X20,X21) )
& ( lower_bound(esk5_4(X18,X19,X20,X21),X20,X19)
| ~ member(X18,X19)
| ~ lower_bound(X18,X20,X19)
| greatest_lower_bound(X18,X19,X20,X21) )
& ( ~ apply(X20,esk5_4(X18,X19,X20,X21),X18)
| ~ member(X18,X19)
| ~ lower_bound(X18,X20,X19)
| greatest_lower_bound(X18,X19,X20,X21) ) ),
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_13,plain,
( lower_bound(X2,X1,X3)
| ~ apply(X1,X2,esk8_3(X1,X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| lower_bound(X1,X2,esk3_0)
| apply(esk1_0,esk4_0,esk8_3(X2,esk3_0,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( lower_bound(X1,X2,X3)
| ~ greatest_lower_bound(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( apply(X2,X1,X4)
| ~ lower_bound(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
lower_bound(esk4_0,esk1_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( member(esk4_0,esk3_0)
| least(esk4_0,esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( member(X1,X2)
| ~ least(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( least(X2,X1,X3)
| ~ apply(X1,X2,esk6_3(X1,X3,X2))
| ~ member(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( apply(esk1_0,esk4_0,X1)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ least(esk4_0,esk1_0,esk3_0)
| ~ member(esk4_0,esk3_0)
| ~ greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
member(esk4_0,esk3_0),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( least(esk4_0,esk1_0,X1)
| ~ member(esk6_3(esk1_0,X1,esk4_0),esk3_0)
| ~ member(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( member(esk6_3(X1,X2,X3),X2)
| least(X3,X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( lower_bound(esk5_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_12]) ).
cnf(c_0_27,negated_conjecture,
( ~ greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| ~ least(esk4_0,esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
least(esk4_0,esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).
cnf(c_0_29,plain,
( greatest_lower_bound(X2,X3,X1,X4)
| ~ apply(X1,esk5_4(X2,X3,X1,X4),X2)
| ~ member(X2,X3)
| ~ lower_bound(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( greatest_lower_bound(X1,X2,X3,X4)
| apply(X3,esk5_4(X1,X2,X3,X4),X5)
| ~ lower_bound(X1,X3,X2)
| ~ member(X5,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ greatest_lower_bound(esk4_0,esk3_0,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_32,plain,
( greatest_lower_bound(X1,X2,X3,X4)
| ~ lower_bound(X1,X3,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET802+4 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n007.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 17:44:39 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0YkbeIg3Ao/E---3.1_19878.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 19957 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFLS32-SFFFFFNN
% 0.18/0.47 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.18/0.47 # G-E--_301_C18_F1_URBAN_S0Y with pid 19960 completed with status 0
% 0.18/0.47 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGHSF-FFLS32-SFFFFFNN
% 0.18/0.47 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.003 s
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 22
% 0.18/0.47 # Removed by relevancy pruning/SinE : 16
% 0.18/0.47 # Initial clauses : 86
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 86
% 0.18/0.47 # Processed clauses : 112
% 0.18/0.47 # ...of these trivial : 1
% 0.18/0.47 # ...subsumed : 1
% 0.18/0.47 # ...remaining for further processing : 110
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 7
% 0.18/0.47 # Backward-rewritten : 2
% 0.18/0.47 # Generated clauses : 133
% 0.18/0.47 # ...of the previous two non-redundant : 123
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 2
% 0.18/0.47 # Paramodulations : 130
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Total rewrite steps : 10
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 98
% 0.18/0.47 # Positive orientable unit clauses : 7
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 1
% 0.18/0.47 # Non-unit-clauses : 90
% 0.18/0.47 # Current number of unprocessed clauses: 93
% 0.18/0.47 # ...number of literals in the above : 691
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 12
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 2568
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 947
% 0.18/0.47 # Non-unit clause-clause subsumptions : 8
% 0.18/0.47 # Unit Clause-clause subsumption calls : 45
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 7
% 0.18/0.47 # BW rewrite match successes : 3
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 8130
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.016 s
% 0.18/0.47 # System time : 0.001 s
% 0.18/0.47 # Total time : 0.018 s
% 0.18/0.47 # Maximum resident set size: 2064 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.018 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.020 s
% 0.18/0.47 # Maximum resident set size: 1732 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------