TSTP Solution File: CSR103+7 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR103+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : Fri Jul 15 03:02:47 EDT 2022
% Result : Theorem 27.06s 32.25s
% Output : CNFRefutation 27.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 1 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341] :
! [X2342] : s__instance(X2342,X2341),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_ALL) ).
fof(kb_SUMO_27371,axiom,
! [X857] : s__instance(X857,s__Entity),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27371) ).
fof(c_0_2,negated_conjecture,
~ ? [X2341] :
! [X2342] : s__instance(X2342,X2341),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_3,negated_conjecture,
! [X2343] : ~ s__instance(esk6541_1(X2343),X2343),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X858] : s__instance(X858,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).
cnf(c_0_5,negated_conjecture,
~ s__instance(esk6541_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR103+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n007.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 : Sat Jun 11 08:10:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 27.06/32.25 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 27.06/32.25 # Preprocessing time : 4.653 s
% 27.06/32.25
% 27.06/32.25 # Proof found!
% 27.06/32.25 # SZS status Theorem
% 27.06/32.25 # SZS output start CNFRefutation
% See solution above
% 27.06/32.25 # Proof object total steps : 8
% 27.06/32.25 # Proof object clause steps : 3
% 27.06/32.25 # Proof object formula steps : 5
% 27.06/32.25 # Proof object conjectures : 5
% 27.06/32.25 # Proof object clause conjectures : 2
% 27.06/32.25 # Proof object formula conjectures : 3
% 27.06/32.25 # Proof object initial clauses used : 2
% 27.06/32.25 # Proof object initial formulas used : 2
% 27.06/32.25 # Proof object generating inferences : 1
% 27.06/32.25 # Proof object simplifying inferences : 0
% 27.06/32.25 # Training examples: 0 positive, 0 negative
% 27.06/32.25 # Parsed axioms : 55587
% 27.06/32.25 # Removed by relevancy pruning/SinE : 0
% 27.06/32.25 # Initial clauses : 73853
% 27.06/32.25 # Removed in clause preprocessing : 2369
% 27.06/32.25 # Initial clauses in saturation : 71484
% 27.06/32.25 # Processed clauses : 28
% 27.06/32.25 # ...of these trivial : 0
% 27.06/32.25 # ...subsumed : 0
% 27.06/32.25 # ...remaining for further processing : 28
% 27.06/32.25 # Other redundant clauses eliminated : 0
% 27.06/32.25 # Clauses deleted for lack of memory : 35742
% 27.06/32.25 # Backward-subsumed : 0
% 27.06/32.25 # Backward-rewritten : 0
% 27.06/32.25 # Generated clauses : 1
% 27.06/32.25 # ...of the previous two non-trivial : 0
% 27.06/32.25 # Contextual simplify-reflections : 0
% 27.06/32.25 # Paramodulations : 1
% 27.06/32.25 # Factorizations : 0
% 27.06/32.25 # Equation resolutions : 0
% 27.06/32.25 # Current number of processed clauses : 28
% 27.06/32.25 # Positive orientable unit clauses : 20
% 27.06/32.25 # Positive unorientable unit clauses: 0
% 27.06/32.25 # Negative unit clauses : 8
% 27.06/32.25 # Non-unit-clauses : 0
% 27.06/32.25 # Current number of unprocessed clauses: 35714
% 27.06/32.25 # ...number of literals in the above : 46100
% 27.06/32.25 # Current number of archived formulas : 0
% 27.06/32.25 # Current number of archived clauses : 0
% 27.06/32.25 # Clause-clause subsumption calls (NU) : 0
% 27.06/32.25 # Rec. Clause-clause subsumption calls : 0
% 27.06/32.25 # Non-unit clause-clause subsumptions : 0
% 27.06/32.25 # Unit Clause-clause subsumption calls : 9
% 27.06/32.25 # Rewrite failures with RHS unbound : 0
% 27.06/32.25 # BW rewrite match attempts : 0
% 27.06/32.25 # BW rewrite match successes : 0
% 27.06/32.25 # Condensation attempts : 0
% 27.06/32.25 # Condensation successes : 0
% 27.06/32.25 # Termbank termtop insertions : 4397909
% 27.06/32.25
% 27.06/32.25 # -------------------------------------------------
% 27.06/32.25 # User time : 4.730 s
% 27.06/32.25 # System time : 0.155 s
% 27.06/32.25 # Total time : 4.885 s
% 27.06/32.25 # Maximum resident set size: 253188 pages
%------------------------------------------------------------------------------