TSTP Solution File: SET797+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET797+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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:54:26 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% 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 ( 5 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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,
! [X9,X10,X11,X12,X9,X10,X11] :
( ( ~ upper_bound(X11,X9,X10)
| ~ member(X12,X10)
| apply(X9,X12,X11) )
& ( member(esk6_3(X9,X10,X11),X10)
| upper_bound(X11,X9,X10) )
& ( ~ apply(X9,esk6_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])])])])])])]) ).
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(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_3])])])])]) ).
cnf(c_0_6,plain,
( apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ upper_bound(X3,X1,X4) ),
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,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk7_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk7_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[subset])])])])])])]) ).
cnf(c_0_9,plain,
( upper_bound(X1,X2,X3)
| ~ apply(X2,esk6_3(X2,X3,X1),X1) ),
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(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
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,
( upper_bound(X1,X2,X3)
| member(esk6_3(X2,X3,X1),X3) ),
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.07/0.12 % Problem : SET797+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 23:05:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 19
% 0.23/1.42 # Proof object clause steps : 12
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 11
% 0.23/1.42 # Proof object clause conjectures : 8
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 7
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 5
% 0.23/1.42 # Proof object simplifying inferences : 1
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 22
% 0.23/1.42 # Removed by relevancy pruning/SinE : 18
% 0.23/1.42 # Initial clauses : 77
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 77
% 0.23/1.42 # Processed clauses : 91
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 90
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 125
% 0.23/1.42 # ...of the previous two non-trivial : 117
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 125
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 90
% 0.23/1.42 # Positive orientable unit clauses : 7
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 82
% 0.23/1.42 # Current number of unprocessed clauses: 103
% 0.23/1.42 # ...number of literals in the above : 593
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 999
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 404
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 84
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 6
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 6927
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.021 s
% 0.23/1.42 # System time : 0.005 s
% 0.23/1.42 # Total time : 0.026 s
% 0.23/1.42 # Maximum resident set size: 3140 pages
%------------------------------------------------------------------------------