%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU255+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:18:20 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 110 ( 14 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 123 ( 48 ~; 56 |; 9 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X2),X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_wellord1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_wellord1) ).
fof(t25_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t25_wellord1) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ( ~ antisymmetric(X4)
| ~ in(ordered_pair(X5,X6),X4)
| ~ in(ordered_pair(X6,X5),X4)
| X5 = X6
| ~ relation(X4) )
& ( in(ordered_pair(esk2_1(X4),esk3_1(X4)),X4)
| antisymmetric(X4)
| ~ relation(X4) )
& ( in(ordered_pair(esk3_1(X4),esk2_1(X4)),X4)
| antisymmetric(X4)
| ~ relation(X4) )
& ( esk2_1(X4) != esk3_1(X4)
| antisymmetric(X4)
| ~ relation(X4) ) ),
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)],[l3_wellord1])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_8,plain,
( antisymmetric(X1)
| in(ordered_pair(esk2_1(X1),esk3_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_11,plain,
( antisymmetric(X1)
| in(ordered_pair(esk3_1(X1),esk2_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( X2 = X3
| ~ relation(X1)
| ~ in(ordered_pair(X3,X2),X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ( in(X4,X6)
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( in(X4,cartesian_product2(X5,X5))
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( ~ in(X4,X6)
| ~ in(X4,cartesian_product2(X5,X5))
| in(X4,relation_restriction(X6,X5))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).
cnf(c_0_14,plain,
( antisymmetric(X1)
| in(unordered_pair(unordered_pair(esk2_1(X1),esk3_1(X1)),singleton(esk2_1(X1))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])])]) ).
cnf(c_0_17,plain,
( antisymmetric(X1)
| in(unordered_pair(unordered_pair(esk3_1(X1),esk2_1(X1)),singleton(esk3_1(X1))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_18,plain,
( X2 = X3
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),X1)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9]),c_0_9]) ).
cnf(c_0_19,plain,
( in(X2,X1)
| ~ relation(X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( antisymmetric(X1)
| in(unordered_pair(singleton(esk2_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( antisymmetric(X1)
| in(unordered_pair(singleton(esk3_1(X1)),unordered_pair(esk2_1(X1),esk3_1(X1))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_15]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t25_wellord1]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ antisymmetric(X3)
| ~ relation(X3)
| ~ in(unordered_pair(singleton(X2),unordered_pair(X2,X1)),X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_25,plain,
( antisymmetric(relation_restriction(X1,X2))
| in(unordered_pair(singleton(esk2_1(relation_restriction(X1,X2))),unordered_pair(esk2_1(relation_restriction(X1,X2)),esk3_1(relation_restriction(X1,X2)))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
( antisymmetric(relation_restriction(X1,X2))
| in(unordered_pair(singleton(esk3_1(relation_restriction(X1,X2))),unordered_pair(esk2_1(relation_restriction(X1,X2)),esk3_1(relation_restriction(X1,X2)))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_21]) ).
fof(c_0_27,negated_conjecture,
( relation(esk10_0)
& antisymmetric(esk10_0)
& ~ antisymmetric(relation_restriction(esk10_0,esk9_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_28,plain,
( antisymmetric(X1)
| ~ relation(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,plain,
( esk3_1(relation_restriction(X1,X2)) = esk2_1(relation_restriction(X1,X2))
| antisymmetric(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_15]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ antisymmetric(relation_restriction(esk10_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
( antisymmetric(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]) ).
cnf(c_0_32,negated_conjecture,
antisymmetric(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU255+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n006.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 : Sun Jun 19 05:58:10 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.016 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 : 33
% 0.24/1.42 # Removed by relevancy pruning/SinE : 24
% 0.24/1.42 # Initial clauses : 14
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 14
% 0.24/1.42 # Processed clauses : 20
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 19
% 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 : 8
% 0.24/1.42 # ...of the previous two non-trivial : 6
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 8
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 19
% 0.24/1.42 # Positive orientable unit clauses : 3
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 3
% 0.24/1.42 # Non-unit-clauses : 13
% 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) : 30
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 25
% 0.24/1.42 # Non-unit clause-clause subsumptions : 1
% 0.24/1.42 # Unit Clause-clause subsumption calls : 0
% 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 : 1036
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.017 s
% 0.24/1.42 # Maximum resident set size: 2696 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.018 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 : 35
% 0.24/1.42 # Proof object clause steps : 22
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 7
% 0.24/1.42 # Proof object clause conjectures : 4
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 11
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 16
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 33
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 47
% 0.24/1.42 # Removed in clause preprocessing : 10
% 0.24/1.42 # Initial clauses in saturation : 37
% 0.24/1.42 # Processed clauses : 752
% 0.24/1.42 # ...of these trivial : 2
% 0.24/1.42 # ...subsumed : 573
% 0.24/1.42 # ...remaining for further processing : 177
% 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 : 21
% 0.24/1.42 # Backward-rewritten : 5
% 0.24/1.42 # Generated clauses : 2562
% 0.24/1.42 # ...of the previous two non-trivial : 1992
% 0.24/1.42 # Contextual simplify-reflections : 1825
% 0.24/1.42 # Paramodulations : 2562
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 151
% 0.24/1.42 # Positive orientable unit clauses : 18
% 0.24/1.42 # Positive unorientable unit clauses: 2
% 0.24/1.42 # Negative unit clauses : 8
% 0.24/1.42 # Non-unit-clauses : 123
% 0.24/1.42 # Current number of unprocessed clauses: 1138
% 0.24/1.42 # ...number of literals in the above : 8019
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 27
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 82145
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 13440
% 0.24/1.42 # Non-unit clause-clause subsumptions : 2237
% 0.24/1.42 # Unit Clause-clause subsumption calls : 57
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 12
% 0.24/1.42 # BW rewrite match successes : 11
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 54818
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.138 s
% 0.24/1.42 # System time : 0.009 s
% 0.24/1.42 # Total time : 0.147 s
% 0.24/1.42 # Maximum resident set size: 4508 pages
% 0.26/24.22 eprover: CPU time limit exceeded, terminating
% 0.26/24.23 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.23 eprover: No such file or directory
% 0.26/24.23 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.23 eprover: No such file or directory
% 0.26/24.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.24 eprover: No such file or directory
% 0.26/24.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.24 eprover: No such file or directory
% 0.26/24.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.24 eprover: No such file or directory
% 0.26/24.25 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.25 eprover: No such file or directory
% 0.26/24.25 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.25 eprover: No such file or directory
% 0.26/24.25 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/24.25 eprover: No such file or directory
%------------------------------------------------------------------------------