%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.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 09:17:36 EDT 2022
% Result : Theorem 0.18s 1.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 67 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 63 ( 29 ~; 22 |; 5 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 5 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t56_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t56_relat_1]) ).
fof(c_0_8,negated_conjecture,
! [X5,X6] :
( relation(esk9_0)
& ~ in(ordered_pair(X5,X6),esk9_0)
& esk9_0 != empty_set ),
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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_10,plain,
! [X5,X6,X5,X10,X11] :
( ( ~ relation(X5)
| ~ in(X6,X5)
| X6 = ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)) )
& ( in(esk3_1(X5),X5)
| relation(X5) )
& ( esk3_1(X5) != ordered_pair(X10,X11)
| relation(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)],[d1_relat_1])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ in(ordered_pair(X1,X2),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_14,plain,
( X1 = ordered_pair(esk1_2(X2,X1),esk2_2(X2,X1))
| ~ in(X1,X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( X1 = unordered_pair(unordered_pair(esk1_2(X2,X1),esk2_2(X2,X1)),singleton(esk1_2(X2,X1)))
| ~ relation(X2)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_19,plain,
! [X3] : element(esk4_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_20,negated_conjecture,
~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ relation(X1)
| ~ in(X2,esk9_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( empty(X1)
| in(esk4_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_27,negated_conjecture,
( empty(esk9_0)
| ~ relation(X1)
| ~ in(esk4_1(esk9_0),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
relation(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
empty(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
esk9_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.10 % Command : run_ET %s %d
% 0.09/0.30 % Computer : n021.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jun 19 15:14:17 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.18/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.36 # Preprocessing time : 0.014 s
% 0.18/1.36
% 0.18/1.36 # Failure: Out of unprocessed clauses!
% 0.18/1.36 # OLD status GaveUp
% 0.18/1.36 # Parsed axioms : 26
% 0.18/1.36 # Removed by relevancy pruning/SinE : 12
% 0.18/1.36 # Initial clauses : 21
% 0.18/1.36 # Removed in clause preprocessing : 0
% 0.18/1.36 # Initial clauses in saturation : 21
% 0.18/1.36 # Processed clauses : 34
% 0.18/1.36 # ...of these trivial : 1
% 0.18/1.36 # ...subsumed : 3
% 0.18/1.36 # ...remaining for further processing : 30
% 0.18/1.36 # Other redundant clauses eliminated : 0
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 0
% 0.18/1.36 # Backward-rewritten : 7
% 0.18/1.36 # Generated clauses : 15
% 0.18/1.36 # ...of the previous two non-trivial : 16
% 0.18/1.36 # Contextual simplify-reflections : 0
% 0.18/1.36 # Paramodulations : 15
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 0
% 0.18/1.36 # Current number of processed clauses : 23
% 0.18/1.36 # Positive orientable unit clauses : 6
% 0.18/1.36 # Positive unorientable unit clauses: 0
% 0.18/1.36 # Negative unit clauses : 5
% 0.18/1.36 # Non-unit-clauses : 12
% 0.18/1.36 # Current number of unprocessed clauses: 0
% 0.18/1.36 # ...number of literals in the above : 0
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 7
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 31
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 26
% 0.18/1.36 # Non-unit clause-clause subsumptions : 3
% 0.18/1.36 # Unit Clause-clause subsumption calls : 6
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 2
% 0.18/1.36 # BW rewrite match successes : 2
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 1047
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.014 s
% 0.18/1.36 # System time : 0.000 s
% 0.18/1.36 # Total time : 0.014 s
% 0.18/1.36 # Maximum resident set size: 2784 pages
% 0.18/1.36 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.18/1.36 # Preprocessing time : 0.014 s
% 0.18/1.36
% 0.18/1.36 # Proof found!
% 0.18/1.36 # SZS status Theorem
% 0.18/1.36 # SZS output start CNFRefutation
% See solution above
% 0.18/1.36 # Proof object total steps : 33
% 0.18/1.36 # Proof object clause steps : 18
% 0.18/1.36 # Proof object formula steps : 15
% 0.18/1.36 # Proof object conjectures : 12
% 0.18/1.36 # Proof object clause conjectures : 9
% 0.18/1.36 # Proof object formula conjectures : 3
% 0.18/1.36 # Proof object initial clauses used : 9
% 0.18/1.36 # Proof object initial formulas used : 7
% 0.18/1.36 # Proof object generating inferences : 6
% 0.18/1.36 # Proof object simplifying inferences : 6
% 0.18/1.36 # Training examples: 0 positive, 0 negative
% 0.18/1.36 # Parsed axioms : 26
% 0.18/1.36 # Removed by relevancy pruning/SinE : 0
% 0.18/1.36 # Initial clauses : 33
% 0.18/1.36 # Removed in clause preprocessing : 6
% 0.18/1.36 # Initial clauses in saturation : 27
% 0.18/1.36 # Processed clauses : 61
% 0.18/1.36 # ...of these trivial : 1
% 0.18/1.36 # ...subsumed : 19
% 0.18/1.36 # ...remaining for further processing : 41
% 0.18/1.36 # Other redundant clauses eliminated : 0
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 0
% 0.18/1.36 # Backward-rewritten : 4
% 0.18/1.36 # Generated clauses : 60
% 0.18/1.36 # ...of the previous two non-trivial : 53
% 0.18/1.36 # Contextual simplify-reflections : 0
% 0.18/1.36 # Paramodulations : 60
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 0
% 0.18/1.36 # Current number of processed clauses : 37
% 0.18/1.36 # Positive orientable unit clauses : 8
% 0.18/1.36 # Positive unorientable unit clauses: 1
% 0.18/1.36 # Negative unit clauses : 9
% 0.18/1.36 # Non-unit-clauses : 19
% 0.18/1.36 # Current number of unprocessed clauses: 17
% 0.18/1.36 # ...number of literals in the above : 46
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 5
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 37
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 33
% 0.18/1.36 # Non-unit clause-clause subsumptions : 3
% 0.18/1.36 # Unit Clause-clause subsumption calls : 13
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 11
% 0.18/1.36 # BW rewrite match successes : 11
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 1738
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.015 s
% 0.18/1.36 # System time : 0.001 s
% 0.18/1.36 # Total time : 0.016 s
% 0.18/1.36 # Maximum resident set size: 2892 pages
%------------------------------------------------------------------------------