TSTP Solution File: PUZ008-3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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 : Wed May 31 12:31:45 EDT 2023
% Result : Unsatisfiable 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 33
% Syntax : Number of formulae : 118 ( 27 unt; 0 def)
% Number of atoms : 275 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 286 ( 129 ~; 136 |; 0 &)
% ( 21 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 25 ( 24 usr; 22 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 69 (; 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : safe(n0,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y] :
( ~ greater_or_equal(X,Y)
| safe(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] : greater_or_equal(X,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] :
( greater_or_equal(s(X),s(Y))
| ~ greater_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(W))))
| ~ safe(X,s(Y))
| ~ safe(Z,W)
| achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(W)))
| ~ safe(X,Y)
| ~ safe(Z,s(s(W)))
| achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(W))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(W)))
| ~ safe(s(X),Y)
| ~ safe(Z,W)
| achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W)))
| ~ safe(X,Y)
| ~ safe(s(s(Z)),W)
| achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W)))
| ~ safe(X,Y)
| ~ safe(s(Z),s(W))
| achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [X,Y,Z,W] :
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W))))
| ~ safe(s(X),s(Y))
| ~ safe(Z,W)
| achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
! [X] : ~ achievable(west(m(n0),c(n0)),X,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,plain,
! [X0] : safe(n0,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f18,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f19,plain,
! [X0] : greater_or_equal(X0,n0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f20,plain,
! [X0,X1] :
( greater_or_equal(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f22,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f23,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(X2,s(s(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3))) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(s(X2)),X3)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f31,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f32,plain,
! [X0] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f33,plain,
! [X0] : safe(X0,n0),
inference(resolution,[status(thm)],[f18,f19]) ).
fof(f34,plain,
! [X0] : greater_or_equal(s(X0),s(n0)),
inference(resolution,[status(thm)],[f20,f19]) ).
fof(f35,plain,
! [X0] : greater_or_equal(s(s(X0)),s(s(n0))),
inference(resolution,[status(thm)],[f34,f20]) ).
fof(f36,plain,
! [X0] : safe(s(X0),s(n0)),
inference(resolution,[status(thm)],[f34,f18]) ).
fof(f37,plain,
! [X0] : greater_or_equal(s(s(s(X0))),s(s(s(n0)))),
inference(resolution,[status(thm)],[f35,f20]) ).
fof(f38,plain,
! [X0] : safe(s(s(X0)),s(s(n0))),
inference(resolution,[status(thm)],[f35,f18]) ).
fof(f40,plain,
! [X0] : safe(s(s(s(X0))),s(s(s(n0)))),
inference(resolution,[status(thm)],[f37,f18]) ).
fof(f45,plain,
( spl0_0
<=> safe(s(s(s(n0))),s(s(n0))) ),
introduced(split_symbol_definition) ).
fof(f47,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| spl0_0 ),
inference(component_clause,[status(thm)],[f45]) ).
fof(f48,plain,
( spl0_1
<=> safe(n0,s(n0)) ),
introduced(split_symbol_definition) ).
fof(f50,plain,
( ~ safe(n0,s(n0))
| spl0_1 ),
inference(component_clause,[status(thm)],[f48]) ).
fof(f56,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f50,f17]) ).
fof(f57,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f56]) ).
fof(f58,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f47,f38]) ).
fof(f59,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f58]) ).
fof(f74,plain,
( spl0_3
<=> safe(s(s(s(n0))),s(n0)) ),
introduced(split_symbol_definition) ).
fof(f76,plain,
( ~ safe(s(s(s(n0))),s(n0))
| spl0_3 ),
inference(component_clause,[status(thm)],[f74]) ).
fof(f77,plain,
( spl0_4
<=> safe(n0,s(s(n0))) ),
introduced(split_symbol_definition) ).
fof(f79,plain,
( ~ safe(n0,s(s(n0)))
| spl0_4 ),
inference(component_clause,[status(thm)],[f77]) ).
fof(f80,plain,
( spl0_5
<=> achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
introduced(split_symbol_definition) ).
fof(f81,plain,
( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f80]) ).
fof(f83,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(resolution,[status(thm)],[f23,f31]) ).
fof(f84,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f83,f74,f77,f80]) ).
fof(f85,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f79,f17]) ).
fof(f86,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f85]) ).
fof(f87,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f76,f36]) ).
fof(f88,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f87]) ).
fof(f102,plain,
( spl0_9
<=> safe(s(s(s(n0))),s(s(s(n0)))) ),
introduced(split_symbol_definition) ).
fof(f104,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| spl0_9 ),
inference(component_clause,[status(thm)],[f102]) ).
fof(f105,plain,
( spl0_10
<=> safe(n0,n0) ),
introduced(split_symbol_definition) ).
fof(f107,plain,
( ~ safe(n0,n0)
| spl0_10 ),
inference(component_clause,[status(thm)],[f105]) ).
fof(f113,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f107,f17]) ).
fof(f114,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f113]) ).
fof(f115,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f104,f40]) ).
fof(f116,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f115]) ).
fof(f119,plain,
( spl0_12
<=> achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
introduced(split_symbol_definition) ).
fof(f120,plain,
( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f119]) ).
fof(f122,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f81,f22]) ).
fof(f123,plain,
( ~ spl0_0
| ~ spl0_1
| spl0_12
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f122,f45,f48,f119,f80]) ).
fof(f124,plain,
( spl0_13
<=> safe(s(s(n0)),s(s(n0))) ),
introduced(split_symbol_definition) ).
fof(f126,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| spl0_13 ),
inference(component_clause,[status(thm)],[f124]) ).
fof(f127,plain,
( spl0_14
<=> safe(s(n0),s(n0)) ),
introduced(split_symbol_definition) ).
fof(f129,plain,
( ~ safe(s(n0),s(n0))
| spl0_14 ),
inference(component_clause,[status(thm)],[f127]) ).
fof(f135,plain,
( spl0_16
<=> safe(s(s(s(n0))),n0) ),
introduced(split_symbol_definition) ).
fof(f137,plain,
( ~ safe(s(s(s(n0))),n0)
| spl0_16 ),
inference(component_clause,[status(thm)],[f135]) ).
fof(f138,plain,
( spl0_17
<=> safe(n0,s(s(s(n0)))) ),
introduced(split_symbol_definition) ).
fof(f140,plain,
( ~ safe(n0,s(s(s(n0))))
| spl0_17 ),
inference(component_clause,[status(thm)],[f138]) ).
fof(f141,plain,
( spl0_18
<=> achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
introduced(split_symbol_definition) ).
fof(f142,plain,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ spl0_18 ),
inference(component_clause,[status(thm)],[f141]) ).
fof(f144,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ spl0_12 ),
inference(resolution,[status(thm)],[f120,f23]) ).
fof(f145,plain,
( ~ spl0_16
| ~ spl0_17
| spl0_18
| ~ spl0_12 ),
inference(split_clause,[status(thm)],[f144,f135,f138,f141,f119]) ).
fof(f148,plain,
( $false
| spl0_17 ),
inference(forward_subsumption_resolution,[status(thm)],[f140,f17]) ).
fof(f149,plain,
spl0_17,
inference(contradiction_clause,[status(thm)],[f148]) ).
fof(f150,plain,
( $false
| spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f137,f33]) ).
fof(f151,plain,
spl0_16,
inference(contradiction_clause,[status(thm)],[f150]) ).
fof(f152,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f129,f36]) ).
fof(f153,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f152]) ).
fof(f154,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f126,f38]) ).
fof(f155,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f154]) ).
fof(f158,plain,
( spl0_19
<=> achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
introduced(split_symbol_definition) ).
fof(f159,plain,
( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f158]) ).
fof(f161,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ spl0_18 ),
inference(resolution,[status(thm)],[f142,f22]) ).
fof(f162,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_19
| ~ spl0_18 ),
inference(split_clause,[status(thm)],[f161,f74,f77,f158,f141]) ).
fof(f185,plain,
( spl0_24
<=> achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
introduced(split_symbol_definition) ).
fof(f186,plain,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ spl0_24 ),
inference(component_clause,[status(thm)],[f185]) ).
fof(f188,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ spl0_19 ),
inference(resolution,[status(thm)],[f27,f159]) ).
fof(f189,plain,
( ~ spl0_14
| ~ spl0_13
| spl0_24
| ~ spl0_19 ),
inference(split_clause,[status(thm)],[f188,f127,f124,f185,f158]) ).
fof(f236,plain,
( spl0_33
<=> achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
introduced(split_symbol_definition) ).
fof(f237,plain,
( achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ spl0_33 ),
inference(component_clause,[status(thm)],[f236]) ).
fof(f239,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ spl0_24 ),
inference(resolution,[status(thm)],[f30,f186]) ).
fof(f240,plain,
( ~ spl0_13
| ~ spl0_14
| spl0_33
| ~ spl0_24 ),
inference(split_clause,[status(thm)],[f239,f124,f127,f236,f185]) ).
fof(f243,plain,
( spl0_34
<=> achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
introduced(split_symbol_definition) ).
fof(f244,plain,
( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_34 ),
inference(component_clause,[status(thm)],[f243]) ).
fof(f246,plain,
( ~ safe(n0,s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_33 ),
inference(resolution,[status(thm)],[f237,f27]) ).
fof(f247,plain,
( ~ spl0_4
| ~ spl0_3
| spl0_34
| ~ spl0_33 ),
inference(split_clause,[status(thm)],[f246,f77,f74,f243,f236]) ).
fof(f262,plain,
( spl0_35
<=> achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
introduced(split_symbol_definition) ).
fof(f263,plain,
( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ spl0_35 ),
inference(component_clause,[status(thm)],[f262]) ).
fof(f265,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ safe(s(s(s(n0))),n0)
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ spl0_34 ),
inference(resolution,[status(thm)],[f244,f22]) ).
fof(f266,plain,
( ~ spl0_17
| ~ spl0_16
| spl0_35
| ~ spl0_34 ),
inference(split_clause,[status(thm)],[f265,f138,f135,f262,f243]) ).
fof(f267,plain,
( spl0_36
<=> achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
introduced(split_symbol_definition) ).
fof(f268,plain,
( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ spl0_36 ),
inference(component_clause,[status(thm)],[f267]) ).
fof(f270,plain,
( ~ safe(n0,s(n0))
| ~ safe(s(s(s(n0))),s(s(n0)))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ spl0_35 ),
inference(resolution,[status(thm)],[f263,f23]) ).
fof(f271,plain,
( ~ spl0_1
| ~ spl0_0
| spl0_36
| ~ spl0_35 ),
inference(split_clause,[status(thm)],[f270,f48,f45,f267,f262]) ).
fof(f278,plain,
( spl0_37
<=> achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
introduced(split_symbol_definition) ).
fof(f279,plain,
( achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
| ~ spl0_37 ),
inference(component_clause,[status(thm)],[f278]) ).
fof(f281,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
| ~ spl0_36 ),
inference(resolution,[status(thm)],[f268,f26]) ).
fof(f282,plain,
( ~ spl0_14
| ~ spl0_13
| spl0_37
| ~ spl0_36 ),
inference(split_clause,[status(thm)],[f281,f127,f124,f278,f267]) ).
fof(f290,plain,
( spl0_39
<=> achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
introduced(split_symbol_definition) ).
fof(f291,plain,
( achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))
| ~ spl0_39 ),
inference(component_clause,[status(thm)],[f290]) ).
fof(f293,plain,
( ~ safe(n0,n0)
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))
| ~ spl0_37 ),
inference(resolution,[status(thm)],[f279,f29]) ).
fof(f294,plain,
( ~ spl0_10
| ~ spl0_9
| spl0_39
| ~ spl0_37 ),
inference(split_clause,[status(thm)],[f293,f105,f102,f290,f278]) ).
fof(f302,plain,
( $false
| ~ spl0_39 ),
inference(forward_subsumption_resolution,[status(thm)],[f291,f32]) ).
fof(f303,plain,
~ spl0_39,
inference(contradiction_clause,[status(thm)],[f302]) ).
fof(f304,plain,
$false,
inference(sat_refutation,[status(thm)],[f57,f59,f84,f86,f88,f114,f116,f123,f145,f149,f151,f153,f155,f162,f189,f240,f247,f266,f271,f282,f294,f303]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n015.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 10:47:04 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.07/0.26 % Drodi V3.5.1
% 0.07/0.27 % Refutation found
% 0.07/0.27 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.07/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.28 % Elapsed time: 0.014477 seconds
% 0.07/0.28 % CPU time: 0.030499 seconds
% 0.07/0.28 % Memory used: 8.809 MB
%------------------------------------------------------------------------------