TSTP Solution File: NUM576+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM576+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:33:59 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 56 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 61 ( 26 ~; 24 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mLessTotal) ).
fof(m__,conjecture,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mLessASymm) ).
fof(m__3856,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3856) ).
fof(c_0_4,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| sdtlseqdt0(X3,X4)
| sdtlseqdt0(szszuzczcdt0(X4),X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])]) ).
fof(c_0_5,negated_conjecture,
~ ( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X4,szNzAzT0)
| ~ sdtlseqdt0(X3,X4)
| ~ sdtlseqdt0(X4,X3)
| X3 = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])]) ).
cnf(c_0_7,plain,
( sdtlseqdt0(szszuzczcdt0(X1),X2)
| sdtlseqdt0(X2,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
fof(c_0_9,negated_conjecture,
( xi != xj
& ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
& ~ sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
( sdtlseqdt0(szszuzczcdt0(X1),xi)
| sdtlseqdt0(xi,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( sdtlseqdt0(szszuzczcdt0(X1),xj)
| sdtlseqdt0(xj,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
( X1 = xi
| ~ sdtlseqdt0(xi,X1)
| ~ sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_17,hypothesis,
sdtlseqdt0(xi,xj),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
cnf(c_0_18,hypothesis,
sdtlseqdt0(xj,xi),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_10])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM576+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % 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 : Tue Jul 5 10:27:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 21
% 0.24/1.41 # Proof object clause steps : 13
% 0.24/1.41 # Proof object formula steps : 8
% 0.24/1.41 # Proof object conjectures : 6
% 0.24/1.41 # Proof object clause conjectures : 3
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 7
% 0.24/1.41 # Proof object initial formulas used : 4
% 0.24/1.41 # Proof object generating inferences : 6
% 0.24/1.41 # Proof object simplifying inferences : 6
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 85
% 0.24/1.41 # Removed by relevancy pruning/SinE : 74
% 0.24/1.41 # Initial clauses : 15
% 0.24/1.41 # Removed in clause preprocessing : 1
% 0.24/1.41 # Initial clauses in saturation : 14
% 0.24/1.41 # Processed clauses : 36
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 1
% 0.24/1.41 # ...remaining for further processing : 35
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 34
% 0.24/1.41 # ...of the previous two non-trivial : 29
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 34
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 35
% 0.24/1.41 # Positive orientable unit clauses : 10
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 6
% 0.24/1.41 # Non-unit-clauses : 19
% 0.24/1.41 # Current number of unprocessed clauses: 7
% 0.24/1.41 # ...number of literals in the above : 17
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 83
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 50
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 2965
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.015 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.018 s
% 0.24/1.41 # Maximum resident set size: 2864 pages
%------------------------------------------------------------------------------