%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:38 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 41 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 11 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel49,conjecture,
! [X1] : big_p(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel49) ).
fof(pel49_1,axiom,
? [X1,X2] :
! [X3] :
( X3 = X1
| X3 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel49_1) ).
fof(pel49_3,axiom,
big_p(b),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel49_3) ).
fof(pel49_2,axiom,
big_p(a),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel49_2) ).
fof(pel49_4,axiom,
a != b,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel49_4) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : big_p(X1),
inference(assume_negation,[status(cth)],[pel49]) ).
fof(c_0_6,negated_conjecture,
~ big_p(esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X6] :
( X6 = esk1_0
| X6 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel49_1])]) ).
cnf(c_0_8,negated_conjecture,
~ big_p(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = esk2_0
| X1 = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( esk3_0 = esk1_0
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 = esk1_0
| X1 = esk1_0
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
big_p(b),
inference(split_conjunct,[status(thm)],[pel49_3]) ).
cnf(c_0_13,negated_conjecture,
( esk1_0 = b
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
big_p(a),
inference(split_conjunct,[status(thm)],[pel49_2]) ).
cnf(c_0_15,negated_conjecture,
( esk1_0 = b
| ~ big_p(esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_16,plain,
( X1 = esk1_0
| X2 = esk1_0
| X2 = X1 ),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( esk1_0 = a
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk1_0
| X2 = b
| X2 = X1
| ~ big_p(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
a != b,
inference(split_conjunct,[status(thm)],[pel49_4]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 = a
| ~ big_p(esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( a = X1
| X1 = esk1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( X1 = a
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_12]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n003.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 01:11:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.013 s
% 0.22/1.41
% 0.22/1.41 # Failure: Out of unprocessed clauses!
% 0.22/1.41 # OLD status GaveUp
% 0.22/1.41 # Parsed axioms : 5
% 0.22/1.41 # Removed by relevancy pruning/SinE : 4
% 0.22/1.41 # Initial clauses : 1
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 1
% 0.22/1.41 # Processed clauses : 1
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 1
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 0
% 0.22/1.41 # ...of the previous two non-trivial : 0
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 0
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 1
% 0.22/1.41 # Positive orientable unit clauses : 0
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 0
% 0.22/1.41 # Current number of unprocessed clauses: 0
% 0.22/1.41 # ...number of literals in the above : 0
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 0
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 44
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.012 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.013 s
% 0.22/1.41 # Maximum resident set size: 2496 pages
% 0.22/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.013 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 24
% 0.22/1.41 # Proof object clause steps : 16
% 0.22/1.41 # Proof object formula steps : 8
% 0.22/1.41 # Proof object conjectures : 14
% 0.22/1.41 # Proof object clause conjectures : 11
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 5
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 11
% 0.22/1.41 # Proof object simplifying inferences : 2
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 5
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 5
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 5
% 0.22/1.41 # Processed clauses : 34
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 14
% 0.22/1.41 # ...remaining for further processing : 20
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 2
% 0.22/1.41 # Backward-rewritten : 0
% 0.22/1.41 # Generated clauses : 104
% 0.22/1.41 # ...of the previous two non-trivial : 71
% 0.22/1.41 # Contextual simplify-reflections : 13
% 0.22/1.41 # Paramodulations : 76
% 0.22/1.41 # Factorizations : 28
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 18
% 0.22/1.41 # Positive orientable unit clauses : 2
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 14
% 0.22/1.41 # Current number of unprocessed clauses: 35
% 0.22/1.41 # ...number of literals in the above : 120
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 2
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 126
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 120
% 0.22/1.41 # Non-unit clause-clause subsumptions : 29
% 0.22/1.41 # Unit Clause-clause subsumption calls : 0
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 0
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 456
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.013 s
% 0.22/1.41 # System time : 0.002 s
% 0.22/1.41 # Total time : 0.015 s
% 0.22/1.41 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------