TSTP Solution File: SEU151+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 67 ( 49 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 80 ( 34 ~; 33 |; 11 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 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 : 48 ( 9 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(t10_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_zfmisc_1) ).
fof(c_0_2,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_3,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]) ).
cnf(c_0_4,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = unordered_pair(esk6_0,esk7_0)
& esk4_0 != esk6_0
& esk4_0 != esk7_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[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_2]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
unordered_pair(esk4_0,esk5_0) = unordered_pair(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X3,X1)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( in(esk7_0,X1)
| X1 != unordered_pair(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk7_0
| X2 = esk7_0
| unordered_pair(X1,X2) != unordered_pair(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk4_0 != esk7_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( esk6_0 = X1
| esk7_0 = X1
| ~ in(X1,unordered_pair(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
esk5_0 = esk7_0,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| X2 != unordered_pair(X1,X3) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( esk7_0 = X1
| esk6_0 = X1
| ~ in(X1,unordered_pair(esk4_0,esk7_0)) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
esk4_0 != esk6_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.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 22:23:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.013 s
% 0.24/1.41
% 0.24/1.41 # Failure: Out of unprocessed clauses!
% 0.24/1.41 # OLD status GaveUp
% 0.24/1.41 # Parsed axioms : 6
% 0.24/1.41 # Removed by relevancy pruning/SinE : 4
% 0.24/1.41 # Initial clauses : 4
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 4
% 0.24/1.41 # Processed clauses : 4
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 4
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 0
% 0.24/1.41 # ...of the previous two non-trivial : 0
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 0
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 4
% 0.24/1.41 # Positive orientable unit clauses : 1
% 0.24/1.41 # Positive unorientable unit clauses: 1
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 0
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 167
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.010 s
% 0.24/1.41 # System time : 0.004 s
% 0.24/1.41 # Total time : 0.014 s
% 0.24/1.41 # Maximum resident set size: 2764 pages
% 0.24/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.014 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 21
% 0.24/1.41 # Proof object clause steps : 16
% 0.24/1.41 # Proof object formula steps : 5
% 0.24/1.41 # Proof object conjectures : 12
% 0.24/1.41 # Proof object clause conjectures : 9
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 6
% 0.24/1.41 # Proof object initial formulas used : 2
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 6
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 6
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 13
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 13
% 0.24/1.41 # Processed clauses : 56
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 16
% 0.24/1.41 # ...remaining for further processing : 40
% 0.24/1.41 # Other redundant clauses eliminated : 2
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 10
% 0.24/1.41 # Generated clauses : 68
% 0.24/1.41 # ...of the previous two non-trivial : 70
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 61
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 7
% 0.24/1.41 # Current number of processed clauses : 28
% 0.24/1.41 # Positive orientable unit clauses : 5
% 0.24/1.41 # Positive unorientable unit clauses: 1
% 0.24/1.41 # Negative unit clauses : 8
% 0.24/1.41 # Non-unit-clauses : 14
% 0.24/1.41 # Current number of unprocessed clauses: 20
% 0.24/1.41 # ...number of literals in the above : 65
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 10
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 83
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 72
% 0.24/1.41 # Non-unit clause-clause subsumptions : 9
% 0.24/1.41 # Unit Clause-clause subsumption calls : 31
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 10
% 0.24/1.41 # BW rewrite match successes : 5
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1188
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.013 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.016 s
% 0.24/1.41 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------