TSTP Solution File: SYO064^4.002 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO064^4.002 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% DateTime : Tue May 21 08:44:28 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 38
% Syntax : Number of formulae : 92 ( 42 unt; 22 typ; 0 def)
% Number of atoms : 264 ( 24 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 573 ( 77 ~; 99 |; 14 &; 358 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 89 ( 89 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 6 con; 0-3 aty)
% Number of variables : 150 ( 56 ^ 94 !; 0 ?; 150 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
irel: $i > $i > $o ).
thf(decl_23,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_24,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_28,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_32,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_42,type,
a: $i > $o ).
thf(decl_43,type,
a1: $i > $o ).
thf(decl_44,type,
a2: $i > $o ).
thf(decl_45,type,
b: $i > $o ).
thf(decl_46,type,
b1: $i > $o ).
thf(decl_47,type,
esk1_1: $i > $i ).
thf(decl_48,type,
esk2_0: $i ).
thf(decl_49,type,
esk3_0: $i ).
thf(decl_50,type,
esk4_0: $i ).
thf(decl_51,type,
esk5_0: $i ).
thf(decl_52,type,
esk6_0: $i ).
thf(iand,axiom,
( iand
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mand @ X12 @ X14 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iand) ).
thf(mand,axiom,
( mand
= ( ^ [X8: $i > $o,X9: $i > $o,X5: $i] :
( ( X8 @ X5 )
& ( X9 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mand) ).
thf(ior,axiom,
( ior
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mor @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',ior) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mor) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mbox_s4) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',ivalid) ).
thf(con,conjecture,
ivalid @ ( ior @ ( iatom @ a ) @ ( ior @ ( iand @ ( iatom @ b ) @ ( iatom @ a1 ) ) @ ( iand @ ( iatom @ b1 ) @ ( iatom @ a2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(axiom3,axiom,
ivalid @ ( ior @ ( ior @ ( iatom @ b ) @ ( iatom @ a ) ) @ ( iatom @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom3) ).
thf(trans_axiom,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( irel @ X1 @ X2 )
& ( irel @ X2 @ X3 ) )
=> ( irel @ X1 @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',trans_axiom) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X10: $i > $o,X11: $i > $o] : ( mor @ ( mnot @ X10 ) @ X11 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',mnot) ).
thf(iimplies,axiom,
( iimplies
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mimplies @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',iimplies) ).
thf(refl_axiom,axiom,
! [X1: $i] : ( irel @ X1 @ X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL010^0.ax',refl_axiom) ).
thf(axiom2,axiom,
ivalid @ ( iimplies @ ( iatom @ b ) @ ( ior @ ( ior @ ( iatom @ b1 ) @ ( iatom @ a1 ) ) @ ( iatom @ b1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2) ).
thf(axiom1,axiom,
ivalid @ ( iatom @ a2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1) ).
thf(c_0_16,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[iand]) ).
thf(c_0_17,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_18,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ior]) ).
thf(c_0_19,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_20,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_21,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_22,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_23,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_24,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_25,negated_conjecture,
~ ! [X54: $i] :
( ! [X52: $i] :
( ( irel @ X54 @ X52 )
=> ( a @ X52 ) )
| ! [X53: $i] :
( ( irel @ X54 @ X53 )
=> ( ! [X50: $i] :
( ( irel @ X53 @ X50 )
=> ( ( b @ X50 )
& ( a1 @ X50 ) ) )
| ! [X51: $i] :
( ( irel @ X53 @ X51 )
=> ( ( b1 @ X51 )
& ( a2 @ X51 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_21]),c_0_22]),c_0_23]),c_0_24]) ).
thf(c_0_26,plain,
! [X49: $i] :
( ! [X47: $i] :
( ( irel @ X49 @ X47 )
=> ( ! [X45: $i] :
( ( irel @ X47 @ X45 )
=> ( b @ X45 ) )
| ! [X46: $i] :
( ( irel @ X47 @ X46 )
=> ( a @ X46 ) ) ) )
| ! [X48: $i] :
( ( irel @ X49 @ X48 )
=> ( b @ X48 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom3,c_0_21]),c_0_23]),c_0_24]) ).
thf(c_0_27,plain,
! [X56: $i,X57: $i,X58: $i] :
( ~ ( irel @ X56 @ X57 )
| ~ ( irel @ X57 @ X58 )
| ( irel @ X56 @ X58 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[trans_axiom])])]) ).
thf(c_0_28,negated_conjecture,
( ( irel @ esk2_0 @ esk3_0 )
& ~ ( a @ esk3_0 )
& ( irel @ esk2_0 @ esk4_0 )
& ( irel @ esk4_0 @ esk5_0 )
& ( ~ ( b @ esk5_0 )
| ~ ( a1 @ esk5_0 ) )
& ( irel @ esk4_0 @ esk6_0 )
& ( ~ ( b1 @ esk6_0 )
| ~ ( a2 @ esk6_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_29,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_30,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_31,plain,
! [X67: $i,X68: $i,X69: $i,X70: $i,X71: $i] :
( ~ ( irel @ X67 @ X68 )
| ~ ( irel @ X68 @ X69 )
| ( b @ X69 )
| ~ ( irel @ X68 @ X70 )
| ( a @ X70 )
| ~ ( irel @ X67 @ X71 )
| ( b @ X71 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
thf(c_0_32,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( irel @ X1 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
irel @ esk4_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iimplies]) ).
thf(c_0_35,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29,c_0_30]),c_0_19]) ).
thf(c_0_36,plain,
! [X2: $i,X1: $i,X5: $i,X3: $i,X13: $i] :
( ( b @ X3 )
| ( a @ X5 )
| ( b @ X13 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 )
| ~ ( irel @ X2 @ X5 )
| ~ ( irel @ X1 @ X13 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_37,negated_conjecture,
irel @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_38,negated_conjecture,
~ ( a @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ esk5_0 )
| ~ ( irel @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_40,negated_conjecture,
irel @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_41,plain,
! [X55: $i] : ( irel @ X55 @ X55 ),
inference(variable_rename,[status(thm)],[refl_axiom]) ).
thf(c_0_42,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_34,c_0_35]),c_0_20]) ).
thf(c_0_43,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( b @ X1 )
| ( b @ X2 )
| ~ ( irel @ esk2_0 @ X1 )
| ~ ( irel @ X3 @ esk2_0 )
| ~ ( irel @ X3 @ X2 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
thf(c_0_44,negated_conjecture,
irel @ esk2_0 @ esk5_0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_45,plain,
! [X1: $i] : ( irel @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
thf(c_0_46,plain,
! [X44: $i] :
( ~ ! [X42: $i] :
( ( irel @ X44 @ X42 )
=> ( b @ X42 ) )
| ! [X43: $i] :
( ( irel @ X44 @ X43 )
=> ( ! [X40: $i] :
( ( irel @ X43 @ X40 )
=> ( ! [X38: $i] :
( ( irel @ X40 @ X38 )
=> ( b1 @ X38 ) )
| ! [X39: $i] :
( ( irel @ X40 @ X39 )
=> ( a1 @ X39 ) ) ) )
| ! [X41: $i] :
( ( irel @ X43 @ X41 )
=> ( b1 @ X41 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom2,c_0_21]),c_0_23]),c_0_42]),c_0_24]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i] :
( ( b @ esk5_0 )
| ( b @ X1 )
| ~ ( irel @ esk2_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
thf(c_0_48,plain,
! [X37: $i] : ( a2 @ X37 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom1,c_0_21]),c_0_24]) ).
thf(c_0_49,plain,
! [X60: $i,X62: $i,X63: $i,X64: $i,X65: $i,X66: $i] :
( ( ( irel @ X60 @ ( esk1_1 @ X60 ) )
| ~ ( irel @ X60 @ X62 )
| ~ ( irel @ X62 @ X63 )
| ~ ( irel @ X63 @ X64 )
| ( b1 @ X64 )
| ~ ( irel @ X63 @ X65 )
| ( a1 @ X65 )
| ~ ( irel @ X62 @ X66 )
| ( b1 @ X66 ) )
& ( ~ ( b @ ( esk1_1 @ X60 ) )
| ~ ( irel @ X60 @ X62 )
| ~ ( irel @ X62 @ X63 )
| ~ ( irel @ X63 @ X64 )
| ( b1 @ X64 )
| ~ ( irel @ X63 @ X65 )
| ( a1 @ X65 )
| ~ ( irel @ X62 @ X66 )
| ( b1 @ X66 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])])])]) ).
thf(c_0_50,negated_conjecture,
( ~ ( b @ esk5_0 )
| ~ ( a1 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_51,negated_conjecture,
b @ esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_44]) ).
thf(c_0_52,plain,
! [X59: $i] : ( a2 @ X59 ),
inference(variable_rename,[status(thm)],[c_0_48]) ).
thf(c_0_53,plain,
! [X1: $i,X3: $i,X2: $i,X13: $i,X5: $i,X16: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ( b1 @ X5 )
| ( a1 @ X13 )
| ( b1 @ X16 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 )
| ~ ( irel @ X3 @ X5 )
| ~ ( irel @ X3 @ X13 )
| ~ ( irel @ X2 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
thf(c_0_54,negated_conjecture,
~ ( a1 @ esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
thf(c_0_55,negated_conjecture,
( ~ ( b1 @ esk6_0 )
| ~ ( a2 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_56,plain,
! [X1: $i] : ( a2 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
thf(c_0_57,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X5: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ( b1 @ X2 )
| ( b1 @ X3 )
| ~ ( irel @ esk4_0 @ X2 )
| ~ ( irel @ X5 @ esk4_0 )
| ~ ( irel @ X5 @ X3 )
| ~ ( irel @ X1 @ X5 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_33]),c_0_54]) ).
thf(c_0_58,negated_conjecture,
irel @ esk4_0 @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_59,negated_conjecture,
~ ( b1 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
thf(c_0_60,negated_conjecture,
! [X2: $i,X1: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ( b1 @ X2 )
| ~ ( irel @ esk4_0 @ X2 )
| ~ ( irel @ X1 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_45])]),c_0_59]) ).
thf(c_0_61,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk1_1 @ X1 ) )
| ~ ( irel @ X1 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_58]),c_0_59]) ).
thf(c_0_62,negated_conjecture,
irel @ esk2_0 @ ( esk1_1 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_61,c_0_40]) ).
thf(c_0_63,negated_conjecture,
! [X1: $i] :
( ( b @ ( esk1_1 @ esk2_0 ) )
| ( b @ X1 )
| ~ ( irel @ esk2_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_62]),c_0_45])]) ).
thf(c_0_64,plain,
! [X1: $i,X3: $i,X2: $i,X13: $i,X5: $i,X16: $i] :
( ( b1 @ X5 )
| ( a1 @ X13 )
| ( b1 @ X16 )
| ~ ( b @ ( esk1_1 @ X1 ) )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 )
| ~ ( irel @ X3 @ X5 )
| ~ ( irel @ X3 @ X13 )
| ~ ( irel @ X2 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
thf(c_0_65,negated_conjecture,
b @ ( esk1_1 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_63,c_0_62]) ).
thf(c_0_66,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X5: $i,X13: $i] :
( ( b1 @ X1 )
| ( b1 @ X2 )
| ( a1 @ X3 )
| ~ ( irel @ esk2_0 @ X5 )
| ~ ( irel @ X13 @ X3 )
| ~ ( irel @ X13 @ X1 )
| ~ ( irel @ X5 @ X2 )
| ~ ( irel @ X5 @ X13 ) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
thf(c_0_67,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( b1 @ X1 )
| ( b1 @ X2 )
| ~ ( irel @ esk2_0 @ X3 )
| ~ ( irel @ esk4_0 @ X2 )
| ~ ( irel @ X3 @ esk4_0 )
| ~ ( irel @ X3 @ X1 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_33]),c_0_54]) ).
thf(c_0_68,negated_conjecture,
! [X1: $i] :
( ( b1 @ X1 )
| ~ ( irel @ esk4_0 @ X1 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_58]),c_0_40]),c_0_45])]),c_0_59]) ).
thf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO064^4.002 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 09:19:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # new_ho_10_cnf2 with pid 23907 completed with status 0
% 0.21/0.51 # Result found by new_ho_10_cnf2
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNS-FFSS11-SHSSMFNN
% 0.21/0.51 # partial match(2): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.21/0.51 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.51 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.51 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.51 # ehoh_best8_lambda with pid 23919 completed with status 0
% 0.21/0.51 # Result found by ehoh_best8_lambda
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNS-FFSS11-SHSSMFNN
% 0.21/0.51 # partial match(2): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.21/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.21/0.51 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.21/0.51 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.51 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 50
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 38
% 0.21/0.51 # Removed in clause preprocessing : 25
% 0.21/0.51 # Initial clauses in saturation : 13
% 0.21/0.51 # Processed clauses : 115
% 0.21/0.51 # ...of these trivial : 11
% 0.21/0.51 # ...subsumed : 25
% 0.21/0.51 # ...remaining for further processing : 79
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 7
% 0.21/0.51 # Backward-rewritten : 9
% 0.21/0.51 # Generated clauses : 243
% 0.21/0.51 # ...of the previous two non-redundant : 131
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 243
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 206
% 0.21/0.51 # ...of those cached : 187
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 50
% 0.21/0.51 # Positive orientable unit clauses : 18
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 3
% 0.21/0.51 # Non-unit-clauses : 29
% 0.21/0.51 # Current number of unprocessed clauses: 25
% 0.21/0.51 # ...number of literals in the above : 146
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 29
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 725
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 247
% 0.21/0.51 # Non-unit clause-clause subsumptions : 32
% 0.21/0.51 # Unit Clause-clause subsumption calls : 5
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 13
% 0.21/0.51 # BW rewrite match successes : 8
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 12970
% 0.21/0.51 # Search garbage collected termcells : 932
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.018 s
% 0.21/0.51 # Maximum resident set size: 1984 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.065 s
% 0.21/0.51 # System time : 0.015 s
% 0.21/0.51 # Total time : 0.080 s
% 0.21/0.51 # Maximum resident set size: 1784 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------