%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Mon Jul 18 09:34:08 EDT 2022
% Result : Theorem 0.20s 1.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 116 ( 11 equ)
% Maximal formula atoms : 44 ( 12 avg)
% Number of connectives : 134 ( 27 ~; 22 |; 61 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 9 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X4)
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& X4 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X3) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X3] :
( aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X3)
& aElementOf0(X3,sdtlpdtrp0(xN,X1))
& X3 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(X2) )
=> ! [X3] :
( ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,X2) )
& aSubsetOf0(X3,X2)
& sbrdtbr0(X3) = xk
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X4] :
( aElementOf0(X4,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X4) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X4] :
( aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X4)
& aElementOf0(X4,sdtlpdtrp0(xN,X1))
& X4 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( ! [X4] :
( aElementOf0(X4,X3)
=> aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
| aSubsetOf0(X3,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
| aElementOf0(X3,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X8,X9,X11,X12,X13,X13] :
( aElementOf0(esk1_0,szNzAzT0)
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk1_0))
& ( ~ aElementOf0(X7,sdtlpdtrp0(xN,esk1_0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),X7) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
& ( aElement0(X8)
| ~ aElementOf0(X8,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( aElementOf0(X8,sdtlpdtrp0(xN,esk1_0))
| ~ aElementOf0(X8,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( X8 != szmzizndt0(sdtlpdtrp0(xN,esk1_0))
| ~ aElementOf0(X8,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( ~ aElement0(X8)
| ~ aElementOf0(X8,sdtlpdtrp0(xN,esk1_0))
| X8 = szmzizndt0(sdtlpdtrp0(xN,esk1_0))
| aElementOf0(X8,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& aSet0(esk2_0)
& ( ~ aElementOf0(X9,esk2_0)
| aElementOf0(X9,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& aSubsetOf0(esk2_0,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
& isCountable0(esk2_0)
& aSet0(esk3_0)
& ( ~ aElementOf0(X11,esk3_0)
| aElementOf0(X11,esk2_0) )
& aSubsetOf0(esk3_0,esk2_0)
& sbrdtbr0(esk3_0) = xk
& aElementOf0(esk3_0,slbdtsldtrb0(esk2_0,xk))
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),sdtlpdtrp0(xN,esk1_0))
& ( ~ aElementOf0(X12,sdtlpdtrp0(xN,esk1_0))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,esk1_0)),X12) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
& ( aElement0(X13)
| ~ aElementOf0(X13,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( aElementOf0(X13,sdtlpdtrp0(xN,esk1_0))
| ~ aElementOf0(X13,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( X13 != szmzizndt0(sdtlpdtrp0(xN,esk1_0))
| ~ aElementOf0(X13,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& ( ~ aElement0(X13)
| ~ aElementOf0(X13,sdtlpdtrp0(xN,esk1_0))
| X13 = szmzizndt0(sdtlpdtrp0(xN,esk1_0))
| aElementOf0(X13,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))) )
& aElementOf0(esk4_0,esk3_0)
& ~ aElementOf0(esk4_0,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
& ~ aSubsetOf0(esk3_0,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
& ~ aElementOf0(esk3_0,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))),xk)) ),
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)],[c_0_1])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( aElementOf0(X1,esk2_0)
| ~ aElementOf0(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
aElementOf0(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0))))
| ~ aElementOf0(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
aElementOf0(esk4_0,esk2_0),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ aElementOf0(esk4_0,sdtmndt0(sdtlpdtrp0(xN,esk1_0),szmzizndt0(sdtlpdtrp0(xN,esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Wed Jul 6 21:21:04 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.20/1.38 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.20/1.38 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.20/1.38 # Preprocessing time : 0.030 s
% 0.20/1.38
% 0.20/1.38 # Proof found!
% 0.20/1.38 # SZS status Theorem
% 0.20/1.38 # SZS output start CNFRefutation
% See solution above
% 0.20/1.38 # Proof object total steps : 9
% 0.20/1.38 # Proof object clause steps : 6
% 0.20/1.38 # Proof object formula steps : 3
% 0.20/1.38 # Proof object conjectures : 9
% 0.20/1.38 # Proof object clause conjectures : 6
% 0.20/1.38 # Proof object formula conjectures : 3
% 0.20/1.38 # Proof object initial clauses used : 4
% 0.20/1.38 # Proof object initial formulas used : 1
% 0.20/1.38 # Proof object generating inferences : 2
% 0.20/1.38 # Proof object simplifying inferences : 1
% 0.20/1.38 # Training examples: 0 positive, 0 negative
% 0.20/1.38 # Parsed axioms : 88
% 0.20/1.38 # Removed by relevancy pruning/SinE : 25
% 0.20/1.38 # Initial clauses : 297
% 0.20/1.38 # Removed in clause preprocessing : 5
% 0.20/1.38 # Initial clauses in saturation : 292
% 0.20/1.38 # Processed clauses : 320
% 0.20/1.38 # ...of these trivial : 2
% 0.20/1.38 # ...subsumed : 51
% 0.20/1.38 # ...remaining for further processing : 267
% 0.20/1.38 # Other redundant clauses eliminated : 2
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 4
% 0.20/1.38 # Backward-rewritten : 14
% 0.20/1.38 # Generated clauses : 473
% 0.20/1.38 # ...of the previous two non-trivial : 476
% 0.20/1.38 # Contextual simplify-reflections : 154
% 0.20/1.38 # Paramodulations : 459
% 0.20/1.38 # Factorizations : 0
% 0.20/1.38 # Equation resolutions : 14
% 0.20/1.38 # Current number of processed clauses : 247
% 0.20/1.38 # Positive orientable unit clauses : 29
% 0.20/1.38 # Positive unorientable unit clauses: 0
% 0.20/1.38 # Negative unit clauses : 17
% 0.20/1.38 # Non-unit-clauses : 201
% 0.20/1.38 # Current number of unprocessed clauses: 234
% 0.20/1.38 # ...number of literals in the above : 666
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 18
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 14696
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 1651
% 0.20/1.38 # Non-unit clause-clause subsumptions : 203
% 0.20/1.38 # Unit Clause-clause subsumption calls : 2350
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 2
% 0.20/1.38 # BW rewrite match successes : 2
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 33459
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.059 s
% 0.20/1.38 # System time : 0.005 s
% 0.20/1.38 # Total time : 0.064 s
% 0.20/1.38 # Maximum resident set size: 4512 pages
% 0.20/23.38 eprover: CPU time limit exceeded, terminating
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.20/23.45 eprover: No such file or directory
%------------------------------------------------------------------------------