TSTP Solution File: SYN058+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:51:20 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 42 ( 15 ~; 13 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 4 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel28,conjecture,
! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel28) ).
fof(pel28_1,axiom,
! [X1] :
( big_p(X1)
=> ! [X2] : big_q(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel28_1) ).
fof(pel28_2,axiom,
( ! [X1] :
( big_q(X1)
| big_r(X1) )
=> ? [X3] :
( big_q(X3)
& big_s(X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel28_2) ).
fof(pel28_3,axiom,
( ? [X1] : big_s(X1)
=> ! [X3] :
( big_f(X3)
=> big_g(X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel28_3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[pel28]) ).
fof(c_0_5,plain,
! [X3,X4] :
( ~ big_p(X3)
| big_q(X4) ),
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)],[pel28_1])])])])]) ).
fof(c_0_6,negated_conjecture,
( big_p(esk3_0)
& big_f(esk3_0)
& ~ big_g(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
( ( big_q(esk2_0)
| ~ big_q(esk1_0) )
& ( big_s(esk2_0)
| ~ big_q(esk1_0) )
& ( big_q(esk2_0)
| ~ big_r(esk1_0) )
& ( big_s(esk2_0)
| ~ big_r(esk1_0) ) ),
inference(distribute,[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)],[pel28_2])])])])])]) ).
cnf(c_0_8,plain,
( big_q(X1)
| ~ big_p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
big_p(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X4,X5] :
( ~ big_s(X4)
| ~ big_f(X5)
| big_g(X5) ),
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)],[pel28_3])])])])]) ).
cnf(c_0_11,plain,
( big_s(esk2_0)
| ~ big_q(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
big_q(X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_s(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
big_s(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
~ big_g(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
big_f(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.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 : Tue Jul 12 05:05:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Failure: Out of unprocessed clauses!
% 0.23/1.42 # OLD status GaveUp
% 0.23/1.42 # Parsed axioms : 4
% 0.23/1.42 # Removed by relevancy pruning/SinE : 1
% 0.23/1.42 # Initial clauses : 5
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 5
% 0.23/1.42 # Processed clauses : 6
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 6
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 1
% 0.23/1.42 # Generated clauses : 1
% 0.23/1.42 # ...of the previous two non-trivial : 1
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 1
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 5
% 0.23/1.42 # Positive orientable unit clauses : 3
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 1
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 1
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 244
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.011 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.014 s
% 0.23/1.42 # Maximum resident set size: 2768 pages
% 0.23/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 19
% 0.23/1.42 # Proof object clause steps : 10
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 8
% 0.23/1.42 # Proof object clause conjectures : 5
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 6
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 4
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 9
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 9
% 0.23/1.42 # Processed clauses : 12
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 12
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 5
% 0.23/1.42 # Generated clauses : 4
% 0.23/1.42 # ...of the previous two non-trivial : 4
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 4
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 6
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 1
% 0.23/1.42 # Current number of unprocessed clauses: 0
% 0.23/1.42 # ...number of literals in the above : 0
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 6
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 1
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 1
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 4
% 0.23/1.42 # BW rewrite match successes : 4
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 385
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.012 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------