TSTP Solution File: SYN078+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN078+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:42 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 78 ( 11 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 81 ( 28 ~; 39 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel56,conjecture,
( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel56) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
inference(assume_negation,[status(cth)],[pel56]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9] :
( ( big_p(esk3_0)
| big_p(esk2_0) )
& ( ~ big_p(f(esk3_0))
| big_p(esk2_0) )
& ( big_p(esk3_0)
| esk1_0 = f(esk2_0) )
& ( ~ big_p(f(esk3_0))
| esk1_0 = f(esk2_0) )
& ( big_p(esk3_0)
| ~ big_p(esk1_0) )
& ( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) )
& ( ~ big_p(X8)
| X7 != f(X8)
| big_p(X7)
| ~ big_p(X9)
| big_p(f(X9)) ) ),
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)],[c_0_1])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(f(X1))
| big_p(X2)
| ~ big_p(X1)
| X2 != f(X3)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(f(X1))
| big_p(f(X2))
| ~ big_p(X1)
| ~ big_p(X2) ),
inference(er,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( big_p(esk2_0)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_p(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( esk1_0 = f(esk2_0)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( big_p(f(X1))
| big_p(esk2_0)
| ~ big_p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_p(esk1_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( big_p(f(X1))
| big_p(esk3_0)
| big_p(X2)
| X2 != esk1_0
| ~ big_p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_7]),c_0_5]) ).
cnf(c_0_12,negated_conjecture,
big_p(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( big_p(f(X1))
| ~ big_p(esk1_0)
| ~ big_p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( big_p(f(esk2_0))
| big_p(esk3_0)
| big_p(X1)
| X1 != esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ big_p(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( big_p(f(esk2_0))
| big_p(esk3_0) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
big_p(esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_7]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_p(f(esk3_0))
| big_p(f(X1))
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( big_p(f(esk2_0))
| big_p(f(X1))
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 = f(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_21,negated_conjecture,
big_p(f(esk3_0)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
big_p(f(esk2_0)),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
f(esk2_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN078+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 12:15:25 EDT 2022
% 0.14/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.013 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 : 25
% 0.23/1.42 # Proof object clause steps : 22
% 0.23/1.42 # Proof object formula steps : 3
% 0.23/1.42 # Proof object conjectures : 25
% 0.23/1.42 # Proof object clause conjectures : 22
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 7
% 0.23/1.42 # Proof object initial formulas used : 1
% 0.23/1.42 # Proof object generating inferences : 13
% 0.23/1.42 # Proof object simplifying inferences : 11
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 1
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 7
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 7
% 0.23/1.42 # Processed clauses : 27
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 4
% 0.23/1.42 # ...remaining for further processing : 23
% 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 : 3
% 0.23/1.42 # Backward-rewritten : 12
% 0.23/1.42 # Generated clauses : 46
% 0.23/1.42 # ...of the previous two non-trivial : 39
% 0.23/1.42 # Contextual simplify-reflections : 16
% 0.23/1.42 # Paramodulations : 44
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 2
% 0.23/1.42 # Current number of processed clauses : 8
% 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 : 3
% 0.23/1.42 # Current number of unprocessed clauses: 3
% 0.23/1.42 # ...number of literals in the above : 7
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 15
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 37
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 29
% 0.23/1.42 # Non-unit clause-clause subsumptions : 19
% 0.23/1.42 # Unit Clause-clause subsumption calls : 8
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 5
% 0.23/1.42 # BW rewrite match successes : 5
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 995
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.013 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------