TSTP Solution File: NUM621+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM621+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:30 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 17 unt; 0 def)
% Number of atoms : 108 ( 21 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 96 ( 29 ~; 25 |; 32 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5147,hypothesis,
( aElementOf0(xp,xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(xp,X1) )
& xp = szmzizndt0(xQ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5147) ).
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xn))
=> aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
& aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p',m__4660) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,szDzozmdt0(xd))
& sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5309) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',mLessASymm) ).
fof(m__5365,hypothesis,
( aElementOf0(xx,szNzAzT0)
& ? [X1] :
( aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,X1) = xx ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5365) ).
fof(m__5106,hypothesis,
( ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xQ,szNzAzT0) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5106) ).
fof(m__5389,hypothesis,
( aElementOf0(xm,szNzAzT0)
& xx = sdtlpdtrp0(xe,xm) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5389) ).
fof(m__5348,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& xx != szmzizndt0(xQ)
& aElementOf0(xx,xP) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__5348) ).
fof(c_0_9,hypothesis,
! [X2] :
( aElementOf0(xp,xQ)
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(xp,X2) )
& xp = szmzizndt0(xQ) ),
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__5147])])])])]) ).
fof(c_0_10,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xn))
=> aElementOf0(X1,sdtlpdtrp0(xN,xm)) )
& aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,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])])])])])]) ).
cnf(c_0_12,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_13,hypothesis,
xp = szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
! [X2] :
( ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xn))
| aElementOf0(X2,sdtlpdtrp0(xN,xm)) )
& aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
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_10])])])])]) ).
cnf(c_0_15,hypothesis,
( aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_17,hypothesis,
sdtlpdtrp0(xe,xn) = szmzizndt0(xQ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,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])]) ).
fof(c_0_19,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(esk2_0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xe,esk2_0) = xx ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__5365])])])]) ).
cnf(c_0_20,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xn)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aElementOf0(szmzizndt0(xQ),sdtlpdtrp0(xN,xn)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,hypothesis,
( sdtlseqdt0(xp,X1)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_23,hypothesis,
! [X2] :
( ( ~ aElementOf0(X2,xQ)
| aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(xQ,szNzAzT0) ),
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__5106])])])])]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( sdtlseqdt0(sdtlpdtrp0(xe,X1),X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
aElementOf0(szmzizndt0(xQ),sdtlpdtrp0(xN,xm)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,hypothesis,
xx = sdtlpdtrp0(xe,xm),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_31,hypothesis,
( sdtlseqdt0(szmzizndt0(xQ),X1)
| ~ aElementOf0(X1,xQ) ),
inference(rw,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xx,xQ),
inference(split_conjunct,[status(thm)],[m__5348]) ).
cnf(c_0_33,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,hypothesis,
aElementOf0(szmzizndt0(xQ),xQ),
inference(rw,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_35,hypothesis,
( X1 = xx
| ~ sdtlseqdt0(xx,X1)
| ~ sdtlseqdt0(X1,xx)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,hypothesis,
sdtlseqdt0(xx,szmzizndt0(xQ)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_37,hypothesis,
sdtlseqdt0(szmzizndt0(xQ),xx),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,hypothesis,
aElementOf0(szmzizndt0(xQ),szNzAzT0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
xx != szmzizndt0(xQ),
inference(split_conjunct,[status(thm)],[m__5348]) ).
cnf(c_0_40,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM621+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n013.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 : Tue Jul 5 06:48:59 EDT 2022
% 0.19/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.25/1.44 # Preprocessing time : 0.025 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 41
% 0.25/1.44 # Proof object clause steps : 25
% 0.25/1.44 # Proof object formula steps : 16
% 0.25/1.44 # Proof object conjectures : 5
% 0.25/1.44 # Proof object clause conjectures : 2
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 15
% 0.25/1.44 # Proof object initial formulas used : 9
% 0.25/1.44 # Proof object generating inferences : 7
% 0.25/1.44 # Proof object simplifying inferences : 11
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 118
% 0.25/1.44 # Removed by relevancy pruning/SinE : 70
% 0.25/1.44 # Initial clauses : 120
% 0.25/1.44 # Removed in clause preprocessing : 4
% 0.25/1.44 # Initial clauses in saturation : 116
% 0.25/1.44 # Processed clauses : 529
% 0.25/1.44 # ...of these trivial : 31
% 0.25/1.44 # ...subsumed : 65
% 0.25/1.44 # ...remaining for further processing : 433
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 74
% 0.25/1.44 # Generated clauses : 1206
% 0.25/1.44 # ...of the previous two non-trivial : 1098
% 0.25/1.44 # Contextual simplify-reflections : 9
% 0.25/1.44 # Paramodulations : 1184
% 0.25/1.44 # Factorizations : 2
% 0.25/1.44 # Equation resolutions : 20
% 0.25/1.44 # Current number of processed clauses : 359
% 0.25/1.44 # Positive orientable unit clauses : 129
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 20
% 0.25/1.44 # Non-unit-clauses : 210
% 0.25/1.44 # Current number of unprocessed clauses: 480
% 0.25/1.44 # ...number of literals in the above : 1341
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 74
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 6189
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 4128
% 0.25/1.44 # Non-unit clause-clause subsumptions : 69
% 0.25/1.44 # Unit Clause-clause subsumption calls : 1227
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 7
% 0.25/1.44 # BW rewrite match successes : 7
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 30355
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.063 s
% 0.25/1.44 # System time : 0.004 s
% 0.25/1.44 # Total time : 0.067 s
% 0.25/1.44 # Maximum resident set size: 4712 pages
% 0.25/23.43 eprover: CPU time limit exceeded, terminating
% 0.25/23.44 eprover: CPU time limit exceeded, terminating
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 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.mepo_128.in
% 0.25/23.49 eprover: eprover: No such file or directory
% 0.25/23.49 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------