TSTP Solution File: NUM630+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM630+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:36 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 38 ( 15 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 33 ( 11 ~; 8 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__4151,hypothesis,
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aFunction0(sdtlpdtrp0(xC,X1))
& szDzozmdt0(sdtlpdtrp0(xC,X1)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)
& ! [X2] :
( ( aSet0(X2)
& aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4151) ).
fof(m__5585,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5585) ).
fof(m__5599,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5599) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5309) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5164) ).
fof(c_0_6,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,hypothesis,
! [X3,X4] :
( aFunction0(xC)
& szDzozmdt0(xC) = szNzAzT0
& ( aFunction0(sdtlpdtrp0(xC,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( szDzozmdt0(sdtlpdtrp0(xC,X3)) = slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk)
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aSet0(X4)
| ~ aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))
| sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4) = sdtlpdtrp0(xc,sdtpldt0(X4,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__4151])])])])])]) ).
cnf(c_0_9,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1))))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[m__5585]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[m__5599]) ).
cnf(c_0_13,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_14,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM630+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n008.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jul 6 10:09:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.026 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 16
% 0.25/1.43 # Proof object clause steps : 7
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 6
% 0.25/1.43 # Proof object initial formulas used : 6
% 0.25/1.43 # Proof object generating inferences : 1
% 0.25/1.43 # Proof object simplifying inferences : 5
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 116
% 0.25/1.43 # Removed by relevancy pruning/SinE : 15
% 0.25/1.43 # Initial clauses : 182
% 0.25/1.43 # Removed in clause preprocessing : 6
% 0.25/1.43 # Initial clauses in saturation : 176
% 0.25/1.43 # Processed clauses : 93
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 1
% 0.25/1.43 # ...remaining for further processing : 91
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 109
% 0.25/1.43 # ...of the previous two non-trivial : 87
% 0.25/1.43 # Contextual simplify-reflections : 4
% 0.25/1.43 # Paramodulations : 108
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 1
% 0.25/1.43 # Current number of processed clauses : 91
% 0.25/1.43 # Positive orientable unit clauses : 50
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 3
% 0.25/1.43 # Non-unit-clauses : 38
% 0.25/1.43 # Current number of unprocessed clauses: 170
% 0.25/1.43 # ...number of literals in the above : 588
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 289
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 247
% 0.25/1.43 # Non-unit clause-clause subsumptions : 4
% 0.25/1.43 # Unit Clause-clause subsumption calls : 2
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 12813
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.026 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.030 s
% 0.25/1.43 # Maximum resident set size: 3764 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
% 0.25/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------