%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM590+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:09 EDT 2022
% Result : Theorem 0.27s 5.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 62 ( 7 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 68 ( 21 ~; 18 |; 23 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 15 ( 1 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3671) ).
fof(m__4448_02,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(xY)
& ! [X1] :
( aElementOf0(X1,xY)
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4448_02) ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,xY)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(m__4448,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__4448) ).
fof(c_0_4,hypothesis,
! [X3,X4] :
( ( aSet0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])])])]) ).
fof(c_0_5,hypothesis,
! [X2,X3,X3] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aSet0(xY)
& ( aElement0(X3)
| ~ aElementOf0(X3,xY) )
& ( aElementOf0(X3,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,xY) )
& ( X3 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,xY) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,sdtlpdtrp0(xN,xi))
| X3 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X3,xY) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4448_02])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xY)
=> aElementOf0(X1,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,hypothesis,
( aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X1,xY) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4448]) ).
fof(c_0_10,negated_conjecture,
( aElementOf0(esk15_0,xY)
& ~ aElementOf0(esk15_0,szNzAzT0)
& ~ aSubsetOf0(xY,szNzAzT0) ),
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_6])])])])]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xY) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
aElementOf0(esk15_0,xY),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(esk15_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : NUM590+3 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n024.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 : Wed Jul 6 14:22:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.27/5.45 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.27/5.45 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.27/5.45 # Preprocessing time : 0.018 s
% 0.27/5.45
% 0.27/5.45 # Failure: Out of unprocessed clauses!
% 0.27/5.45 # OLD status GaveUp
% 0.27/5.45 # Parsed axioms : 92
% 0.27/5.45 # Removed by relevancy pruning/SinE : 86
% 0.27/5.45 # Initial clauses : 11
% 0.27/5.45 # Removed in clause preprocessing : 1
% 0.27/5.45 # Initial clauses in saturation : 10
% 0.27/5.45 # Processed clauses : 10
% 0.27/5.45 # ...of these trivial : 0
% 0.27/5.45 # ...subsumed : 0
% 0.27/5.45 # ...remaining for further processing : 10
% 0.27/5.45 # Other redundant clauses eliminated : 0
% 0.27/5.45 # Clauses deleted for lack of memory : 0
% 0.27/5.45 # Backward-subsumed : 0
% 0.27/5.45 # Backward-rewritten : 0
% 0.27/5.45 # Generated clauses : 0
% 0.27/5.45 # ...of the previous two non-trivial : 0
% 0.27/5.45 # Contextual simplify-reflections : 3
% 0.27/5.45 # Paramodulations : 0
% 0.27/5.45 # Factorizations : 0
% 0.27/5.45 # Equation resolutions : 0
% 0.27/5.45 # Current number of processed clauses : 10
% 0.27/5.45 # Positive orientable unit clauses : 1
% 0.27/5.45 # Positive unorientable unit clauses: 0
% 0.27/5.45 # Negative unit clauses : 2
% 0.27/5.45 # Non-unit-clauses : 7
% 0.27/5.45 # Current number of unprocessed clauses: 0
% 0.27/5.45 # ...number of literals in the above : 0
% 0.27/5.45 # Current number of archived formulas : 0
% 0.27/5.45 # Current number of archived clauses : 0
% 0.27/5.45 # Clause-clause subsumption calls (NU) : 27
% 0.27/5.45 # Rec. Clause-clause subsumption calls : 10
% 0.27/5.45 # Non-unit clause-clause subsumptions : 3
% 0.27/5.45 # Unit Clause-clause subsumption calls : 0
% 0.27/5.45 # Rewrite failures with RHS unbound : 0
% 0.27/5.45 # BW rewrite match attempts : 0
% 0.27/5.45 # BW rewrite match successes : 0
% 0.27/5.45 # Condensation attempts : 0
% 0.27/5.45 # Condensation successes : 0
% 0.27/5.45 # Termbank termtop insertions : 3089
% 0.27/5.45
% 0.27/5.45 # -------------------------------------------------
% 0.27/5.45 # User time : 0.015 s
% 0.27/5.45 # System time : 0.004 s
% 0.27/5.45 # Total time : 0.019 s
% 0.27/5.45 # Maximum resident set size: 2908 pages
% 0.27/5.45 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.27/5.45 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.27/5.45 # Preprocessing time : 0.311 s
% 0.27/5.45
% 0.27/5.45 # Proof found!
% 0.27/5.45 # SZS status Theorem
% 0.27/5.45 # SZS output start CNFRefutation
% See solution above
% 0.27/5.45 # Proof object total steps : 15
% 0.27/5.45 # Proof object clause steps : 7
% 0.27/5.45 # Proof object formula steps : 8
% 0.27/5.45 # Proof object conjectures : 6
% 0.27/5.45 # Proof object clause conjectures : 3
% 0.27/5.45 # Proof object formula conjectures : 3
% 0.27/5.45 # Proof object initial clauses used : 5
% 0.27/5.45 # Proof object initial formulas used : 4
% 0.27/5.45 # Proof object generating inferences : 2
% 0.27/5.45 # Proof object simplifying inferences : 3
% 0.27/5.45 # Training examples: 0 positive, 0 negative
% 0.27/5.45 # Parsed axioms : 92
% 0.27/5.45 # Removed by relevancy pruning/SinE : 16
% 0.27/5.45 # Initial clauses : 4782
% 0.27/5.45 # Removed in clause preprocessing : 7
% 0.27/5.45 # Initial clauses in saturation : 4775
% 0.27/5.45 # Processed clauses : 4787
% 0.27/5.45 # ...of these trivial : 0
% 0.27/5.45 # ...subsumed : 278
% 0.27/5.45 # ...remaining for further processing : 4509
% 0.27/5.45 # Other redundant clauses eliminated : 4411
% 0.27/5.45 # Clauses deleted for lack of memory : 0
% 0.27/5.45 # Backward-subsumed : 2
% 0.27/5.45 # Backward-rewritten : 0
% 0.27/5.45 # Generated clauses : 55645
% 0.27/5.45 # ...of the previous two non-trivial : 46665
% 0.27/5.45 # Contextual simplify-reflections : 623
% 0.27/5.45 # Paramodulations : 51042
% 0.27/5.45 # Factorizations : 0
% 0.27/5.45 # Equation resolutions : 4597
% 0.27/5.45 # Current number of processed clauses : 4503
% 0.27/5.45 # Positive orientable unit clauses : 29
% 0.27/5.45 # Positive unorientable unit clauses: 0
% 0.27/5.45 # Negative unit clauses : 6
% 0.27/5.45 # Non-unit-clauses : 4468
% 0.27/5.45 # Current number of unprocessed clauses: 46629
% 0.27/5.45 # ...number of literals in the above : 759999
% 0.27/5.45 # Current number of archived formulas : 0
% 0.27/5.45 # Current number of archived clauses : 2
% 0.27/5.45 # Clause-clause subsumption calls (NU) : 4342271
% 0.27/5.45 # Rec. Clause-clause subsumption calls : 49745
% 0.27/5.45 # Non-unit clause-clause subsumptions : 901
% 0.27/5.45 # Unit Clause-clause subsumption calls : 15812
% 0.27/5.45 # Rewrite failures with RHS unbound : 0
% 0.27/5.45 # BW rewrite match attempts : 0
% 0.27/5.45 # BW rewrite match successes : 0
% 0.27/5.45 # Condensation attempts : 0
% 0.27/5.45 # Condensation successes : 0
% 0.27/5.45 # Termbank termtop insertions : 3245728
% 0.27/5.45
% 0.27/5.45 # -------------------------------------------------
% 0.27/5.45 # User time : 4.573 s
% 0.27/5.45 # System time : 0.059 s
% 0.27/5.45 # Total time : 4.632 s
% 0.27/5.45 # Maximum resident set size: 85372 pages
%------------------------------------------------------------------------------