TSTP Solution File: SYN070+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:37 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 92 ( 35 ~; 37 |; 13 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 38 ( 10 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel46,conjecture,
! [X1] :
( big_f(X1)
=> big_g(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel46) ).
fof(pel46_1,axiom,
! [X1,X2] :
( ( big_f(X1)
& ( ( big_f(X2)
& big_h(X2,X1) )
=> big_g(X2) ) )
=> big_g(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel46_1) ).
fof(pel46_2,axiom,
( ? [X1] :
( big_f(X1)
& ~ big_g(X1) )
=> ? [X3] :
( big_f(X3)
& ~ big_g(X3)
& ! [X2] :
( ( big_f(X2)
& ~ big_g(X2) )
=> big_j(X3,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel46_2) ).
fof(pel46_3,axiom,
! [X1,X2] :
( ( big_f(X1)
& big_f(X2)
& big_h(X1,X2) )
=> ~ big_j(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel46_3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( big_f(X1)
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[pel46]) ).
fof(c_0_5,plain,
! [X3,X4,X4,X4] :
( ( big_f(X4)
| ~ big_f(X3)
| big_g(X3) )
& ( big_h(X4,X3)
| ~ big_f(X3)
| big_g(X3) )
& ( ~ big_g(X4)
| ~ big_f(X3)
| big_g(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel46_1])])])])]) ).
fof(c_0_6,negated_conjecture,
( big_f(esk2_0)
& ~ big_g(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X4,X6] :
( ( big_f(esk1_0)
| ~ big_f(X4)
| big_g(X4) )
& ( ~ big_g(esk1_0)
| ~ big_f(X4)
| big_g(X4) )
& ( ~ big_f(X6)
| big_g(X6)
| big_j(esk1_0,X6)
| ~ big_f(X4)
| big_g(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)],[inference(fof_simplification,[status(thm)],[pel46_2])])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ big_f(X3)
| ~ big_f(X4)
| ~ big_h(X3,X4)
| ~ big_j(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel46_3])])]) ).
cnf(c_0_9,plain,
( big_g(X1)
| big_f(X2)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
big_f(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ big_g(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( big_g(X1)
| big_j(esk1_0,X2)
| big_g(X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1)
| ~ big_f(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
big_f(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_16,plain,
( big_j(esk1_0,X1)
| big_g(X1)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_9]),c_0_13]) ).
cnf(c_0_17,plain,
( ~ big_j(X1,X2)
| ~ big_h(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_18,plain,
( big_j(esk1_0,X1)
| big_g(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])]) ).
cnf(c_0_19,plain,
( big_g(X1)
| big_h(X2,X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( big_g(X1)
| ~ big_h(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( big_g(X1)
| big_h(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15])]) ).
cnf(c_0_22,plain,
( big_g(X1)
| ~ big_g(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_15])]) ).
cnf(c_0_23,plain,
big_g(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 21:04:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 4
% 0.23/1.41 # Removed by relevancy pruning/SinE : 3
% 0.23/1.41 # Initial clauses : 2
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 2
% 0.23/1.41 # Processed clauses : 2
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 2
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 0
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 2
% 0.23/1.41 # Positive orientable unit clauses : 1
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 1
% 0.23/1.41 # Non-unit-clauses : 0
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 114
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.014 s
% 0.23/1.41 # Maximum resident set size: 2504 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 25
% 0.23/1.41 # Proof object clause steps : 16
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 7
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 3
% 0.23/1.41 # Proof object simplifying inferences : 15
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 4
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 9
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 9
% 0.23/1.41 # Processed clauses : 16
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 16
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 2
% 0.23/1.41 # Backward-rewritten : 11
% 0.23/1.41 # Generated clauses : 7
% 0.23/1.41 # ...of the previous two non-trivial : 10
% 0.23/1.41 # Contextual simplify-reflections : 3
% 0.23/1.41 # Paramodulations : 7
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 3
% 0.23/1.41 # Positive orientable unit clauses : 2
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 1
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 13
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 7
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 6
% 0.23/1.41 # Non-unit clause-clause subsumptions : 5
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 6
% 0.23/1.41 # BW rewrite match successes : 6
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 679
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.013 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.014 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------