TSTP Solution File: NUM578+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM578+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:00 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 47 ( 15 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 53 ( 21 ~; 15 |; 8 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3856_02,hypothesis,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3856_02) ).
fof(m__3856,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3856) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X1),X2)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& szmzizndt0(sdtlpdtrp0(xN,X2)) != szmzizndt0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( xi != xj
=> szmzizndt0(sdtlpdtrp0(xN,xi)) != szmzizndt0(sdtlpdtrp0(xN,xj)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
( xi = xj
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[m__3856_02]) ).
fof(c_0_5,negated_conjecture,
! [X3,X4] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) )
& ( szmzizndt0(sdtlpdtrp0(xN,X4)) != szmzizndt0(sdtlpdtrp0(xN,X3))
| ~ sdtlseqdt0(szszuzczcdt0(X3),X4)
| ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0) )
& xi != xj
& szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)) ),
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)],[c_0_3])])])])])]) ).
cnf(c_0_6,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),xj)
| sdtlseqdt0(szszuzczcdt0(xj),xi)
| xi = xj ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),X1)
| szmzizndt0(sdtlpdtrp0(xN,X1)) != szmzizndt0(sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
szmzizndt0(sdtlpdtrp0(xN,xi)) = szmzizndt0(sdtlpdtrp0(xN,xj)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_13,negated_conjecture,
sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(cn,[status(thm)],[inference(rw,[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])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_10]),c_0_12]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM578+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 09:08:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.026 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 15
% 0.26/1.44 # Proof object clause steps : 9
% 0.26/1.44 # Proof object formula steps : 6
% 0.26/1.44 # Proof object conjectures : 8
% 0.26/1.44 # Proof object clause conjectures : 5
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 6
% 0.26/1.44 # Proof object initial formulas used : 3
% 0.26/1.44 # Proof object generating inferences : 2
% 0.26/1.44 # Proof object simplifying inferences : 9
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 86
% 0.26/1.44 # Removed by relevancy pruning/SinE : 5
% 0.26/1.44 # Initial clauses : 156
% 0.26/1.44 # Removed in clause preprocessing : 7
% 0.26/1.44 # Initial clauses in saturation : 149
% 0.26/1.44 # Processed clauses : 150
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 1
% 0.26/1.44 # ...remaining for further processing : 149
% 0.26/1.44 # Other redundant clauses eliminated : 11
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 1
% 0.26/1.44 # Generated clauses : 472
% 0.26/1.44 # ...of the previous two non-trivial : 427
% 0.26/1.44 # Contextual simplify-reflections : 21
% 0.26/1.44 # Paramodulations : 444
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 28
% 0.26/1.44 # Current number of processed clauses : 145
% 0.26/1.44 # Positive orientable unit clauses : 22
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 2
% 0.26/1.44 # Non-unit-clauses : 121
% 0.26/1.44 # Current number of unprocessed clauses: 420
% 0.26/1.44 # ...number of literals in the above : 2119
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 1
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 5061
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 709
% 0.26/1.44 # Non-unit clause-clause subsumptions : 21
% 0.26/1.44 # Unit Clause-clause subsumption calls : 25
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 1
% 0.26/1.44 # BW rewrite match successes : 1
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 19381
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.048 s
% 0.26/1.44 # System time : 0.003 s
% 0.26/1.44 # Total time : 0.051 s
% 0.26/1.44 # Maximum resident set size: 4204 pages
%------------------------------------------------------------------------------