TSTP Solution File: SEU151+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:12 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 54 ( 41 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 68 ( 29 ~; 26 |; 11 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 37 ( 8 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
inference(assume_negation,[status(cth)],[t10_zfmisc_1]) ).
fof(c_0_3,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk1_3(X5,X6,X7) != X5
| ~ in(esk1_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk1_3(X5,X6,X7) != X6
| ~ in(esk1_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk1_3(X5,X6,X7),X7)
| esk1_3(X5,X6,X7) = X5
| esk1_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
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)],[d2_tarski])])])])])])]) ).
fof(c_0_4,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk2_0 != esk4_0
& esk2_0 != esk5_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| X2 != unordered_pair(X1,X3) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( esk5_0 = X1
| esk4_0 = X1
| X2 != unordered_pair(esk2_0,esk3_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( esk4_0 = X1
| esk5_0 = X1
| unordered_pair(X1,X2) != unordered_pair(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 != esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.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 Jun 18 23:29:07 EDT 2022
% 0.12/0.33 % 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.013 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 : 5
% 0.21/1.39 # Removed by relevancy pruning/SinE : 3
% 0.21/1.39 # Initial clauses : 4
% 0.21/1.39 # Removed in clause preprocessing : 0
% 0.21/1.39 # Initial clauses in saturation : 4
% 0.21/1.39 # Processed clauses : 4
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 0
% 0.21/1.39 # ...remaining for further processing : 4
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 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 : 0
% 0.21/1.39 # ...of the previous two non-trivial : 0
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 0
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 4
% 0.21/1.39 # Positive orientable unit clauses : 1
% 0.21/1.39 # Positive unorientable unit clauses: 1
% 0.21/1.39 # Negative unit clauses : 2
% 0.21/1.39 # Non-unit-clauses : 0
% 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 : 0
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 0
% 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 : 162
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.011 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.014 s
% 0.21/1.39 # Maximum resident set size: 2764 pages
% 0.21/1.39 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.39 # Preprocessing time : 0.014 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 : 15
% 0.21/1.39 # Proof object clause steps : 10
% 0.21/1.39 # Proof object formula steps : 5
% 0.21/1.39 # Proof object conjectures : 9
% 0.21/1.39 # Proof object clause conjectures : 6
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 5
% 0.21/1.39 # Proof object initial formulas used : 2
% 0.21/1.39 # Proof object generating inferences : 4
% 0.21/1.39 # Proof object simplifying inferences : 3
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 5
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 12
% 0.21/1.39 # Removed in clause preprocessing : 1
% 0.21/1.39 # Initial clauses in saturation : 11
% 0.21/1.39 # Processed clauses : 24
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 2
% 0.21/1.39 # ...remaining for further processing : 22
% 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 : 34
% 0.21/1.39 # ...of the previous two non-trivial : 29
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 28
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 6
% 0.21/1.39 # Current number of processed clauses : 20
% 0.21/1.39 # Positive orientable unit clauses : 2
% 0.21/1.39 # Positive unorientable unit clauses: 1
% 0.21/1.39 # Negative unit clauses : 4
% 0.21/1.39 # Non-unit-clauses : 13
% 0.21/1.39 # Current number of unprocessed clauses: 16
% 0.21/1.39 # ...number of literals in the above : 42
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 0
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 16
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 16
% 0.21/1.39 # Non-unit clause-clause subsumptions : 0
% 0.21/1.39 # Unit Clause-clause subsumption calls : 4
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 4
% 0.21/1.39 # BW rewrite match successes : 4
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 799
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.013 s
% 0.21/1.39 # System time : 0.002 s
% 0.21/1.39 # Total time : 0.015 s
% 0.21/1.39 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------