TSTP Solution File: SYN328+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:53:16 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 105 ( 33 ~; 38 |; 14 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-1 aty)
% Number of variables : 24 ( 3 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_12_3,conjecture,
? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',church_46_12_3) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_12_3]) ).
fof(c_0_2,negated_conjecture,
! [X4] :
( ( big_f(esk1_1(X4))
| big_f(X4) )
& ( ~ big_g(esk1_1(X4))
| big_f(X4) )
& ( ~ big_f(X4)
| ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4)) )
& ( big_f(esk1_1(X4))
| big_g(X4) )
& ( ~ big_h(esk1_1(X4))
| big_g(X4) )
& ( ~ big_g(X4)
| ~ big_f(esk1_1(X4))
| big_h(esk1_1(X4)) )
& ( ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4))
| big_h(X4) )
& ( ~ big_h(esk1_1(X4))
| big_h(X4) )
& ( big_f(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_g(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_f(esk2_1(X4))
| ~ big_g(esk3_1(X4))
| ~ big_h(esk4_1(X4)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[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_f(X1)
| ~ big_g(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_h(X1)
| big_g(esk1_1(X1))
| ~ big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_f(X1)
| big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_f(esk1_1(X1))
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( big_h(X1)
| big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( big_g(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_h(X1)
| ~ big_g(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( big_g(esk1_1(X1))
| ~ big_f(esk1_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( big_h(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1)
| ~ big_f(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_h(X1)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
big_h(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_h(esk4_1(X1))
| ~ big_g(esk3_1(X1))
| ~ big_f(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
big_g(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
big_f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15])]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n008.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 06:28:38 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.015 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 : 21
% 0.23/1.42 # Proof object clause steps : 18
% 0.23/1.42 # Proof object formula steps : 3
% 0.23/1.42 # Proof object conjectures : 21
% 0.23/1.42 # Proof object clause conjectures : 18
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 9
% 0.23/1.42 # Proof object initial formulas used : 1
% 0.23/1.42 # Proof object generating inferences : 6
% 0.23/1.42 # Proof object simplifying inferences : 15
% 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 : 11
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 11
% 0.23/1.42 # Processed clauses : 28
% 0.23/1.42 # ...of these trivial : 2
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 24
% 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 : 5
% 0.23/1.42 # Backward-rewritten : 16
% 0.23/1.42 # Generated clauses : 36
% 0.23/1.42 # ...of the previous two non-trivial : 33
% 0.23/1.42 # Contextual simplify-reflections : 6
% 0.23/1.42 # Paramodulations : 36
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 3
% 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 : 0
% 0.23/1.42 # Non-unit-clauses : 0
% 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 : 21
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 41
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 35
% 0.23/1.42 # Non-unit clause-clause subsumptions : 8
% 0.23/1.42 # Unit Clause-clause subsumption calls : 4
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 9
% 0.23/1.42 # BW rewrite match successes : 9
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1323
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.016 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.018 s
% 0.23/1.42 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------