TSTP Solution File: NUM561+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:49 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 84 ( 16 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 110 ( 48 ~; 48 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 31 ( 2 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSImg,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aSubsetOf0(X2,szDzozmdt0(X1))
=> ! [X3] :
( X3 = sdtlcdtrc0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5] :
( aElementOf0(X5,X2)
& sdtlpdtrp0(X1,X5) = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSImg) ).
fof(m__,conjecture,
aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDomSet) ).
fof(m__2911,hypothesis,
aFunction0(xF),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2911) ).
fof(m__2911_02,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2911_02) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSubRefl) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X9,X11,X8,X13] :
( ( aSet0(X8)
| X8 != sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( aElementOf0(esk1_4(X6,X7,X8,X9),X7)
| ~ aElementOf0(X9,X8)
| X8 != sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( sdtlpdtrp0(X6,esk1_4(X6,X7,X8,X9)) = X9
| ~ aElementOf0(X9,X8)
| X8 != sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( ~ aElementOf0(X11,X7)
| sdtlpdtrp0(X6,X11) != X9
| aElementOf0(X9,X8)
| X8 != sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( ~ aElementOf0(esk2_3(X6,X7,X8),X8)
| ~ aElementOf0(X13,X7)
| sdtlpdtrp0(X6,X13) != esk2_3(X6,X7,X8)
| ~ aSet0(X8)
| X8 = sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( aElementOf0(esk3_3(X6,X7,X8),X7)
| aElementOf0(esk2_3(X6,X7,X8),X8)
| ~ aSet0(X8)
| X8 = sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) )
& ( sdtlpdtrp0(X6,esk3_3(X6,X7,X8)) = esk2_3(X6,X7,X8)
| aElementOf0(esk2_3(X6,X7,X8),X8)
| ~ aSet0(X8)
| X8 = sdtlcdtrc0(X6,X7)
| ~ aSubsetOf0(X7,szDzozmdt0(X6))
| ~ aFunction0(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[mDefSImg])])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_8,plain,
( aElementOf0(X4,X3)
| ~ aFunction0(X1)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| X3 != sdtlcdtrc0(X1,X2)
| sdtlpdtrp0(X1,X5) != X4
| ~ aElementOf0(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( aElementOf0(X1,sdtlcdtrc0(X2,X3))
| sdtlpdtrp0(X2,X4) != X1
| ~ aFunction0(X2)
| ~ aSubsetOf0(X3,szDzozmdt0(X2))
| ~ aElementOf0(X4,X3) ),
inference(er,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X2] :
( ~ aFunction0(X2)
| aSet0(szDzozmdt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,X3))
| ~ aFunction0(X1)
| ~ aSubsetOf0(X3,szDzozmdt0(X1))
| ~ aElementOf0(X2,X3) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aFunction0(xF),
inference(split_conjunct,[status(thm)],[m__2911]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[m__2911_02]) ).
fof(c_0_16,plain,
! [X2] :
( ~ aSet0(X2)
| aSubsetOf0(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])]) ).
cnf(c_0_17,plain,
( aSet0(szDzozmdt0(X1))
| ~ aFunction0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
aSet0(szDzozmdt0(xF)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.13/0.31 % Computer : n016.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 600
% 0.13/0.31 % DateTime : Tue Jul 5 19:06:49 EDT 2022
% 0.13/0.31 % CPUTime :
% 0.21/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.39 # Preprocessing time : 0.017 s
% 0.21/1.39
% 0.21/1.39 # Proof found!
% 0.21/1.39 # SZS status Theorem
% 0.21/1.39 # SZS output start CNFRefutation
% See solution above
% 0.21/1.39 # Proof object total steps : 22
% 0.21/1.39 # Proof object clause steps : 11
% 0.21/1.39 # Proof object formula steps : 11
% 0.21/1.39 # Proof object conjectures : 6
% 0.21/1.39 # Proof object clause conjectures : 3
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 6
% 0.21/1.39 # Proof object initial formulas used : 6
% 0.21/1.39 # Proof object generating inferences : 5
% 0.21/1.39 # Proof object simplifying inferences : 5
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 71
% 0.21/1.39 # Removed by relevancy pruning/SinE : 55
% 0.21/1.39 # Initial clauses : 25
% 0.21/1.39 # Removed in clause preprocessing : 4
% 0.21/1.39 # Initial clauses in saturation : 21
% 0.21/1.39 # Processed clauses : 31
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 2
% 0.21/1.39 # ...remaining for further processing : 29
% 0.21/1.39 # Other redundant clauses eliminated : 1
% 0.21/1.39 # Clauses deleted for lack of memory : 0
% 0.21/1.39 # Backward-subsumed : 0
% 0.21/1.39 # Backward-rewritten : 0
% 0.21/1.39 # Generated clauses : 24
% 0.21/1.39 # ...of the previous two non-trivial : 18
% 0.21/1.39 # Contextual simplify-reflections : 5
% 0.21/1.39 # Paramodulations : 20
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 4
% 0.21/1.39 # Current number of processed clauses : 29
% 0.21/1.39 # Positive orientable unit clauses : 4
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 2
% 0.21/1.39 # Non-unit-clauses : 23
% 0.21/1.39 # Current number of unprocessed clauses: 8
% 0.21/1.39 # ...number of literals in the above : 57
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 0
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 79
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 27
% 0.21/1.39 # Non-unit clause-clause subsumptions : 7
% 0.21/1.39 # Unit Clause-clause subsumption calls : 5
% 0.21/1.39 # Rewrite failures with RHS unbound : 0
% 0.21/1.39 # BW rewrite match attempts : 0
% 0.21/1.39 # BW rewrite match successes : 0
% 0.21/1.39 # Condensation attempts : 0
% 0.21/1.39 # Condensation successes : 0
% 0.21/1.39 # Termbank termtop insertions : 3053
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.015 s
% 0.21/1.39 # System time : 0.004 s
% 0.21/1.39 # Total time : 0.019 s
% 0.21/1.39 # Maximum resident set size: 3092 pages
%------------------------------------------------------------------------------