%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Thu Jul 21 06:03:39 EDT 2022
% Result : Theorem 0.50s 49.69s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 11
% Syntax : Number of formulae : 113 ( 10 unt; 0 def)
% Number of atoms : 423 ( 0 equ)
% Maximal formula atoms : 49 ( 3 avg)
% Number of connectives : 494 ( 184 ~; 275 |; 18 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 31 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> p(X2) ) )
<=> ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> ? [X3] :
( reachable(X2,X3)
& ! [X4] :
( reachable(X3,X4)
=> p(X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).
fof(reflexivity_of_reachable,axiom,
! [X1] : reachable(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_of_reachable) ).
fof(transitivity_of_reachable,axiom,
! [X1,X2,X3] :
( ( reachable(X1,X2)
& reachable(X2,X3) )
=> reachable(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',transitivity_of_reachable) ).
fof(c_0_3,negated_conjecture,
~ ( ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> p(X2) ) )
<=> ? [X1] :
( reachable(initial_world,X1)
& ! [X2] :
( reachable(X1,X2)
=> ? [X3] :
( reachable(X2,X3)
& ! [X4] :
( reachable(X3,X4)
=> p(X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_4,negated_conjecture,
! [X5,X7,X9,X12,X14,X16] :
( ( reachable(X7,esk2_1(X7))
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X9,esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( ~ p(esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| reachable(X5,esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X7,esk2_1(X7))
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(X9,esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( ~ p(esk3_2(X7,X9))
| ~ reachable(esk2_1(X7),X9)
| ~ reachable(initial_world,X7)
| ~ p(esk1_1(X5))
| ~ reachable(initial_world,X5) )
& ( reachable(initial_world,esk5_0)
| reachable(initial_world,esk4_0) )
& ( reachable(X14,esk6_1(X14))
| ~ reachable(esk5_0,X14)
| reachable(initial_world,esk4_0) )
& ( ~ reachable(esk6_1(X14),X16)
| p(X16)
| ~ reachable(esk5_0,X14)
| reachable(initial_world,esk4_0) )
& ( reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,X12)
| p(X12) )
& ( reachable(X14,esk6_1(X14))
| ~ reachable(esk5_0,X14)
| ~ reachable(esk4_0,X12)
| p(X12) )
& ( ~ reachable(esk6_1(X14),X16)
| p(X16)
| ~ reachable(esk5_0,X14)
| ~ reachable(esk4_0,X12)
| p(X12) ) ),
inference(distribute,[status(thm)],[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)],[c_0_3])])])])])])]) ).
fof(c_0_5,plain,
! [X2] : reachable(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity_of_reachable]) ).
fof(c_0_6,plain,
! [X4,X5,X6] :
( ~ reachable(X4,X5)
| ~ reachable(X5,X6)
| reachable(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_reachable])]) ).
cnf(c_0_7,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(X1,esk6_1(X1))
| ~ reachable(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
reachable(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( reachable(X1,X2)
| ~ reachable(X3,X2)
| ~ reachable(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( reachable(esk5_0,esk6_1(esk5_0))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
( ~ epred7_0
<=> ! [X1] :
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1) ) ),
introduced(definition) ).
cnf(c_0_12,negated_conjecture,
( reachable(X1,esk6_1(esk5_0))
| reachable(initial_world,esk4_0)
| ~ reachable(X1,esk5_0) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( reachable(initial_world,esk4_0)
| reachable(initial_world,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_14,plain,
( ~ epred4_0
<=> ! [X1] :
( ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1)) ) ),
introduced(definition) ).
cnf(c_0_15,negated_conjecture,
( epred7_0
| reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_equiv,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( reachable(initial_world,esk6_1(esk5_0))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
( ~ epred6_0
<=> ! [X2] :
( reachable(X2,esk6_1(X2))
| ~ reachable(esk5_0,X2) ) ),
introduced(definition) ).
cnf(c_0_18,negated_conjecture,
( epred4_0
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( reachable(initial_world,esk4_0)
| p(X2)
| ~ reachable(esk5_0,X1)
| ~ reachable(esk6_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
( epred7_0
| reachable(esk6_1(esk5_0),esk1_1(esk6_1(esk5_0)))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( epred6_0
| reachable(X1,esk6_1(X1))
| ~ reachable(esk5_0,X1) ),
inference(split_equiv,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
( ~ epred1_0
<=> ! [X1] :
( p(X1)
| ~ reachable(esk4_0,X1) ) ),
introduced(definition) ).
cnf(c_0_23,negated_conjecture,
( epred4_0
| reachable(initial_world,esk4_0)
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(pm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( epred7_0
| p(esk1_1(esk6_1(esk5_0)))
| reachable(initial_world,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_19,c_0_20]),c_0_8])]) ).
cnf(c_0_25,negated_conjecture,
( p(esk6_1(X1))
| reachable(initial_world,esk4_0)
| ~ reachable(esk5_0,X1) ),
inference(pm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( epred7_0
| reachable(esk5_0,esk1_1(esk5_0))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_27,negated_conjecture,
( epred6_0
| reachable(esk5_0,esk6_1(esk5_0)) ),
inference(pm,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( epred1_0
| p(X1)
| ~ reachable(esk4_0,X1) ),
inference(split_equiv,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( epred7_0
| epred4_0
| reachable(esk4_0,esk1_1(esk4_0))
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(pm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( epred4_0
| ~ p(esk1_1(esk6_1(esk5_0)))
| ~ p(esk1_1(esk4_0)) ),
inference(pm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( epred7_0
| p(esk1_1(esk6_1(esk5_0)))
| reachable(esk4_0,esk1_1(esk4_0)) ),
inference(pm,[status(thm)],[c_0_15,c_0_24]) ).
fof(c_0_32,plain,
( ~ epred8_0
<=> ! [X3,X2] :
( reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ) ),
introduced(definition) ).
fof(c_0_33,plain,
( ~ epred5_0
<=> ! [X2] :
( reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X2) ) ),
introduced(definition) ).
cnf(c_0_34,negated_conjecture,
( epred7_0
| p(esk6_1(esk1_1(esk5_0)))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( epred6_0
| reachable(X1,esk6_1(esk5_0))
| ~ reachable(X1,esk5_0) ),
inference(pm,[status(thm)],[c_0_9,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( p(X1)
| reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_37,negated_conjecture,
( p(X1)
| reachable(X2,esk6_1(X2))
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_38,negated_conjecture,
( epred7_0
| epred4_0
| epred1_0
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( epred7_0
| epred1_0
| p(esk1_1(esk6_1(esk5_0)))
| p(esk1_1(esk4_0)) ),
inference(pm,[status(thm)],[c_0_28,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( epred7_0
| epred4_0
| ~ p(esk1_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_18,c_0_24]),c_0_30]) ).
fof(c_0_41,plain,
( ~ epred3_0
<=> ! [X3,X2] :
( ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ) ),
introduced(definition) ).
cnf(c_0_42,negated_conjecture,
( epred8_0
| reachable(X1,esk3_2(X2,X1))
| ~ reachable(esk2_1(X2),X1)
| ~ reachable(initial_world,X2) ),
inference(split_equiv,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( epred5_0
| reachable(X1,esk2_1(X1))
| ~ reachable(initial_world,X1) ),
inference(split_equiv,[status(thm)],[c_0_33]) ).
fof(c_0_44,plain,
( ~ epred2_0
<=> ! [X3,X2] :
( p(X3)
| ~ reachable(esk5_0,X2)
| ~ reachable(esk6_1(X2),X3) ) ),
introduced(definition) ).
cnf(c_0_45,negated_conjecture,
( epred4_0
| reachable(X1,esk4_0)
| ~ p(esk1_1(esk6_1(esk5_0)))
| ~ reachable(X1,initial_world) ),
inference(pm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_46,negated_conjecture,
( epred7_0
| p(esk6_1(esk1_1(esk5_0)))
| reachable(esk4_0,esk1_1(esk4_0)) ),
inference(pm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_47,negated_conjecture,
( epred6_0
| epred4_0
| ~ p(esk1_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0) ),
inference(pm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_48,negated_conjecture,
( epred7_0
| epred4_0
| reachable(initial_world,esk5_0)
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_29]),c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( ~ epred6_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_37,c_0_22]),c_0_17]) ).
cnf(c_0_50,negated_conjecture,
( epred7_0
| epred4_0
| epred1_0 ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_51,negated_conjecture,
( p(X1)
| p(X3)
| ~ reachable(esk4_0,X1)
| ~ reachable(esk5_0,X2)
| ~ reachable(esk6_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_52,negated_conjecture,
( epred3_0
| ~ p(esk3_2(X1,X2))
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(initial_world,X1) ),
inference(split_equiv,[status(thm)],[c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( epred8_0
| p(esk3_2(X1,esk6_1(X2)))
| reachable(initial_world,esk4_0)
| ~ reachable(esk2_1(X1),esk6_1(X2))
| ~ reachable(esk5_0,X2)
| ~ reachable(initial_world,X1) ),
inference(pm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_54,negated_conjecture,
( epred5_0
| reachable(esk5_0,esk2_1(esk5_0))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_55,negated_conjecture,
( epred2_0
| p(X1)
| ~ reachable(esk6_1(X2),X1)
| ~ reachable(esk5_0,X2) ),
inference(split_equiv,[status(thm)],[c_0_44]) ).
cnf(c_0_56,negated_conjecture,
( epred7_0
| epred6_0
| reachable(esk6_1(esk5_0),esk1_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0) ),
inference(pm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_57,negated_conjecture,
( epred7_0
| epred4_0
| reachable(esk4_0,esk1_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_15,c_0_45]),c_0_8])]),c_0_31]) ).
cnf(c_0_58,negated_conjecture,
( epred7_0
| p(esk6_1(esk1_1(esk5_0)))
| p(esk1_1(esk4_0))
| reachable(initial_world,esk5_0) ),
inference(pm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_59,negated_conjecture,
( epred7_0
| epred6_0
| epred4_0
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(pm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_60,negated_conjecture,
( epred7_0
| epred4_0
| ~ epred6_0 ),
inference(pm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_61,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_51,c_0_22]),c_0_44]) ).
cnf(c_0_62,negated_conjecture,
( epred8_0
| epred3_0
| reachable(initial_world,esk4_0)
| ~ reachable(esk2_1(X1),esk6_1(X2))
| ~ reachable(initial_world,X1)
| ~ reachable(esk5_0,X2) ),
inference(pm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,negated_conjecture,
( epred5_0
| reachable(esk2_1(esk5_0),esk6_1(esk2_1(esk5_0)))
| reachable(initial_world,esk4_0) ),
inference(pm,[status(thm)],[c_0_7,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_65,negated_conjecture,
( epred7_0
| epred6_0
| epred2_0
| p(esk1_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_56]),c_0_8])]) ).
cnf(c_0_66,negated_conjecture,
( epred7_0
| epred4_0
| reachable(initial_world,esk5_0) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_57]),c_0_40]) ).
cnf(c_0_67,negated_conjecture,
( epred7_0
| epred4_0
| ~ p(esk1_1(esk6_1(esk5_0))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_47,c_0_58]),c_0_59]),c_0_59]),c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( epred7_0
| epred4_0
| ~ epred2_0 ),
inference(pm,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_69,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X2,esk2_1(X2))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_70,negated_conjecture,
( epred8_0
| epred5_0
| epred3_0
| reachable(initial_world,esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_62,c_0_63]),c_0_43]),c_0_13]) ).
cnf(c_0_71,negated_conjecture,
( ~ epred5_0
| ~ epred4_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_64,c_0_33]),c_0_14]) ).
cnf(c_0_72,negated_conjecture,
( epred7_0
| epred4_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68]),c_0_60]) ).
cnf(c_0_73,negated_conjecture,
( ~ epred7_0
| ~ epred5_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_69,c_0_11]),c_0_33]) ).
cnf(c_0_74,negated_conjecture,
( reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_75,negated_conjecture,
( reachable(X1,esk1_1(X1))
| reachable(X3,esk3_2(X2,X3))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_76,negated_conjecture,
( epred8_0
| reachable(X1,esk3_2(X2,X3))
| ~ reachable(esk2_1(X2),X3)
| ~ reachable(initial_world,X2)
| ~ reachable(X1,X3) ),
inference(pm,[status(thm)],[c_0_9,c_0_42]) ).
cnf(c_0_77,negated_conjecture,
( epred8_0
| epred5_0
| epred3_0
| reachable(esk4_0,esk2_1(esk4_0)) ),
inference(pm,[status(thm)],[c_0_43,c_0_70]) ).
cnf(c_0_78,negated_conjecture,
~ epred5_0,
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( ~ epred8_0
| ~ epred4_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_74,c_0_32]),c_0_14]) ).
cnf(c_0_80,negated_conjecture,
( ~ epred8_0
| ~ epred7_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_75,c_0_32]),c_0_11]) ).
cnf(c_0_81,negated_conjecture,
( epred8_0
| epred1_0
| p(esk3_2(X1,X2))
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(initial_world,X1)
| ~ reachable(esk4_0,X2) ),
inference(pm,[status(thm)],[c_0_28,c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( epred8_0
| epred3_0
| reachable(esk4_0,esk2_1(esk4_0)) ),
inference(sr,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,negated_conjecture,
~ epred8_0,
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_79,c_0_72]),c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( epred8_0
| epred3_0
| epred1_0
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(initial_world,X1)
| ~ reachable(esk4_0,X2) ),
inference(pm,[status(thm)],[c_0_52,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( epred3_0
| reachable(esk4_0,esk2_1(esk4_0)) ),
inference(sr,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
( epred8_0
| epred3_0
| reachable(initial_world,esk4_0) ),
inference(sr,[status(thm)],[c_0_70,c_0_78]) ).
cnf(c_0_87,negated_conjecture,
( epred3_0
| epred1_0
| ~ reachable(esk4_0,esk2_1(X1))
| ~ reachable(initial_world,X1) ),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_84,c_0_8]),c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( epred3_0
| reachable(X1,esk2_1(esk4_0))
| ~ reachable(X1,esk4_0) ),
inference(pm,[status(thm)],[c_0_9,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
( epred3_0
| reachable(initial_world,esk4_0) ),
inference(sr,[status(thm)],[c_0_86,c_0_83]) ).
cnf(c_0_90,negated_conjecture,
( epred8_0
| epred2_0
| p(esk3_2(X1,X2))
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(esk6_1(X3),X2)
| ~ reachable(esk5_0,X3)
| ~ reachable(initial_world,X1) ),
inference(pm,[status(thm)],[c_0_55,c_0_76]) ).
cnf(c_0_91,negated_conjecture,
( epred6_0
| epred5_0
| reachable(esk6_1(esk5_0),esk2_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0) ),
inference(pm,[status(thm)],[c_0_43,c_0_35]) ).
cnf(c_0_92,negated_conjecture,
( epred8_0
| p(esk3_2(X1,X2))
| reachable(initial_world,esk5_0)
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(initial_world,X1)
| ~ reachable(esk4_0,X2) ),
inference(pm,[status(thm)],[c_0_36,c_0_76]) ).
cnf(c_0_93,negated_conjecture,
( ~ reachable(initial_world,X1)
| ~ p(esk1_1(X1))
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_94,negated_conjecture,
( epred3_0
| epred1_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_87,c_0_88]),c_0_8])]),c_0_89]) ).
cnf(c_0_95,negated_conjecture,
( reachable(X1,esk1_1(X1))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X2)
| ~ reachable(esk2_1(X2),X3)
| ~ p(esk3_2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_96,negated_conjecture,
( epred8_0
| epred6_0
| epred5_0
| epred2_0
| p(esk3_2(X1,esk2_1(esk6_1(esk5_0))))
| ~ reachable(esk2_1(X1),esk2_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0)
| ~ reachable(initial_world,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_90,c_0_91]),c_0_8])]) ).
cnf(c_0_97,negated_conjecture,
( epred8_0
| epred3_0
| reachable(initial_world,esk5_0)
| ~ reachable(esk2_1(X1),X2)
| ~ reachable(initial_world,X1)
| ~ reachable(esk4_0,X2) ),
inference(pm,[status(thm)],[c_0_52,c_0_92]) ).
cnf(c_0_98,negated_conjecture,
( ~ epred4_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_93,c_0_41]),c_0_14]) ).
cnf(c_0_99,negated_conjecture,
( epred3_0
| ~ epred6_0 ),
inference(pm,[status(thm)],[c_0_49,c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( ~ epred7_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_95,c_0_11]),c_0_41]) ).
cnf(c_0_101,negated_conjecture,
( epred6_0
| epred3_0
| epred2_0
| ~ reachable(esk2_1(X1),esk2_1(esk6_1(esk5_0)))
| ~ reachable(initial_world,esk5_0)
| ~ reachable(initial_world,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_96]),c_0_83]),c_0_78]) ).
cnf(c_0_102,negated_conjecture,
( epred3_0
| reachable(initial_world,esk5_0)
| ~ reachable(esk4_0,esk2_1(X1))
| ~ reachable(initial_world,X1) ),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_97,c_0_8]),c_0_83]) ).
cnf(c_0_103,negated_conjecture,
( ~ epred6_0
| ~ epred4_0 ),
inference(pm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_104,negated_conjecture,
( ~ epred7_0
| ~ epred6_0 ),
inference(pm,[status(thm)],[c_0_100,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
( epred6_0
| epred3_0
| epred2_0
| ~ reachable(initial_world,esk5_0) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_101,c_0_8]),c_0_35]) ).
cnf(c_0_106,negated_conjecture,
( epred3_0
| reachable(initial_world,esk5_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_102,c_0_88]),c_0_8])]),c_0_89]) ).
cnf(c_0_107,negated_conjecture,
~ epred6_0,
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_103,c_0_72]),c_0_104]) ).
cnf(c_0_108,negated_conjecture,
( epred3_0
| ~ epred2_0 ),
inference(pm,[status(thm)],[c_0_61,c_0_94]) ).
cnf(c_0_109,negated_conjecture,
epred3_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108]) ).
cnf(c_0_110,negated_conjecture,
~ epred7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_109])]) ).
cnf(c_0_111,negated_conjecture,
~ epred4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_109])]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_72,c_0_110]),c_0_111]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 03:57:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.47 eprover: CPU time limit exceeded, terminating
% 0.49/46.42 eprover: CPU time limit exceeded, terminating
% 0.49/46.42 eprover: CPU time limit exceeded, terminating
% 0.49/46.43 eprover: CPU time limit exceeded, terminating
% 0.49/46.48 eprover: CPU time limit exceeded, terminating
% 0.50/49.69 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.50/49.69
% 0.50/49.69 # Failure: Resource limit exceeded (time)
% 0.50/49.69 # OLD status Res
% 0.50/49.69 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.50/49.69 # Preprocessing time : 0.015 s
% 0.50/49.69 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.50/49.69
% 0.50/49.69 # Failure: Resource limit exceeded (time)
% 0.50/49.69 # OLD status Res
% 0.50/49.69 # Preprocessing time : 0.007 s
% 0.50/49.69 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.50/49.69 # Preprocessing time : 0.014 s
% 0.50/49.69
% 0.50/49.69 # Proof found!
% 0.50/49.69 # SZS status Theorem
% 0.50/49.69 # SZS output start CNFRefutation
% See solution above
% 0.50/49.69 # Proof object total steps : 113
% 0.50/49.69 # Proof object clause steps : 98
% 0.50/49.69 # Proof object formula steps : 15
% 0.50/49.69 # Proof object conjectures : 99
% 0.50/49.69 # Proof object clause conjectures : 96
% 0.50/49.69 # Proof object formula conjectures : 3
% 0.50/49.69 # Proof object initial clauses used : 22
% 0.50/49.69 # Proof object initial formulas used : 3
% 0.50/49.69 # Proof object generating inferences : 61
% 0.50/49.69 # Proof object simplifying inferences : 64
% 0.50/49.69 # Training examples: 0 positive, 0 negative
% 0.50/49.69 # Parsed axioms : 3
% 0.50/49.69 # Removed by relevancy pruning/SinE : 0
% 0.50/49.69 # Initial clauses : 14
% 0.50/49.69 # Removed in clause preprocessing : 0
% 0.50/49.69 # Initial clauses in saturation : 14
% 0.50/49.69 # Processed clauses : 10517
% 0.50/49.69 # ...of these trivial : 8
% 0.50/49.69 # ...subsumed : 5943
% 0.50/49.69 # ...remaining for further processing : 4565
% 0.50/49.69 # Other redundant clauses eliminated : 0
% 0.50/49.69 # Clauses deleted for lack of memory : 0
% 0.50/49.69 # Backward-subsumed : 876
% 0.50/49.69 # Backward-rewritten : 36
% 0.50/49.69 # Generated clauses : 107387
% 0.50/49.69 # ...of the previous two non-trivial : 107032
% 0.50/49.69 # Contextual simplify-reflections : 10473
% 0.50/49.69 # Paramodulations : 106190
% 0.50/49.69 # Factorizations : 0
% 0.50/49.69 # Equation resolutions : 0
% 0.50/49.69 # Current number of processed clauses : 2652
% 0.50/49.69 # Positive orientable unit clauses : 15
% 0.50/49.69 # Positive unorientable unit clauses: 0
% 0.50/49.69 # Negative unit clauses : 12
% 0.50/49.69 # Non-unit-clauses : 2625
% 0.50/49.69 # Current number of unprocessed clauses: 61098
% 0.50/49.69 # ...number of literals in the above : 512703
% 0.50/49.69 # Current number of archived formulas : 0
% 0.50/49.69 # Current number of archived clauses : 1713
% 0.50/49.69 # Clause-clause subsumption calls (NU) : 4297682
% 0.50/49.69 # Rec. Clause-clause subsumption calls : 591496
% 0.50/49.69 # Non-unit clause-clause subsumptions : 17692
% 0.50/49.69 # Unit Clause-clause subsumption calls : 25809
% 0.50/49.69 # Rewrite failures with RHS unbound : 0
% 0.50/49.69 # BW rewrite match attempts : 68
% 0.50/49.69 # BW rewrite match successes : 7
% 0.50/49.69 # Condensation attempts : 0
% 0.50/49.69 # Condensation successes : 0
% 0.50/49.69 # Termbank termtop insertions : 959571
% 0.50/49.69
% 0.50/49.69 # -------------------------------------------------
% 0.50/49.69 # User time : 2.294 s
% 0.50/49.69 # System time : 0.049 s
% 0.50/49.69 # Total time : 2.343 s
% 0.50/49.69 # Maximum resident set size: 71016 pages
% 0.53/69.44 eprover: CPU time limit exceeded, terminating
% 0.53/69.44 eprover: CPU time limit exceeded, terminating
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.52 eprover: CPU time limit exceeded, terminating
% 0.53/69.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.54 eprover: No such file or directory
% 0.53/69.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.54 eprover: No such file or directory
% 0.53/69.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.55 eprover: No such file or directory
% 0.53/69.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.56 eprover: No such file or directory
% 0.53/69.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.56 eprover: No such file or directory
% 0.53/69.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.57 eprover: No such file or directory
% 0.53/69.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.57 eprover: No such file or directory
% 0.53/69.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.58 eprover: No such file or directory
% 0.53/69.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.53/69.59 eprover: No such file or directory
%------------------------------------------------------------------------------