TSTP Solution File: SYN394+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN394+1 : TPTP v8.1.0. Released v2.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 : Thu Jul 21 05:53:57 EDT 2022
% Result : Theorem 0.21s 1.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 15 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 11 ( 2 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish201,conjecture,
( ! [X1] :
( f(X1)
=> g(X1) )
=> ( ! [X2] : f(X2)
=> ! [X3] : g(X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',kalish201) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( f(X1)
=> g(X1) )
=> ( ! [X2] : f(X2)
=> ! [X3] : g(X3) ) ),
inference(assume_negation,[status(cth)],[kalish201]) ).
fof(c_0_2,negated_conjecture,
! [X4,X5] :
( ( ~ f(X4)
| g(X4) )
& f(X5)
& ~ g(esk1_0) ),
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_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( g(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
f(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ g(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
g(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN394+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 03:51:39 EDT 2022
% 0.12/0.33 % 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.013 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 : 8
% 0.21/1.39 # Proof object clause steps : 5
% 0.21/1.39 # Proof object formula steps : 3
% 0.21/1.39 # Proof object conjectures : 8
% 0.21/1.39 # Proof object clause conjectures : 5
% 0.21/1.39 # Proof object formula conjectures : 3
% 0.21/1.39 # Proof object initial clauses used : 3
% 0.21/1.39 # Proof object initial formulas used : 1
% 0.21/1.39 # Proof object generating inferences : 0
% 0.21/1.39 # Proof object simplifying inferences : 4
% 0.21/1.39 # Training examples: 0 positive, 0 negative
% 0.21/1.39 # Parsed axioms : 1
% 0.21/1.39 # Removed by relevancy pruning/SinE : 0
% 0.21/1.39 # Initial clauses : 3
% 0.21/1.39 # Removed in clause preprocessing : 2
% 0.21/1.39 # Initial clauses in saturation : 1
% 0.21/1.39 # Processed clauses : 1
% 0.21/1.39 # ...of these trivial : 0
% 0.21/1.39 # ...subsumed : 0
% 0.21/1.39 # ...remaining for further processing : 0
% 0.21/1.39 # Other redundant clauses eliminated : 0
% 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 : 0
% 0.21/1.39 # ...of the previous two non-trivial : 0
% 0.21/1.39 # Contextual simplify-reflections : 0
% 0.21/1.39 # Paramodulations : 0
% 0.21/1.39 # Factorizations : 0
% 0.21/1.39 # Equation resolutions : 0
% 0.21/1.39 # Current number of processed clauses : 0
% 0.21/1.39 # Positive orientable unit clauses : 0
% 0.21/1.39 # Positive unorientable unit clauses: 0
% 0.21/1.39 # Negative unit clauses : 0
% 0.21/1.39 # Non-unit-clauses : 0
% 0.21/1.39 # Current number of unprocessed clauses: 0
% 0.21/1.39 # ...number of literals in the above : 0
% 0.21/1.39 # Current number of archived formulas : 0
% 0.21/1.39 # Current number of archived clauses : 2
% 0.21/1.39 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.39 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.39 # Non-unit clause-clause subsumptions : 0
% 0.21/1.39 # Unit Clause-clause subsumption calls : 0
% 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 : 136
% 0.21/1.39
% 0.21/1.39 # -------------------------------------------------
% 0.21/1.39 # User time : 0.010 s
% 0.21/1.39 # System time : 0.003 s
% 0.21/1.39 # Total time : 0.013 s
% 0.21/1.39 # Maximum resident set size: 2492 pages
%------------------------------------------------------------------------------