TSTP Solution File: SEU267+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU267+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:27 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 58 ( 57 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 70 ( 30 ~; 28 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 18 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_first(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_mcart_1) ).
fof(d2_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_second(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X4 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_mcart_1) ).
fof(t7_mcart_1,conjecture,
! [X1,X2] :
( pair_first(ordered_pair(X1,X2)) = X1
& pair_second(ordered_pair(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_mcart_1) ).
fof(c_0_3,plain,
! [X5,X6,X7,X8,X9,X10,X8] :
( ( X8 != pair_first(X5)
| X5 != ordered_pair(X9,X10)
| X8 = X9
| X5 != ordered_pair(X6,X7) )
& ( X5 = ordered_pair(esk7_2(X5,X8),esk8_2(X5,X8))
| X8 = pair_first(X5)
| X5 != ordered_pair(X6,X7) )
& ( X8 != esk7_2(X5,X8)
| X8 = pair_first(X5)
| X5 != ordered_pair(X6,X7) ) ),
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_mcart_1])])])])])])]) ).
cnf(c_0_4,plain,
( X4 = X5
| X1 != ordered_pair(X2,X3)
| X1 != ordered_pair(X5,X6)
| X4 != pair_first(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X9,X10,X8] :
( ( X8 != pair_second(X5)
| X5 != ordered_pair(X9,X10)
| X8 = X10
| X5 != ordered_pair(X6,X7) )
& ( X5 = ordered_pair(esk5_2(X5,X8),esk6_2(X5,X8))
| X8 = pair_second(X5)
| X5 != ordered_pair(X6,X7) )
& ( X8 != esk6_2(X5,X8)
| X8 = pair_second(X5)
| X5 != ordered_pair(X6,X7) ) ),
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_mcart_1])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( pair_first(ordered_pair(X1,X2)) = X1
& pair_second(ordered_pair(X1,X2)) = X2 ),
inference(assume_negation,[status(cth)],[t7_mcart_1]) ).
cnf(c_0_7,plain,
( X1 = X2
| ordered_pair(X2,X3) != ordered_pair(X4,X5)
| X1 != pair_first(ordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( X4 = X5
| X1 != ordered_pair(X2,X3)
| X1 != ordered_pair(X6,X5)
| X4 != pair_second(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0
| pair_second(ordered_pair(esk3_0,esk4_0)) != esk4_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,plain,
( pair_first(ordered_pair(X1,X2)) = X1
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| ordered_pair(X3,X2) != ordered_pair(X4,X5)
| X1 != pair_second(ordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( pair_second(ordered_pair(esk3_0,esk4_0)) != esk4_0
| pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
pair_first(ordered_pair(X1,X2)) = X1,
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( pair_second(ordered_pair(X1,X2)) = X2
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
pair_second(ordered_pair(esk3_0,esk4_0)) != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,plain,
pair_second(ordered_pair(X1,X2)) = X2,
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU267+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 10:16:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 18
% 0.23/1.41 # Proof object clause steps : 11
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 6
% 0.23/1.41 # Proof object clause conjectures : 3
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 3
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 6
% 0.23/1.41 # Proof object simplifying inferences : 4
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 19
% 0.23/1.41 # Removed by relevancy pruning/SinE : 12
% 0.23/1.41 # Initial clauses : 11
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 11
% 0.23/1.41 # Processed clauses : 27
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 5
% 0.23/1.41 # ...remaining for further processing : 22
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 8
% 0.23/1.41 # Generated clauses : 49
% 0.23/1.41 # ...of the previous two non-trivial : 51
% 0.23/1.41 # Contextual simplify-reflections : 2
% 0.23/1.41 # Paramodulations : 41
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 8
% 0.23/1.41 # Current number of processed clauses : 14
% 0.23/1.41 # Positive orientable unit clauses : 3
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 9
% 0.23/1.41 # Current number of unprocessed clauses: 7
% 0.23/1.41 # ...number of literals in the above : 25
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 8
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 13
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 13
% 0.23/1.41 # Non-unit clause-clause subsumptions : 4
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 6
% 0.23/1.41 # BW rewrite match successes : 6
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1155
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.014 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.017 s
% 0.23/1.41 # Maximum resident set size: 2672 pages
%------------------------------------------------------------------------------