TSTP Solution File: SET800+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET800+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 96 ( 30 ~; 30 |; 24 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-4 aty)
% Number of variables : 62 ( 12 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIV12,conjecture,
! [X6,X4] :
( order(X6,X4)
=> ! [X9,X10] :
( ( subset(X9,X4)
& subset(X10,X4)
& subset(X9,X10) )
=> ! [X11,X12] :
( ( greatest_lower_bound(X11,X9,X6,X4)
& greatest_lower_bound(X12,X10,X6,X4) )
=> apply(X6,X12,X11) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thIV12) ).
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/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/sandbox2/benchmark/Axioms/SET006+3.ax',lower_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_4,negated_conjecture,
~ ! [X6,X4] :
( order(X6,X4)
=> ! [X9,X10] :
( ( subset(X9,X4)
& subset(X10,X4)
& subset(X9,X10) )
=> ! [X11,X12] :
( ( greatest_lower_bound(X11,X9,X6,X4)
& greatest_lower_bound(X12,X10,X6,X4) )
=> apply(X6,X12,X11) ) ) ),
inference(assume_negation,[status(cth)],[thIV12]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X13,X9,X10,X11,X12] :
( ( member(X9,X10)
| ~ greatest_lower_bound(X9,X10,X11,X12) )
& ( lower_bound(X9,X11,X10)
| ~ greatest_lower_bound(X9,X10,X11,X12) )
& ( ~ member(X13,X12)
| ~ lower_bound(X13,X11,X10)
| apply(X11,X13,X9)
| ~ greatest_lower_bound(X9,X10,X11,X12) )
& ( member(esk7_4(X9,X10,X11,X12),X12)
| ~ member(X9,X10)
| ~ lower_bound(X9,X11,X10)
| greatest_lower_bound(X9,X10,X11,X12) )
& ( lower_bound(esk7_4(X9,X10,X11,X12),X11,X10)
| ~ member(X9,X10)
| ~ lower_bound(X9,X11,X10)
| greatest_lower_bound(X9,X10,X11,X12) )
& ( ~ apply(X11,esk7_4(X9,X10,X11,X12),X9)
| ~ member(X9,X10)
| ~ lower_bound(X9,X11,X10)
| greatest_lower_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)],[greatest_lower_bound])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( order(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& subset(esk4_0,esk2_0)
& subset(esk3_0,esk4_0)
& greatest_lower_bound(esk5_0,esk3_0,esk1_0,esk2_0)
& greatest_lower_bound(esk6_0,esk4_0,esk1_0,esk2_0)
& ~ apply(esk1_0,esk6_0,esk5_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_4])])])])]) ).
fof(c_0_7,plain,
! [X9,X10,X11,X12,X9,X10,X11] :
( ( ~ lower_bound(X11,X9,X10)
| ~ member(X12,X10)
| apply(X9,X11,X12) )
& ( member(esk9_3(X9,X10,X11),X10)
| lower_bound(X11,X9,X10) )
& ( ~ apply(X9,X11,esk9_3(X9,X10,X11))
| lower_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)],[lower_bound])])])])])])]) ).
cnf(c_0_8,plain,
( lower_bound(X1,X3,X2)
| ~ greatest_lower_bound(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
greatest_lower_bound(esk6_0,esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( apply(X1,X2,X3)
| ~ member(X3,X4)
| ~ lower_bound(X2,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
lower_bound(esk6_0,esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk8_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk8_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_13,negated_conjecture,
~ apply(esk1_0,esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( apply(esk1_0,esk6_0,X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ greatest_lower_bound(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
greatest_lower_bound(esk5_0,esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
~ member(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
member(esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET800+4 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n011.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 23:19:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.018 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 23
% 0.22/1.41 # Proof object clause steps : 14
% 0.22/1.41 # Proof object formula steps : 9
% 0.22/1.41 # Proof object conjectures : 13
% 0.22/1.41 # Proof object clause conjectures : 10
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 8
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 6
% 0.22/1.41 # Proof object simplifying inferences : 2
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 22
% 0.22/1.41 # Removed by relevancy pruning/SinE : 17
% 0.22/1.41 # Initial clauses : 84
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 84
% 0.22/1.41 # Processed clauses : 94
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 94
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 64
% 0.22/1.41 # ...of the previous two non-trivial : 61
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 64
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 94
% 0.22/1.41 # Positive orientable unit clauses : 12
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 80
% 0.22/1.41 # Current number of unprocessed clauses: 51
% 0.22/1.41 # ...number of literals in the above : 376
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 1501
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 585
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 326
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 5
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 6481
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.022 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.026 s
% 0.22/1.41 # Maximum resident set size: 3172 pages
%------------------------------------------------------------------------------