TSTP Solution File: SYN063+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:25 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 114 ( 11 avg)
% Number of connectives : 229 ( 78 ~; 111 |; 34 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 13 ( 7 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel33,conjecture,
( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel33) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
inference(assume_negation,[status(cth)],[pel33]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6] :
( ( big_p(a)
| big_p(a)
| big_p(a) )
& ( big_p(b)
| big_p(a)
| big_p(a) )
& ( ~ big_p(c)
| big_p(a)
| big_p(a) )
& ( big_p(a)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(b)
| ~ big_p(esk2_0)
| big_p(a) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(a)
| ~ big_p(c)
| big_p(a) )
& ( big_p(b)
| ~ big_p(c)
| big_p(a) )
& ( ~ big_p(c)
| ~ big_p(c)
| big_p(a) )
& ( big_p(a)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| big_p(a)
| ~ big_p(c) )
& ( big_p(b)
| big_p(a)
| ~ big_p(c) )
& ( ~ big_p(c)
| big_p(a)
| ~ big_p(c) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( big_p(b)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( big_p(a)
| ~ big_p(c)
| ~ big_p(c) )
& ( big_p(b)
| ~ big_p(c)
| ~ big_p(c) )
& ( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(c) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(c)
| big_p(X5)
| ~ big_p(a)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c)
| big_p(X5)
| ~ big_p(a)
| big_p(c) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(c)
| ~ big_p(b)
| ~ big_p(a)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c)
| ~ big_p(b)
| ~ big_p(a)
| big_p(c) ) ),
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)],[c_0_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(c)
| big_p(X1)
| big_p(c)
| big_p(X2)
| ~ big_p(a)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(a)
| big_p(a)
| big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(c) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_p(c)
| big_p(c)
| ~ big_p(a)
| ~ big_p(b)
| ~ big_p(b)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( big_p(X2)
| big_p(X1)
| big_p(c)
| ~ big_p(a) ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
big_p(a),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
~ big_p(c),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( big_p(c)
| ~ big_p(a)
| ~ big_p(b) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( big_p(X1)
| big_p(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ big_p(b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8])]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
big_p(X1),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.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:17:25 EDT 2022
% 0.12/0.33 % 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.015 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 : 15
% 0.22/1.41 # Proof object clause steps : 12
% 0.22/1.41 # Proof object formula steps : 3
% 0.22/1.41 # Proof object conjectures : 15
% 0.22/1.41 # Proof object clause conjectures : 12
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 4
% 0.22/1.41 # Proof object initial formulas used : 1
% 0.22/1.41 # Proof object generating inferences : 1
% 0.22/1.41 # Proof object simplifying inferences : 12
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 1
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 31
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 31
% 0.22/1.41 # Processed clauses : 32
% 0.22/1.41 # ...of these trivial : 18
% 0.22/1.41 # ...subsumed : 8
% 0.22/1.41 # ...remaining for further processing : 6
% 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 : 1
% 0.22/1.41 # Backward-rewritten : 4
% 0.22/1.41 # Generated clauses : 7
% 0.22/1.41 # ...of the previous two non-trivial : 7
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 5
% 0.22/1.41 # Factorizations : 2
% 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 : 1
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 0
% 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 : 5
% 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 : 1
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 7
% 0.22/1.41 # BW rewrite match successes : 7
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 1209
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.011 s
% 0.22/1.41 # System time : 0.005 s
% 0.22/1.41 # Total time : 0.015 s
% 0.22/1.41 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------