TSTP Solution File: SET797+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET797+4 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% DateTime : Tue May 21 02:56:01 EDT 2024
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 59 ( 18 ~; 18 |; 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 : 46 ( 0 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV9,conjecture,
! [X6,X4] :
( order(X6,X4)
=> ! [X3,X5] :
( ( subset(X3,X4)
& subset(X5,X4)
& subset(X3,X5) )
=> ! [X8] :
( upper_bound(X8,X6,X5)
=> upper_bound(X8,X6,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV9) ).
fof(upper_bound,axiom,
! [X6,X4,X8] :
( upper_bound(X8,X6,X4)
<=> ! [X3] :
( member(X3,X4)
=> apply(X6,X3,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',upper_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] :
( upper_bound(X8,X6,X5)
=> upper_bound(X8,X6,X3) ) ) ),
inference(assume_negation,[status(cth)],[thIV9]) ).
fof(c_0_4,plain,
! [X14,X15,X16,X17,X18,X19,X20] :
( ( ~ upper_bound(X16,X14,X15)
| ~ member(X17,X15)
| apply(X14,X17,X16) )
& ( member(esk6_3(X18,X19,X20),X19)
| upper_bound(X20,X18,X19) )
& ( ~ apply(X18,esk6_3(X18,X19,X20),X20)
| upper_bound(X20,X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[upper_bound])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( order(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& subset(esk4_0,esk2_0)
& subset(esk3_0,esk4_0)
& upper_bound(esk5_0,esk1_0,esk4_0)
& ~ upper_bound(esk5_0,esk1_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( apply(X2,X4,X1)
| ~ upper_bound(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
upper_bound(esk5_0,esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X22,X23,X24,X25,X26] :
( ( ~ subset(X22,X23)
| ~ member(X24,X22)
| member(X24,X23) )
& ( member(esk7_2(X25,X26),X25)
| subset(X25,X26) )
& ( ~ member(esk7_2(X25,X26),X26)
| subset(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_9,plain,
( upper_bound(X3,X1,X2)
| ~ apply(X1,esk6_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( apply(esk1_0,X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( upper_bound(esk5_0,esk1_0,X1)
| ~ member(esk6_3(esk1_0,X1,esk5_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( upper_bound(esk5_0,esk1_0,X1)
| ~ member(esk6_3(esk1_0,X1,esk5_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( member(esk6_3(X1,X2,X3),X2)
| upper_bound(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
~ upper_bound(esk5_0,esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET797+4 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.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 : 300
% 0.12/0.33 % DateTime : Mon May 20 11:32:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 0.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_3 with pid 13288 completed with status 0
% 0.18/0.49 # Result found by new_bool_3
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.18/0.49 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 13291 completed with status 0
% 0.18/0.49 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.18/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGUSF-FFMS32-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.002 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 22
% 0.18/0.49 # Removed by relevancy pruning/SinE : 18
% 0.18/0.49 # Initial clauses : 77
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 77
% 0.18/0.49 # Processed clauses : 112
% 0.18/0.49 # ...of these trivial : 0
% 0.18/0.49 # ...subsumed : 1
% 0.18/0.49 # ...remaining for further processing : 111
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 0
% 0.18/0.49 # Generated clauses : 33
% 0.18/0.49 # ...of the previous two non-redundant : 28
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 33
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 2
% 0.18/0.49 # ...of those cached : 0
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 34
% 0.18/0.49 # Positive orientable unit clauses : 7
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 1
% 0.18/0.49 # Non-unit-clauses : 26
% 0.18/0.49 # Current number of unprocessed clauses: 70
% 0.18/0.49 # ...number of literals in the above : 277
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 77
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1070
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 439
% 0.18/0.49 # Non-unit clause-clause subsumptions : 1
% 0.18/0.49 # Unit Clause-clause subsumption calls : 3
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 7
% 0.18/0.49 # BW rewrite match successes : 0
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 5596
% 0.18/0.49 # Search garbage collected termcells : 997
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.013 s
% 0.18/0.49 # System time : 0.003 s
% 0.18/0.49 # Total time : 0.015 s
% 0.18/0.49 # Maximum resident set size: 1888 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.015 s
% 0.18/0.49 # System time : 0.004 s
% 0.18/0.49 # Total time : 0.019 s
% 0.18/0.49 # Maximum resident set size: 1732 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------