TSTP Solution File: SET101+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET101+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:49:11 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 36 ( 14 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 29 ( 13 ~; 11 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 7 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(singleton_member_of_ordered_pair,conjecture,
! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',singleton_member_of_ordered_pair) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[singleton_member_of_ordered_pair]) ).
fof(c_0_6,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
fof(c_0_7,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_8,negated_conjecture,
~ member(singleton(esk8_0),ordered_pair(esk8_0,esk9_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 != X5
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ member(singleton(esk8_0),ordered_pair(esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,unordered_pair(X2,X3))
| ~ member(X1,universal_class)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X3,X4] : member(unordered_pair(X3,X4),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
cnf(c_0_16,negated_conjecture,
~ member(unordered_pair(esk8_0,esk8_0),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
cnf(c_0_17,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET101+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 07:07:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.015 s
% 0.24/1.43
% 0.24/1.43 # Failure: Out of unprocessed clauses!
% 0.24/1.43 # OLD status GaveUp
% 0.24/1.43 # Parsed axioms : 44
% 0.24/1.43 # Removed by relevancy pruning/SinE : 42
% 0.24/1.43 # Initial clauses : 4
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 4
% 0.24/1.43 # Processed clauses : 4
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 4
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 2
% 0.24/1.43 # ...of the previous two non-trivial : 0
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 2
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 4
% 0.24/1.43 # Positive orientable unit clauses : 0
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 1
% 0.24/1.43 # Non-unit-clauses : 3
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 0
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 2
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 2
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 0
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 0
% 0.24/1.43 # BW rewrite match successes : 0
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 740
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.012 s
% 0.24/1.43 # System time : 0.003 s
% 0.24/1.43 # Total time : 0.015 s
% 0.24/1.43 # Maximum resident set size: 2744 pages
% 0.24/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.43 # Preprocessing time : 0.025 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 20
% 0.24/1.43 # Proof object clause steps : 9
% 0.24/1.43 # Proof object formula steps : 11
% 0.24/1.43 # Proof object conjectures : 6
% 0.24/1.43 # Proof object clause conjectures : 3
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 5
% 0.24/1.43 # Proof object initial formulas used : 5
% 0.24/1.43 # Proof object generating inferences : 1
% 0.24/1.43 # Proof object simplifying inferences : 7
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 44
% 0.24/1.43 # Removed by relevancy pruning/SinE : 0
% 0.24/1.43 # Initial clauses : 90
% 0.24/1.43 # Removed in clause preprocessing : 8
% 0.24/1.43 # Initial clauses in saturation : 82
% 0.24/1.43 # Processed clauses : 90
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 90
% 0.24/1.43 # Other redundant clauses eliminated : 5
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 2
% 0.24/1.43 # Generated clauses : 219
% 0.24/1.43 # ...of the previous two non-trivial : 194
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 212
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 7
% 0.24/1.43 # Current number of processed clauses : 84
% 0.24/1.43 # Positive orientable unit clauses : 14
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 2
% 0.24/1.43 # Non-unit-clauses : 68
% 0.24/1.43 # Current number of unprocessed clauses: 181
% 0.24/1.43 # ...number of literals in the above : 492
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 10
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 697
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 634
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 130
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 16
% 0.24/1.43 # BW rewrite match successes : 2
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 10608
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.031 s
% 0.24/1.43 # System time : 0.003 s
% 0.24/1.43 # Total time : 0.034 s
% 0.24/1.43 # Maximum resident set size: 3892 pages
%------------------------------------------------------------------------------