TSTP Solution File: SEU444+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : Tue Jul 19 09:20:20 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 2 unt; 0 def)
% Number of atoms : 33 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 18 ~; 12 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 26 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relset_2,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t56_relset_2) ).
fof(t51_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t51_relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
inference(assume_negation,[status(cth)],[t56_relset_2]) ).
fof(c_0_3,negated_conjecture,
( m2_relset_1(esk3_0,esk2_0,esk1_0)
& ( k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)
| k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_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] :
( ( k1_funct_5(X6) = k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)
| ~ m2_relset_1(X6,X5,X4) )
& ( k2_funct_5(X6) = k10_relset_1(X5,X4,X6,X5)
| ~ m2_relset_1(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])]) ).
cnf(c_0_5,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
| k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( k1_funct_5(X1) = k10_relset_1(X3,X2,k6_relset_1(X2,X3,X1),X3)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0))
| k10_relset_1(X1,X2,k6_relset_1(X2,X1,esk3_0),X1) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)
| ~ m2_relset_1(esk3_0,X2,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(X1,X2,esk3_0,X1)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0))
| k10_relset_1(X3,X4,k6_relset_1(X4,X3,esk3_0),X3) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0)
| ~ m2_relset_1(esk3_0,X4,X3)
| ~ m2_relset_1(esk3_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(X1,X2,esk3_0,X1)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0))
| ~ m2_relset_1(esk3_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 10:48:22 EDT 2022
% 0.12/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 : 13
% 0.21/1.40 # Proof object clause steps : 8
% 0.21/1.40 # Proof object formula steps : 5
% 0.21/1.40 # Proof object conjectures : 9
% 0.21/1.40 # Proof object clause conjectures : 6
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 4
% 0.21/1.40 # Proof object initial formulas used : 2
% 0.21/1.40 # Proof object generating inferences : 4
% 0.21/1.40 # Proof object simplifying inferences : 4
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 45
% 0.21/1.40 # Removed by relevancy pruning/SinE : 25
% 0.21/1.40 # Initial clauses : 28
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 28
% 0.21/1.40 # Processed clauses : 83
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 11
% 0.21/1.40 # ...remaining for further processing : 72
% 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 : 3
% 0.21/1.40 # Generated clauses : 193
% 0.21/1.40 # ...of the previous two non-trivial : 165
% 0.21/1.40 # Contextual simplify-reflections : 9
% 0.21/1.40 # Paramodulations : 191
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 2
% 0.21/1.40 # Current number of processed clauses : 68
% 0.21/1.40 # Positive orientable unit clauses : 20
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 2
% 0.21/1.40 # Non-unit-clauses : 46
% 0.21/1.40 # Current number of unprocessed clauses: 97
% 0.21/1.40 # ...number of literals in the above : 311
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 4
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 245
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 216
% 0.21/1.40 # Non-unit clause-clause subsumptions : 21
% 0.21/1.40 # Unit Clause-clause subsumption calls : 35
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 29
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 4350
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.018 s
% 0.21/1.40 # System time : 0.005 s
% 0.21/1.40 # Total time : 0.022 s
% 0.21/1.40 # Maximum resident set size: 2988 pages
%------------------------------------------------------------------------------