TSTP Solution File: SEU229+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU229+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:04 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 7 unt; 0 def)
% Number of atoms : 113 ( 54 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 136 ( 56 ~; 59 |; 19 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 99 ( 23 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_enumset1,axiom,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X1
& X5 != X2
& X5 != X3 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_enumset1) ).
fof(t7_tarski,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& in(X4,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_tarski) ).
fof(t3_ordinal1,conjecture,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_ordinal1) ).
fof(c_0_3,plain,
! [X6,X7,X8,X9,X10,X10,X6,X7,X8,X9] :
( ( ~ in(X10,X9)
| X10 = X6
| X10 = X7
| X10 = X8
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X6
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X7
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( X10 != X8
| in(X10,X9)
| X9 != unordered_triple(X6,X7,X8) )
& ( esk1_4(X6,X7,X8,X9) != X6
| ~ in(esk1_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( esk1_4(X6,X7,X8,X9) != X7
| ~ in(esk1_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( esk1_4(X6,X7,X8,X9) != X8
| ~ in(esk1_4(X6,X7,X8,X9),X9)
| X9 = unordered_triple(X6,X7,X8) )
& ( in(esk1_4(X6,X7,X8,X9),X9)
| esk1_4(X6,X7,X8,X9) = X6
| esk1_4(X6,X7,X8,X9) = X7
| esk1_4(X6,X7,X8,X9) = X8
| X9 = unordered_triple(X6,X7,X8) ) ),
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_enumset1])])])])])])]) ).
cnf(c_0_4,plain,
( X5 = X4
| X5 = X3
| X5 = X2
| X1 != unordered_triple(X2,X3,X4)
| ~ in(X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X5,X6,X8] :
( ( in(esk15_2(X5,X6),X6)
| ~ in(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,esk15_2(X5,X6))
| ~ in(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)],[t7_tarski])])])])])])]) ).
cnf(c_0_6,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( X1 = X2
| X3 = X2
| X4 = X2
| ~ in(X2,unordered_triple(X4,X3,X1)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(esk15_2(X1,X2),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| X2 != unordered_triple(X3,X4,X1) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( esk15_2(X1,unordered_triple(X2,X3,X4)) = X2
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X4
| ~ in(X1,unordered_triple(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ in(X1,X2)
| ~ in(X3,esk15_2(X1,X2))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( esk15_2(X1,unordered_triple(X2,X3,X1)) = X1
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
inference(assume_negation,[status(cth)],[t3_ordinal1]) ).
cnf(c_0_15,plain,
( esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X1
| ~ in(X4,unordered_triple(X2,X3,X1))
| ~ in(X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
fof(c_0_16,negated_conjecture,
( in(esk12_0,esk13_0)
& in(esk13_0,esk14_0)
& in(esk14_0,esk12_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_17,plain,
( esk15_2(X1,unordered_triple(X2,X3,X1)) = X1
| esk15_2(X1,unordered_triple(X2,X3,X1)) = X3
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
in(esk14_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk12_0,X1,esk14_0)) = esk14_0
| esk15_2(esk14_0,unordered_triple(esk12_0,X1,esk14_0)) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| X2 != unordered_triple(X1,X3,X4) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk12_0,X1,esk14_0)) = esk14_0
| ~ in(X2,unordered_triple(esk12_0,X1,esk14_0))
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_11])]) ).
cnf(c_0_23,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( in(X5,X1)
| X1 != unordered_triple(X2,X3,X4)
| X5 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk12_0,X1,esk14_0)) = esk14_0
| ~ in(esk12_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| X2 != unordered_triple(X3,X1,X4) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(X1,unordered_triple(esk12_0,X2,esk14_0))
| ~ in(X1,esk14_0)
| ~ in(esk12_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_25]),c_0_11])]) ).
cnf(c_0_28,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(X1,esk14_0)
| ~ in(esk12_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU229+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 03:12:44 EDT 2022
% 0.13/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.014 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 28
% 0.23/1.41 # Removed by relevancy pruning/SinE : 18
% 0.23/1.41 # Initial clauses : 15
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 15
% 0.23/1.41 # Processed clauses : 29
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 2
% 0.23/1.41 # ...remaining for further processing : 27
% 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 : 3
% 0.23/1.41 # Generated clauses : 12
% 0.23/1.41 # ...of the previous two non-trivial : 14
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 12
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 24
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 8
% 0.23/1.41 # Non-unit-clauses : 9
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 3
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 23
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 19
% 0.23/1.41 # Non-unit clause-clause subsumptions : 2
% 0.23/1.41 # Unit Clause-clause subsumption calls : 41
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 853
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.012 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2676 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 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 : 33
% 0.23/1.41 # Proof object clause steps : 26
% 0.23/1.41 # Proof object formula steps : 7
% 0.23/1.41 # Proof object conjectures : 12
% 0.23/1.41 # Proof object clause conjectures : 9
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 14
% 0.23/1.41 # Proof object simplifying inferences : 11
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 28
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 53
% 0.23/1.41 # Removed in clause preprocessing : 5
% 0.23/1.41 # Initial clauses in saturation : 48
% 0.23/1.41 # Processed clauses : 1992
% 0.23/1.41 # ...of these trivial : 16
% 0.23/1.41 # ...subsumed : 1392
% 0.23/1.41 # ...remaining for further processing : 584
% 0.23/1.41 # Other redundant clauses eliminated : 667
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 8
% 0.23/1.41 # Backward-rewritten : 10
% 0.23/1.41 # Generated clauses : 10986
% 0.23/1.41 # ...of the previous two non-trivial : 10013
% 0.23/1.41 # Contextual simplify-reflections : 434
% 0.23/1.41 # Paramodulations : 9848
% 0.23/1.41 # Factorizations : 467
% 0.23/1.41 # Equation resolutions : 671
% 0.23/1.41 # Current number of processed clauses : 563
% 0.23/1.41 # Positive orientable unit clauses : 38
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 80
% 0.23/1.41 # Non-unit-clauses : 445
% 0.23/1.41 # Current number of unprocessed clauses: 7591
% 0.23/1.41 # ...number of literals in the above : 37810
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 18
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 84142
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 43057
% 0.23/1.41 # Non-unit clause-clause subsumptions : 814
% 0.23/1.41 # Unit Clause-clause subsumption calls : 5055
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 26
% 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 : 245124
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.248 s
% 0.23/1.41 # System time : 0.007 s
% 0.23/1.41 # Total time : 0.255 s
% 0.23/1.41 # Maximum resident set size: 11356 pages
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53 eprover: No such file or directory
%------------------------------------------------------------------------------