TSTP Solution File: NUM633+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM633+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:38 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 59 ( 13 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 70 ( 26 ~; 19 |; 19 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 7 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4998) ).
fof(m__4908,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4908) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X4,X5,X6] :
( ( X4 != slcrc0
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X4,szNzAzT0)
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X4,szDzozmdt0(xc))
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( sdtlpdtrp0(xc,X4) = szDzizrdt0(xd)
| ~ aElementOf0(X4,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(esk7_2(X5,X6),slbdtsldtrb0(X6,xK))
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) )
& ( sdtlpdtrp0(xc,esk7_2(X5,X6)) != X5
| ~ aSubsetOf0(X6,xS)
| ~ isCountable0(X6)
| ~ aElementOf0(X5,xT) ) ),
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)],[c_0_4])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( aElementOf0(esk7_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_9,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk7_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( sdtlpdtrp0(xc,esk7_2(X1,xO)) = szDzizrdt0(xd)
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
( szDzizrdt0(xd) != X1
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]),c_0_9])]) ).
cnf(c_0_13,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[m__4854]) ).
cnf(c_0_14,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM633+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n025.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 07:14:28 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.029 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 15
% 0.25/1.42 # Proof object clause steps : 9
% 0.25/1.42 # Proof object formula steps : 6
% 0.25/1.42 # Proof object conjectures : 8
% 0.25/1.42 # Proof object clause conjectures : 5
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 6
% 0.25/1.42 # Proof object initial formulas used : 4
% 0.25/1.42 # Proof object generating inferences : 3
% 0.25/1.42 # Proof object simplifying inferences : 6
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 99
% 0.25/1.42 # Removed by relevancy pruning/SinE : 2
% 0.25/1.42 # Initial clauses : 197
% 0.25/1.42 # Removed in clause preprocessing : 7
% 0.25/1.42 # Initial clauses in saturation : 190
% 0.25/1.42 # Processed clauses : 263
% 0.25/1.42 # ...of these trivial : 2
% 0.25/1.42 # ...subsumed : 17
% 0.25/1.42 # ...remaining for further processing : 244
% 0.25/1.42 # Other redundant clauses eliminated : 11
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 1
% 0.25/1.42 # Backward-rewritten : 2
% 0.25/1.42 # Generated clauses : 801
% 0.25/1.42 # ...of the previous two non-trivial : 750
% 0.25/1.42 # Contextual simplify-reflections : 24
% 0.25/1.42 # Paramodulations : 768
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 33
% 0.25/1.42 # Current number of processed clauses : 238
% 0.25/1.42 # Positive orientable unit clauses : 47
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 15
% 0.25/1.42 # Non-unit-clauses : 176
% 0.25/1.42 # Current number of unprocessed clauses: 667
% 0.25/1.42 # ...number of literals in the above : 3471
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 3
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 6555
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 1258
% 0.25/1.42 # Non-unit clause-clause subsumptions : 29
% 0.25/1.42 # Unit Clause-clause subsumption calls : 1880
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 1
% 0.25/1.42 # BW rewrite match successes : 1
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 28280
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.079 s
% 0.25/1.42 # System time : 0.002 s
% 0.25/1.42 # Total time : 0.081 s
% 0.25/1.42 # Maximum resident set size: 4844 pages
%------------------------------------------------------------------------------