TSTP Solution File: SET065+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:48:37 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 13 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 5 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(inductive_defn,axiom,
! [X1] :
( inductive(X1)
<=> ( member(null_class,X1)
& subclass(image(successor_relation,X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',inductive_defn) ).
fof(infinity,axiom,
? [X1] :
( member(X1,universal_class)
& inductive(X1)
& ! [X2] :
( inductive(X2)
=> subclass(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',infinity) ).
fof(null_class_is_a_set,conjecture,
member(null_class,universal_class),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',null_class_is_a_set) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subclass(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subclass(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subclass(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)],[subclass_defn])])])])])])]) ).
fof(c_0_6,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
fof(c_0_7,plain,
! [X2,X2] :
( ( member(null_class,X2)
| ~ inductive(X2) )
& ( subclass(image(successor_relation,X2),X2)
| ~ inductive(X2) )
& ( ~ member(null_class,X2)
| ~ subclass(image(successor_relation,X2),X2)
| inductive(X2) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inductive_defn])])])])]) ).
fof(c_0_8,plain,
! [X4] :
( member(esk2_0,universal_class)
& inductive(esk2_0)
& ( ~ inductive(X4)
| subclass(esk2_0,X4) ) ),
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)],[infinity])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ member(null_class,universal_class),
inference(assume_negation,[status(cth)],[null_class_is_a_set]) ).
cnf(c_0_10,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
inductive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
~ member(null_class,universal_class),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
member(null_class,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ member(null_class,universal_class),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$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 : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.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 : Mon Jul 11 00:01:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.015 s
% 0.24/1.42
% 0.24/1.42 # Failure: Out of unprocessed clauses!
% 0.24/1.42 # OLD status GaveUp
% 0.24/1.42 # Parsed axioms : 44
% 0.24/1.42 # Removed by relevancy pruning/SinE : 42
% 0.24/1.42 # Initial clauses : 2
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 2
% 0.24/1.42 # Processed clauses : 2
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 2
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 0
% 0.24/1.42 # ...of the previous two non-trivial : 0
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 0
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 2
% 0.24/1.42 # Positive orientable unit clauses : 0
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 0
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 525
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.000 s
% 0.24/1.42 # Total time : 0.015 s
% 0.24/1.42 # Maximum resident set size: 2716 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 19
% 0.24/1.42 # Proof object clause steps : 8
% 0.24/1.42 # Proof object formula steps : 11
% 0.24/1.42 # Proof object conjectures : 4
% 0.24/1.42 # Proof object clause conjectures : 1
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 5
% 0.24/1.42 # Proof object generating inferences : 3
% 0.24/1.42 # Proof object simplifying inferences : 1
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 44
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 90
% 0.24/1.42 # Removed in clause preprocessing : 8
% 0.24/1.42 # Initial clauses in saturation : 82
% 0.24/1.42 # Processed clauses : 90
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 89
% 0.24/1.42 # Other redundant clauses eliminated : 5
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 4
% 0.24/1.42 # Backward-rewritten : 1
% 0.24/1.42 # Generated clauses : 235
% 0.24/1.42 # ...of the previous two non-trivial : 206
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 228
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 7
% 0.24/1.42 # Current number of processed clauses : 80
% 0.24/1.42 # Positive orientable unit clauses : 15
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 2
% 0.24/1.42 # Non-unit-clauses : 63
% 0.24/1.42 # Current number of unprocessed clauses: 168
% 0.24/1.42 # ...number of literals in the above : 464
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 13
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 671
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 605
% 0.24/1.42 # Non-unit clause-clause subsumptions : 4
% 0.24/1.42 # Unit Clause-clause subsumption calls : 131
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 10616
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.024 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.028 s
% 0.24/1.42 # Maximum resident set size: 3364 pages
%------------------------------------------------------------------------------