TSTP Solution File: NUM609+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM609+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:22 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 36 ( 5 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 40 ( 13 ~; 10 |; 13 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
| aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__5164,hypothesis,
( aSet0(xP)
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( aElement0(X1)
& aElementOf0(X1,xQ)
& X1 != szmzizndt0(xQ) ) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__5164) ).
fof(c_0_2,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xQ) )
| aSubsetOf0(xP,xQ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
( aElementOf0(esk23_0,xP)
& ~ aElementOf0(esk23_0,xQ)
& ~ aSubsetOf0(xP,xQ) ),
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_2])])])])]) ).
fof(c_0_4,hypothesis,
! [X2,X3,X3] :
( aSet0(xP)
& ( ~ aElementOf0(X2,xQ)
| sdtlseqdt0(szmzizndt0(xQ),X2) )
& ( aElement0(X3)
| ~ aElementOf0(X3,xP) )
& ( aElementOf0(X3,xQ)
| ~ aElementOf0(X3,xP) )
& ( X3 != szmzizndt0(xQ)
| ~ aElementOf0(X3,xP) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,xQ)
| X3 = szmzizndt0(xQ)
| aElementOf0(X3,xP) )
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
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__5164])])])])])]) ).
cnf(c_0_5,negated_conjecture,
~ aElementOf0(esk23_0,xQ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
aElementOf0(esk23_0,xP),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM609+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 : Thu Jul 7 23:32:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.312 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 9
% 0.24/1.42 # Proof object clause steps : 4
% 0.24/1.42 # Proof object formula steps : 5
% 0.24/1.42 # Proof object conjectures : 6
% 0.24/1.42 # Proof object clause conjectures : 3
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 3
% 0.24/1.42 # Proof object initial formulas used : 2
% 0.24/1.42 # Proof object generating inferences : 1
% 0.24/1.42 # Proof object simplifying inferences : 2
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 107
% 0.24/1.42 # Removed by relevancy pruning/SinE : 9
% 0.24/1.42 # Initial clauses : 4881
% 0.24/1.42 # Removed in clause preprocessing : 7
% 0.24/1.42 # Initial clauses in saturation : 4874
% 0.24/1.42 # Processed clauses : 13
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 1
% 0.24/1.42 # ...remaining for further processing : 11
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 1
% 0.24/1.42 # ...of the previous two non-trivial : 0
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 1
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 11
% 0.24/1.42 # Positive orientable unit clauses : 5
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 4
% 0.24/1.42 # Non-unit-clauses : 2
% 0.24/1.42 # Current number of unprocessed clauses: 4861
% 0.24/1.42 # ...number of literals in the above : 55889
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 377158
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.295 s
% 0.24/1.42 # System time : 0.019 s
% 0.24/1.42 # Total time : 0.314 s
% 0.24/1.42 # Maximum resident set size: 21188 pages
%------------------------------------------------------------------------------