%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:13 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 57 ( 33 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 46 ( 14 ~; 21 |; 9 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 3 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(property_1_of_ordered_pair,conjecture,
! [X1,X2] :
( unordered_pair(singleton(X1),unordered_pair(X1,null_class)) = ordered_pair(X1,X2)
| member(X2,universal_class) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',property_1_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/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(c_0_5,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])])])])]) ).
fof(c_0_6,plain,
! [X4] :
( ( member(esk6_1(X4),universal_class)
| X4 = null_class )
& ( member(esk6_1(X4),X4)
| X4 = null_class )
& ( disjoint(esk6_1(X4),X4)
| X4 = null_class ) ),
inference(distribute,[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)],[regularity])])])])])]) ).
cnf(c_0_7,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( unordered_pair(singleton(X1),unordered_pair(X1,null_class)) = ordered_pair(X1,X2)
| member(X2,universal_class) ),
inference(assume_negation,[status(cth)],[property_1_of_ordered_pair]) ).
fof(c_0_10,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_11,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_12,plain,
( esk6_1(unordered_pair(X1,X2)) = X2
| esk6_1(unordered_pair(X1,X2)) = X1
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_13,negated_conjecture,
( unordered_pair(singleton(esk8_0),unordered_pair(esk8_0,null_class)) != ordered_pair(esk8_0,esk9_0)
& ~ member(esk9_0,universal_class) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = null_class
| member(esk6_1(X1),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( esk6_1(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(singleton(esk8_0),unordered_pair(esk8_0,null_class)) != ordered_pair(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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_14,c_0_15]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ member(esk9_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,null_class)) != 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_18,c_0_15]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
unordered_pair(esk9_0,esk9_0) = null_class,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n012.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jul 10 16:59:28 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.015 s
% 0.21/1.39
% 0.21/1.39 # Failure: Out of unprocessed clauses!
% 0.21/1.39 # OLD status GaveUp
% 0.21/1.39 # Parsed axioms : 44
% 0.21/1.39 # Removed by relevancy pruning/SinE : 37
% 0.21/1.39 # Initial clauses : 13
% 0.21/1.39 # Removed in clause preprocessing : 2
% 0.21/1.39 # Initial clauses in saturation : 11
% 0.21/1.39 # Processed clauses : 13
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 0
% 0.21/1.39 # ...remaining for further processing : 13
% 0.21/1.39 # Other redundant clauses eliminated : 2
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 0
% 0.21/1.39 # Generated clauses : 6
% 0.21/1.39 # ...of the previous two non-trivial : 2
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 4
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 2
% 0.21/1.39 # Current number of processed clauses : 11
% 0.21/1.39 # Positive orientable unit clauses : 1
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 3
% 0.21/1.39 # Non-unit-clauses : 7
% 0.21/1.39 # Current number of unprocessed clauses: 0
% 0.21/1.39 # ...number of literals in the above : 0
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 2
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 4
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 4
% 0.21/1.39 # Non-unit clause-clause subsumptions : 0
% 0.21/1.39 # Unit Clause-clause subsumption calls : 0
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 0
% 0.21/1.39 # BW rewrite match successes : 0
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 1162
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.014 s
% 0.21/1.39 # System time : 0.002 s
% 0.21/1.39 # Total time : 0.016 s
% 0.21/1.39 # Maximum resident set size: 2768 pages
% 0.21/1.39 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.39 # Preprocessing time : 0.020 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 25
% 0.21/1.39 # Proof object clause steps : 14
% 0.21/1.39 # Proof object formula steps : 11
% 0.21/1.39 # Proof object conjectures : 8
% 0.21/1.39 # Proof object clause conjectures : 5
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 7
% 0.21/1.39 # Proof object initial formulas used : 5
% 0.21/1.39 # Proof object generating inferences : 4
% 0.21/1.39 # Proof object simplifying inferences : 7
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 44
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 91
% 0.21/1.39 # Removed in clause preprocessing : 8
% 0.21/1.39 # Initial clauses in saturation : 83
% 0.21/1.39 # Processed clauses : 842
% 0.21/1.39 # ...of these trivial : 3
% 0.21/1.39 # ...subsumed : 446
% 0.21/1.39 # ...remaining for further processing : 393
% 0.21/1.39 # Other redundant clauses eliminated : 15
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 11
% 0.21/1.39 # Backward-rewritten : 37
% 0.21/1.39 # Generated clauses : 4257
% 0.21/1.39 # ...of the previous two non-trivial : 3677
% 0.21/1.39 # Contextual simplify-reflections : 134
% 0.21/1.39 # Paramodulations : 4222
% 0.21/1.39 # Factorizations : 18
% 0.21/1.39 # Equation resolutions : 17
% 0.21/1.39 # Current number of processed clauses : 341
% 0.21/1.39 # Positive orientable unit clauses : 39
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 2
% 0.21/1.39 # Non-unit-clauses : 300
% 0.21/1.39 # Current number of unprocessed clauses: 2608
% 0.21/1.39 # ...number of literals in the above : 8355
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 56
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 23936
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 13326
% 0.21/1.39 # Non-unit clause-clause subsumptions : 278
% 0.21/1.39 # Unit Clause-clause subsumption calls : 1017
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 39
% 0.21/1.39 # BW rewrite match successes : 10
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 73678
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.117 s
% 0.21/1.39 # System time : 0.006 s
% 0.21/1.39 # Total time : 0.123 s
% 0.21/1.39 # Maximum resident set size: 7068 pages
% 0.21/23.39 eprover: CPU time limit exceeded, terminating
% 0.21/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.40 eprover: No such file or directory
% 0.21/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.41 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------