TSTP Solution File: NUM606+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:20 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 68 ( 1 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 78 ( 33 ~; 30 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 25 ( 1 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSub) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3435) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNATSet) ).
fof(m__,conjecture,
aSubsetOf0(xQ,szNzAzT0),
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__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5093) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ aSet0(X4)
| ~ aSet0(X5)
| ~ aSet0(X6)
| ~ aSubsetOf0(X4,X5)
| ~ aSubsetOf0(X5,X6)
| aSubsetOf0(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
fof(c_0_8,plain,
! [X4,X5,X6,X5] :
( ( aSet0(X5)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(X6,X5)
| aElementOf0(X6,X4)
| ~ aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( aElementOf0(esk8_2(X4,X5),X5)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) )
& ( ~ aElementOf0(esk8_2(X4,X5),X4)
| ~ aSet0(X5)
| aSubsetOf0(X5,X4)
| ~ aSet0(X4) ) ),
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)],[mDefSub])])])])])])]) ).
cnf(c_0_9,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( aSet0(X2)
| ~ aSet0(X1)
| ~ aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_13,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_14,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_16,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X2,xS)
| ~ aSubsetOf0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_13])]) ).
cnf(c_0_18,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_19,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
( aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X1,xO) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[m__5093]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 02:05:52 EDT 2022
% 0.13/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.026 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 : 23
% 0.25/1.42 # Proof object clause steps : 12
% 0.25/1.42 # Proof object formula steps : 11
% 0.25/1.42 # Proof object conjectures : 5
% 0.25/1.42 # Proof object clause conjectures : 2
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 7
% 0.25/1.42 # Proof object initial formulas used : 7
% 0.25/1.42 # Proof object generating inferences : 4
% 0.25/1.42 # Proof object simplifying inferences : 8
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 101
% 0.25/1.42 # Removed by relevancy pruning/SinE : 2
% 0.25/1.42 # Initial clauses : 195
% 0.25/1.42 # Removed in clause preprocessing : 7
% 0.25/1.42 # Initial clauses in saturation : 188
% 0.25/1.42 # Processed clauses : 258
% 0.25/1.42 # ...of these trivial : 1
% 0.25/1.42 # ...subsumed : 14
% 0.25/1.42 # ...remaining for further processing : 243
% 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 : 0
% 0.25/1.42 # Backward-rewritten : 3
% 0.25/1.42 # Generated clauses : 763
% 0.25/1.42 # ...of the previous two non-trivial : 700
% 0.25/1.42 # Contextual simplify-reflections : 21
% 0.25/1.42 # Paramodulations : 731
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 32
% 0.25/1.42 # Current number of processed clauses : 237
% 0.25/1.42 # Positive orientable unit clauses : 51
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 19
% 0.25/1.42 # Non-unit-clauses : 167
% 0.25/1.42 # Current number of unprocessed clauses: 629
% 0.25/1.42 # ...number of literals in the above : 3312
% 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) : 6215
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 1446
% 0.25/1.42 # Non-unit clause-clause subsumptions : 24
% 0.25/1.42 # Unit Clause-clause subsumption calls : 1888
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 3
% 0.25/1.42 # BW rewrite match successes : 3
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 27335
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.057 s
% 0.25/1.42 # System time : 0.004 s
% 0.25/1.42 # Total time : 0.061 s
% 0.25/1.42 # Maximum resident set size: 4860 pages
%------------------------------------------------------------------------------