TSTP Solution File: NUM604+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM604+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:19 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 35 ( 6 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 31 ( 10 ~; 7 |; 11 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__5045,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5045) ).
fof(m__4660,hypothesis,
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4660) ).
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_4,negated_conjecture,
~ aElementOf0(xx,xS),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
! [X2] :
( ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| aElementOf0(X2,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
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__5045])])])])]) ).
fof(c_0_6,hypothesis,
! [X3,X4] :
( aFunction0(xe)
& szDzozmdt0(xe) = szNzAzT0
& ( aElementOf0(sdtlpdtrp0(xe,X3),sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| sdtlseqdt0(sdtlpdtrp0(xe,X3),X4)
| ~ aElementOf0(X3,szNzAzT0) )
& ( sdtlpdtrp0(xe,X3) = szmzizndt0(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__4660])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ aElementOf0(xx,xS),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM604+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n028.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 : Wed Jul 6 19:39:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.305 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 14
% 0.23/1.42 # Proof object clause steps : 6
% 0.23/1.42 # Proof object formula steps : 8
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 5
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 1
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 101
% 0.23/1.42 # Removed by relevancy pruning/SinE : 9
% 0.23/1.42 # Initial clauses : 4856
% 0.23/1.42 # Removed in clause preprocessing : 7
% 0.23/1.42 # Initial clauses in saturation : 4849
% 0.23/1.42 # Processed clauses : 110
% 0.23/1.42 # ...of these trivial : 2
% 0.23/1.42 # ...subsumed : 2
% 0.23/1.42 # ...remaining for further processing : 106
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 139
% 0.23/1.42 # ...of the previous two non-trivial : 112
% 0.23/1.42 # Contextual simplify-reflections : 2
% 0.23/1.42 # Paramodulations : 138
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 1
% 0.23/1.42 # Current number of processed clauses : 106
% 0.23/1.42 # Positive orientable unit clauses : 38
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 66
% 0.23/1.42 # Current number of unprocessed clauses: 4851
% 0.23/1.42 # ...number of literals in the above : 55916
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 640
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 493
% 0.23/1.42 # Non-unit clause-clause subsumptions : 3
% 0.23/1.42 # Unit Clause-clause subsumption calls : 53
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 378231
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.295 s
% 0.23/1.42 # System time : 0.015 s
% 0.23/1.42 # Total time : 0.310 s
% 0.23/1.42 # Maximum resident set size: 21424 pages
%------------------------------------------------------------------------------