TSTP Solution File: SET801+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET801+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:54:27 EDT 2022
% Result : Theorem 0.25s 1.45s
% Output : CNFRefutation 0.25s
% 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 ( 13 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV13,conjecture,
! [X6,X4] :
( order(X6,X4)
=> ! [X3] :
( subset(X3,X4)
=> ! [X8] :
( greatest(X8,X6,X3)
<=> ( member(X8,X3)
& least_upper_bound(X8,X3,X6,X4) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV13) ).
fof(greatest,axiom,
! [X6,X4,X8] :
( greatest(X8,X6,X4)
<=> ( member(X8,X4)
& ! [X3] :
( member(X3,X4)
=> apply(X6,X3,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',greatest) ).
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(least_upper_bound,axiom,
! [X1,X3,X6,X4] :
( least_upper_bound(X1,X3,X6,X4)
<=> ( member(X1,X3)
& upper_bound(X1,X6,X3)
& ! [X8] :
( ( member(X8,X4)
& upper_bound(X8,X6,X3) )
=> apply(X6,X1,X8) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',least_upper_bound) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X4] :
( order(X6,X4)
=> ! [X3] :
( subset(X3,X4)
=> ! [X8] :
( greatest(X8,X6,X3)
<=> ( member(X8,X3)
& least_upper_bound(X8,X3,X6,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[thIV13]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X9,X10,X11] :
( ( member(X11,X10)
| ~ greatest(X11,X9,X10) )
& ( ~ member(X12,X10)
| apply(X9,X12,X11)
| ~ greatest(X11,X9,X10) )
& ( member(esk6_3(X9,X10,X11),X10)
| ~ member(X11,X10)
| greatest(X11,X9,X10) )
& ( ~ apply(X9,esk6_3(X9,X10,X11),X11)
| ~ member(X11,X10)
| greatest(X11,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[greatest])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( order(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& ( ~ greatest(esk4_0,esk1_0,esk3_0)
| ~ member(esk4_0,esk3_0)
| ~ least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0) )
& ( member(esk4_0,esk3_0)
| greatest(esk4_0,esk1_0,esk3_0) )
& ( least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| greatest(esk4_0,esk1_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
cnf(c_0_7,plain,
( apply(X2,X4,X1)
| ~ greatest(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( greatest(esk4_0,esk1_0,esk3_0)
| least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X9,X10,X11,X12,X9,X10,X11] :
( ( ~ upper_bound(X11,X9,X10)
| ~ member(X12,X10)
| apply(X9,X12,X11) )
& ( member(esk8_3(X9,X10,X11),X10)
| upper_bound(X11,X9,X10) )
& ( ~ apply(X9,esk8_3(X9,X10,X11),X11)
| upper_bound(X11,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[upper_bound])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| apply(esk1_0,X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( upper_bound(X1,X2,X3)
| member(esk8_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X9,X10,X11,X12,X13,X9,X10,X11,X12] :
( ( member(X9,X10)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( upper_bound(X9,X11,X10)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( ~ member(X13,X12)
| ~ upper_bound(X13,X11,X10)
| apply(X11,X9,X13)
| ~ least_upper_bound(X9,X10,X11,X12) )
& ( member(esk5_4(X9,X10,X11,X12),X12)
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) )
& ( upper_bound(esk5_4(X9,X10,X11,X12),X11,X10)
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) )
& ( ~ apply(X11,X9,esk5_4(X9,X10,X11,X12))
| ~ member(X9,X10)
| ~ upper_bound(X9,X11,X10)
| least_upper_bound(X9,X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[least_upper_bound])])])])])])]) ).
cnf(c_0_13,plain,
( upper_bound(X1,X2,X3)
| ~ apply(X2,esk8_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| upper_bound(X1,X2,esk3_0)
| apply(esk1_0,esk8_3(X2,esk3_0,X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( upper_bound(X1,X3,X2)
| ~ least_upper_bound(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ upper_bound(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
upper_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,plain,
( member(X1,X3)
| ~ greatest(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( greatest(esk4_0,esk1_0,esk3_0)
| member(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( greatest(X1,X2,X3)
| ~ member(X1,X3)
| ~ apply(X2,esk6_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( apply(esk1_0,X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| ~ member(esk4_0,esk3_0)
| ~ greatest(esk4_0,esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
member(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( greatest(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,
( greatest(X1,X2,X3)
| member(esk6_3(X2,X3,X1),X3)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( least_upper_bound(X1,X2,X3,X4)
| upper_bound(esk5_4(X1,X2,X3,X4),X3,X2)
| ~ upper_bound(X1,X3,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( ~ least_upper_bound(esk4_0,esk3_0,esk1_0,esk2_0)
| ~ greatest(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,
greatest(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,
( least_upper_bound(X1,X2,X3,X4)
| ~ upper_bound(X1,X3,X2)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk5_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( least_upper_bound(X1,X2,X3,X4)
| apply(X3,X5,esk5_4(X1,X2,X3,X4))
| ~ upper_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,
~ least_upper_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,
( least_upper_bound(X1,X2,X3,X4)
| ~ upper_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.08/0.14 % Problem : SET801+4 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 : Mon Jul 11 02:55:48 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.45 # Preprocessing time : 0.020 s
% 0.25/1.45
% 0.25/1.45 # Proof found!
% 0.25/1.45 # SZS status Theorem
% 0.25/1.45 # SZS output start CNFRefutation
% See solution above
% 0.25/1.45 # Proof object total steps : 34
% 0.25/1.45 # Proof object clause steps : 25
% 0.25/1.45 # Proof object formula steps : 9
% 0.25/1.45 # Proof object conjectures : 16
% 0.25/1.45 # Proof object clause conjectures : 13
% 0.25/1.45 # Proof object formula conjectures : 3
% 0.25/1.45 # Proof object initial clauses used : 13
% 0.25/1.45 # Proof object initial formulas used : 4
% 0.25/1.45 # Proof object generating inferences : 10
% 0.25/1.45 # Proof object simplifying inferences : 10
% 0.25/1.45 # Training examples: 0 positive, 0 negative
% 0.25/1.45 # Parsed axioms : 22
% 0.25/1.45 # Removed by relevancy pruning/SinE : 16
% 0.25/1.45 # Initial clauses : 86
% 0.25/1.45 # Removed in clause preprocessing : 0
% 0.25/1.45 # Initial clauses in saturation : 86
% 0.25/1.45 # Processed clauses : 115
% 0.25/1.45 # ...of these trivial : 1
% 0.25/1.45 # ...subsumed : 1
% 0.25/1.45 # ...remaining for further processing : 113
% 0.25/1.45 # Other redundant clauses eliminated : 0
% 0.25/1.45 # Clauses deleted for lack of memory : 0
% 0.25/1.45 # Backward-subsumed : 6
% 0.25/1.45 # Backward-rewritten : 6
% 0.25/1.45 # Generated clauses : 191
% 0.25/1.45 # ...of the previous two non-trivial : 179
% 0.25/1.45 # Contextual simplify-reflections : 3
% 0.25/1.45 # Paramodulations : 189
% 0.25/1.45 # Factorizations : 0
% 0.25/1.45 # Equation resolutions : 0
% 0.25/1.45 # Current number of processed clauses : 99
% 0.25/1.45 # Positive orientable unit clauses : 9
% 0.25/1.45 # Positive unorientable unit clauses: 0
% 0.25/1.45 # Negative unit clauses : 1
% 0.25/1.45 # Non-unit-clauses : 89
% 0.25/1.45 # Current number of unprocessed clauses: 73
% 0.25/1.45 # ...number of literals in the above : 471
% 0.25/1.45 # Current number of archived formulas : 0
% 0.25/1.45 # Current number of archived clauses : 14
% 0.25/1.45 # Clause-clause subsumption calls (NU) : 2385
% 0.25/1.45 # Rec. Clause-clause subsumption calls : 984
% 0.25/1.45 # Non-unit clause-clause subsumptions : 9
% 0.25/1.45 # Unit Clause-clause subsumption calls : 49
% 0.25/1.45 # Rewrite failures with RHS unbound : 0
% 0.25/1.45 # BW rewrite match attempts : 7
% 0.25/1.45 # BW rewrite match successes : 3
% 0.25/1.45 # Condensation attempts : 0
% 0.25/1.45 # Condensation successes : 0
% 0.25/1.45 # Termbank termtop insertions : 9017
% 0.25/1.45
% 0.25/1.45 # -------------------------------------------------
% 0.25/1.45 # User time : 0.030 s
% 0.25/1.45 # System time : 0.003 s
% 0.25/1.45 # Total time : 0.033 s
% 0.25/1.45 # Maximum resident set size: 3176 pages
% 0.25/23.44 eprover: CPU time limit exceeded, terminating
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.51 eprover: No such file or directory
% 0.25/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------