TSTP Solution File: SYN349+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:31 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 92 ( 32 ~; 41 |; 9 &)
% ( 8 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 26 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_17_5,conjecture,
? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',church_46_17_5) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
inference(assume_negation,[status(cth)],[church_46_17_5]) ).
fof(c_0_2,negated_conjecture,
! [X5,X7] :
( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk1_1(X5),esk2_2(X5,X7)) )
& ( ~ big_f(esk1_1(X5),esk2_2(X5,X7))
| big_f(X5,esk2_2(X5,X7)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_f(esk2_2(X1,X2),esk1_1(X1))
| big_f(esk2_2(X1,X2),X2)
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),X2)
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| ~ big_f(X1,esk2_2(X1,esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
~ big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( big_f(esk2_2(X1,X2),esk1_1(X1))
| big_f(X2,esk2_2(X1,X2))
| big_f(esk2_2(X1,X2),X2)
| big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
~ big_f(X1,esk2_2(X1,esk1_1(X1))),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( big_f(X2,esk2_2(X1,X2))
| big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_9]),c_0_10]),c_0_8]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12])]),c_0_10]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 11 20:15:44 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.015 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 14
% 0.21/1.40 # Proof object clause steps : 11
% 0.21/1.40 # Proof object formula steps : 3
% 0.21/1.40 # Proof object conjectures : 14
% 0.21/1.40 # Proof object clause conjectures : 11
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 6
% 0.21/1.40 # Proof object initial formulas used : 1
% 0.21/1.40 # Proof object generating inferences : 5
% 0.21/1.40 # Proof object simplifying inferences : 8
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 1
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 10
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 10
% 0.21/1.40 # Processed clauses : 15
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 1
% 0.21/1.40 # ...remaining for further processing : 14
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 0
% 0.21/1.40 # Generated clauses : 23
% 0.21/1.40 # ...of the previous two non-trivial : 7
% 0.21/1.40 # Contextual simplify-reflections : 3
% 0.21/1.40 # Paramodulations : 21
% 0.21/1.40 # Factorizations : 2
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 13
% 0.21/1.40 # Positive orientable unit clauses : 1
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 10
% 0.21/1.40 # Current number of unprocessed clauses: 1
% 0.21/1.40 # ...number of literals in the above : 3
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 1
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 75
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 40
% 0.21/1.40 # Non-unit clause-clause subsumptions : 4
% 0.21/1.40 # Unit Clause-clause subsumption calls : 19
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 1501
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.015 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.017 s
% 0.21/1.40 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------