TSTP Solution File: SYN083+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:45 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel61,conjecture,
! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel61) ).
fof(p61_1,axiom,
! [X1,X2,X3] : f(X1,f(X2,X3)) = f(f(X1,X2),X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',p61_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
inference(assume_negation,[status(cth)],[pel61]) ).
fof(c_0_3,negated_conjecture,
f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X4,X5,X6] : f(X4,f(X5,X6)) = f(f(X4,X5),X6),
inference(variable_rename,[status(thm)],[p61_1]) ).
cnf(c_0_5,negated_conjecture,
f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
f(X1,f(X2,X3)) = f(f(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 08:41:45 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.013 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 8
% 0.25/1.44 # Proof object clause steps : 3
% 0.25/1.44 # Proof object formula steps : 5
% 0.25/1.44 # Proof object conjectures : 5
% 0.25/1.44 # Proof object clause conjectures : 2
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 2
% 0.25/1.44 # Proof object initial formulas used : 2
% 0.25/1.44 # Proof object generating inferences : 0
% 0.25/1.44 # Proof object simplifying inferences : 3
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 2
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 2
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 2
% 0.25/1.44 # Processed clauses : 2
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 2
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 1
% 0.25/1.44 # Generated clauses : 1
% 0.25/1.44 # ...of the previous two non-trivial : 0
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 1
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 1
% 0.25/1.44 # Positive orientable unit clauses : 1
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 0
% 0.25/1.44 # Non-unit-clauses : 0
% 0.25/1.44 # Current number of unprocessed clauses: 0
% 0.25/1.44 # ...number of literals in the above : 0
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 1
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 0
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 2
% 0.25/1.44 # BW rewrite match successes : 2
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 166
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.010 s
% 0.25/1.44 # System time : 0.004 s
% 0.25/1.44 # Total time : 0.014 s
% 0.25/1.44 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------