%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM603+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:18 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 49 ( 18 ~; 15 |; 11 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3754) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mZeroLess) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3623) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mZeroNum) ).
fof(m__5034,hypothesis,
( aElementOf0(xi,szNzAzT0)
& sdtlpdtrp0(xe,xi) = xx ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5034) ).
fof(c_0_6,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,hypothesis,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(X4,X3)
| aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])]) ).
fof(c_0_8,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| sdtlseqdt0(sz00,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])]) ).
fof(c_0_9,hypothesis,
! [X2] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,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__3623])])])])])]) ).
fof(c_0_10,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_15,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM603+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n009.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 : Tue Jul 5 17:12:52 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.025 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 : 19
% 0.23/1.41 # Proof object clause steps : 8
% 0.23/1.41 # Proof object formula steps : 11
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 6
% 0.23/1.41 # Proof object initial formulas used : 6
% 0.23/1.41 # Proof object generating inferences : 2
% 0.23/1.41 # Proof object simplifying inferences : 5
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 100
% 0.23/1.41 # Removed by relevancy pruning/SinE : 2
% 0.23/1.41 # Initial clauses : 194
% 0.23/1.41 # Removed in clause preprocessing : 7
% 0.23/1.41 # Initial clauses in saturation : 187
% 0.23/1.41 # Processed clauses : 223
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 7
% 0.23/1.41 # ...remaining for further processing : 215
% 0.23/1.41 # Other redundant clauses eliminated : 11
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 1
% 0.23/1.41 # Generated clauses : 695
% 0.23/1.41 # ...of the previous two non-trivial : 639
% 0.23/1.41 # Contextual simplify-reflections : 22
% 0.23/1.41 # Paramodulations : 663
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 32
% 0.23/1.41 # Current number of processed clauses : 211
% 0.23/1.41 # Positive orientable unit clauses : 47
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 12
% 0.23/1.41 # Non-unit-clauses : 152
% 0.23/1.41 # Current number of unprocessed clauses: 603
% 0.23/1.41 # ...number of literals in the above : 3140
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 1
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 5266
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 1133
% 0.23/1.41 # Non-unit clause-clause subsumptions : 22
% 0.23/1.41 # Unit Clause-clause subsumption calls : 991
% 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 : 26426
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.052 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.056 s
% 0.23/1.41 # Maximum resident set size: 4596 pages
%------------------------------------------------------------------------------