TSTP Solution File: SYN065+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN065+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:51:27 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 33 ( 15 ~; 13 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 2 sgn 11 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel36,conjecture,
! [X1] :
? [X2] : big_h(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel36) ).
fof(pel36_3,axiom,
! [X1,X2] :
( ( big_f(X1,X2)
| big_g(X1,X2) )
=> ! [X3] :
( ( big_f(X2,X3)
| big_g(X2,X3) )
=> big_h(X1,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel36_3) ).
fof(pel36_1,axiom,
! [X1] :
? [X2] : big_f(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel36_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] : big_h(X1,X2),
inference(assume_negation,[status(cth)],[pel36]) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ( ~ big_f(X5,X6)
| big_h(X4,X6)
| ~ big_f(X4,X5) )
& ( ~ big_g(X5,X6)
| big_h(X4,X6)
| ~ big_f(X4,X5) )
& ( ~ big_f(X5,X6)
| big_h(X4,X6)
| ~ big_g(X4,X5) )
& ( ~ big_g(X5,X6)
| big_h(X4,X6)
| ~ big_g(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel36_3])])])])])]) ).
fof(c_0_5,plain,
! [X3] : big_f(X3,esk3_1(X3)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel36_1])]) ).
fof(c_0_6,negated_conjecture,
! [X4] : ~ big_h(esk1_0,X4),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( big_h(X1,X3)
| ~ big_f(X1,X2)
| ~ big_f(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
big_f(X1,esk3_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ big_h(esk1_0,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( big_h(X1,esk3_1(X2))
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ big_f(esk1_0,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_11,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 : Tue Jul 12 09:14:14 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 13
% 0.22/1.40 # Proof object clause steps : 6
% 0.22/1.40 # Proof object formula steps : 7
% 0.22/1.40 # Proof object conjectures : 6
% 0.22/1.40 # Proof object clause conjectures : 3
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 3
% 0.22/1.40 # Proof object initial formulas used : 3
% 0.22/1.40 # Proof object generating inferences : 3
% 0.22/1.40 # Proof object simplifying inferences : 0
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 4
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 7
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 7
% 0.22/1.40 # Processed clauses : 11
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 11
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 8
% 0.22/1.40 # ...of the previous two non-trivial : 7
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 8
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 11
% 0.22/1.40 # Positive orientable unit clauses : 2
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 7
% 0.22/1.40 # Current number of unprocessed clauses: 3
% 0.22/1.40 # ...number of literals in the above : 4
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 2
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 2
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 0
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 374
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.014 s
% 0.22/1.40 # System time : 0.000 s
% 0.22/1.40 # Total time : 0.014 s
% 0.22/1.40 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------