TSTP Solution File: NUM618+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM618+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:27 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 2 unt; 0 def)
% Number of atoms : 28 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 12 ~; 8 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 3 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& xx = sdtlpdtrp0(xe,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__4982,hypothesis,
! [X1] :
( aElementOf0(X1,xO)
=> ? [X2] :
( aElementOf0(X2,szNzAzT0)
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X2) = X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4982) ).
fof(m__5365,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(xx,xO) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5365) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& xx = sdtlpdtrp0(xe,X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| xx != sdtlpdtrp0(xe,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,hypothesis,
! [X3] :
( ( aElementOf0(esk6_1(X3),szNzAzT0)
| ~ aElementOf0(X3,xO) )
& ( aElementOf0(esk6_1(X3),sdtlbdtrb0(xd,szDzizrdt0(xd)))
| ~ aElementOf0(X3,xO) )
& ( sdtlpdtrp0(xe,esk6_1(X3)) = X3
| ~ aElementOf0(X3,xO) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( xx != sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
( sdtlpdtrp0(xe,esk6_1(X1)) = X1
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( aElementOf0(esk6_1(X1),szNzAzT0)
| ~ aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( X1 != xx
| ~ aElementOf0(X1,xO) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xx,xO),
inference(split_conjunct,[status(thm)],[m__5365]) ).
cnf(c_0_11,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM618+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 14:21:43 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.026 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 12
% 0.26/1.43 # Proof object clause steps : 6
% 0.26/1.43 # Proof object formula steps : 6
% 0.26/1.43 # Proof object conjectures : 5
% 0.26/1.43 # Proof object clause conjectures : 2
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 4
% 0.26/1.43 # Proof object initial formulas used : 3
% 0.26/1.43 # Proof object generating inferences : 2
% 0.26/1.43 # Proof object simplifying inferences : 1
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 115
% 0.26/1.43 # Removed by relevancy pruning/SinE : 14
% 0.26/1.43 # Initial clauses : 184
% 0.26/1.43 # Removed in clause preprocessing : 6
% 0.26/1.43 # Initial clauses in saturation : 178
% 0.26/1.43 # Processed clauses : 396
% 0.26/1.43 # ...of these trivial : 7
% 0.26/1.43 # ...subsumed : 72
% 0.26/1.43 # ...remaining for further processing : 317
% 0.26/1.43 # Other redundant clauses eliminated : 10
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 2
% 0.26/1.43 # Backward-rewritten : 13
% 0.26/1.43 # Generated clauses : 883
% 0.26/1.43 # ...of the previous two non-trivial : 821
% 0.26/1.43 # Contextual simplify-reflections : 21
% 0.26/1.43 # Paramodulations : 855
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 28
% 0.26/1.43 # Current number of processed clauses : 300
% 0.26/1.43 # Positive orientable unit clauses : 88
% 0.26/1.43 # Positive unorientable unit clauses: 0
% 0.26/1.43 # Negative unit clauses : 26
% 0.26/1.43 # Non-unit-clauses : 186
% 0.26/1.43 # Current number of unprocessed clauses: 598
% 0.26/1.43 # ...number of literals in the above : 3035
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 15
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 4736
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 1593
% 0.26/1.43 # Non-unit clause-clause subsumptions : 35
% 0.26/1.43 # Unit Clause-clause subsumption calls : 1550
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 6
% 0.26/1.43 # BW rewrite match successes : 6
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 26415
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.053 s
% 0.26/1.43 # System time : 0.010 s
% 0.26/1.43 # Total time : 0.063 s
% 0.26/1.43 # Maximum resident set size: 4824 pages
%------------------------------------------------------------------------------