TSTP Solution File: SET063+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET063+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:33 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 39 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 38 ( 16 ~; 11 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 6 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(corollary_of_null_class_is_subclass,conjecture,
! [X1] :
( subclass(X1,null_class)
=> X1 = null_class ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',corollary_of_null_class_is_subclass) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
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(c_0_4,negated_conjecture,
~ ! [X1] :
( subclass(X1,null_class)
=> X1 = null_class ),
inference(assume_negation,[status(cth)],[corollary_of_null_class_is_subclass]) ).
fof(c_0_5,plain,
! [X3,X4,X3,X4] :
( ( subclass(X3,X4)
| X3 != X4 )
& ( subclass(X4,X3)
| X3 != X4 )
& ( ~ subclass(X3,X4)
| ~ subclass(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])]) ).
fof(c_0_6,negated_conjecture,
( subclass(esk1_0,null_class)
& esk1_0 != null_class ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X2] : ~ member(X2,null_class),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[null_class_defn])]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subclass(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk2_2(X4,X5),X4)
| subclass(X4,X5) )
& ( ~ member(esk2_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])])])])])])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
subclass(esk1_0,null_class),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( subclass(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ subclass(null_class,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET063+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.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 : 600
% 0.12/0.33 % DateTime : Sat Jul 9 19:39:07 EDT 2022
% 0.12/0.33 % 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.015 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.41 # Proof object total steps : 17
% 0.23/1.41 # Proof object clause steps : 8
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 5
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 2
% 0.23/1.41 # Proof object simplifying inferences : 3
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 44
% 0.23/1.41 # Removed by relevancy pruning/SinE : 39
% 0.23/1.41 # Initial clauses : 10
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 10
% 0.23/1.41 # Processed clauses : 17
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 16
% 0.23/1.41 # Other redundant clauses eliminated : 2
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 14
% 0.23/1.41 # ...of the previous two non-trivial : 11
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 12
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 2
% 0.23/1.41 # Current number of processed clauses : 12
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 5
% 0.23/1.41 # Current number of unprocessed clauses: 4
% 0.23/1.41 # ...number of literals in the above : 7
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 1
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 8
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 982
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------