TSTP Solution File: ALG069+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 14 16:47:34 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 2 unt; 0 def)
% Number of atoms : 78 ( 23 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 90 ( 31 ~; 22 |; 17 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax4,axiom,
~ ! [X1] :
( sorti2(X1)
=> ? [X2] :
( sorti2(X2)
& op2(X2,X2) = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax4) ).
fof(ax3,axiom,
! [X1] :
( sorti1(X1)
=> ? [X2] :
( sorti1(X2)
& op1(X2,X2) = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax3) ).
fof(c_0_3,negated_conjecture,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,plain,
! [X4] :
( sorti2(esk2_0)
& ( ~ sorti2(X4)
| op2(X4,X4) != esk2_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ sorti1(X9)
| sorti2(h(X9)) )
& ( ~ sorti2(X10)
| sorti1(j(X10)) )
& ( ~ sorti1(X11)
| ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12)) )
& ( ~ sorti2(X13)
| ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14)) )
& ( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ( ~ sorti1(X16)
| j(h(X16)) = X16 ) ),
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)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( op2(X1,X1) != esk2_0
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( h(op1(X1,X2)) = op2(h(X1),h(X2))
| ~ sorti1(X2)
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( sorti2(h(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X3] :
( ( sorti1(esk1_1(X3))
| ~ sorti1(X3) )
& ( op1(esk1_1(X3),esk1_1(X3)) = X3
| ~ sorti1(X3) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( h(op1(X1,X1)) != esk2_0
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,plain,
( op1(esk1_1(X1),esk1_1(X1)) = X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( sorti1(esk1_1(X1))
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( h(X1) != esk2_0
| ~ sorti1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( h(j(X1)) = X1
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( X1 != esk2_0
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
sorti2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.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 : Wed Jun 8 16:50:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.014 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 19
% 0.23/1.40 # Proof object clause steps : 12
% 0.23/1.40 # Proof object formula steps : 7
% 0.23/1.40 # Proof object conjectures : 11
% 0.23/1.40 # Proof object clause conjectures : 8
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 3
% 0.23/1.40 # Proof object generating inferences : 4
% 0.23/1.40 # Proof object simplifying inferences : 3
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 5
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 12
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 12
% 0.23/1.40 # Processed clauses : 21
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 1
% 0.23/1.40 # ...remaining for further processing : 20
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 42
% 0.23/1.40 # ...of the previous two non-trivial : 35
% 0.23/1.40 # Contextual simplify-reflections : 7
% 0.23/1.40 # Paramodulations : 42
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 20
% 0.23/1.40 # Positive orientable unit clauses : 1
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 0
% 0.23/1.40 # Non-unit-clauses : 19
% 0.23/1.40 # Current number of unprocessed clauses: 26
% 0.23/1.40 # ...number of literals in the above : 119
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 33
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 33
% 0.23/1.40 # Non-unit clause-clause subsumptions : 8
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 0
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1674
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.015 s
% 0.23/1.40 # System time : 0.001 s
% 0.23/1.40 # Total time : 0.016 s
% 0.23/1.40 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------