%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:31:04 PM UTC 2026
% Result : Unsatisfiable 1.73s 1.11s
% Output : Refutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 26
% Syntax : Number of formulae : 121 ( 27 unt; 14 def)
% Number of atoms : 277 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 299 ( 143 ~; 142 |; 0 &)
% ( 14 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 18 ( 17 usr; 15 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : safe(n0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
fof(f2,axiom,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
fof(f3,axiom,
! [X0] : greater_or_equal(X0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base) ).
fof(f4,axiom,
! [X0,X1] :
( greater_or_equal(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ safe(X0,X1)
| ~ safe(X2,s(s(X3)))
| ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_east_to_west) ).
fof(f11,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(s(X2)),X3)
| ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
fof(f13,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
fof(f15,axiom,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',start_on_west_bank) ).
fof(f16,negated_conjecture,
! [X0] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
fof(f17,plain,
! [X0] : safe(X0,n0),
inference(resolution,[],[f2,f3]) ).
fof(f18,plain,
! [X0,X1] :
( safe(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
inference(resolution,[],[f4,f2]) ).
fof(f25,definition,
( spl0_2
<=> safe(s(s(s(n0))),s(s(s(n0)))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f26,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| spl0_2 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f35,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| spl0_2 ),
inference(resolution,[],[f26,f18]) ).
fof(f36,plain,
( ~ greater_or_equal(s(n0),s(n0))
| spl0_2 ),
inference(resolution,[],[f35,f4]) ).
fof(f38,plain,
( ~ greater_or_equal(n0,n0)
| spl0_2 ),
inference(resolution,[],[f36,f4]) ).
fof(f39,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f38,f3]) ).
fof(f40,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f39]) ).
fof(f57,definition,
( spl0_6
<=> achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f58,plain,
( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| spl0_6 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f60,definition,
( spl0_7
<=> safe(s(s(s(n0))),s(n0)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f61,plain,
( ~ safe(s(s(s(n0))),s(n0))
| spl0_7 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f73,plain,
( ~ safe(n0,n0)
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(resolution,[],[f13,f16]) ).
fof(f74,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[],[f73,f1]) ).
fof(f76,definition,
( spl0_10
<=> achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f77,plain,
( ~ achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
| spl0_10 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f78,plain,
( ~ spl0_10
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f74,f25,f76]) ).
fof(f80,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(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_10 ),
inference(resolution,[],[f77,f10]) ).
fof(f82,definition,
( spl0_11
<=> safe(s(s(n0)),s(s(n0))) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f83,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| spl0_11 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f85,definition,
( spl0_12
<=> safe(s(n0),s(n0)) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f86,plain,
( ~ safe(s(n0),s(n0))
| spl0_12 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f87,plain,
( ~ spl0_6
| ~ spl0_11
| ~ spl0_12
| spl0_10 ),
inference(avatar_split_clause,[],[f80,f76,f85,f82,f57]) ).
fof(f93,plain,
( ~ safe(n0,s(n0))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| spl0_6 ),
inference(resolution,[],[f58,f7]) ).
fof(f95,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f93,f1]) ).
fof(f99,definition,
( spl0_13
<=> achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f100,plain,
( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| spl0_13 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f102,definition,
( spl0_14
<=> safe(s(s(s(n0))),s(s(n0))) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f103,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| spl0_14 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f104,plain,
( ~ spl0_13
| ~ spl0_14
| spl0_6 ),
inference(avatar_split_clause,[],[f95,f57,f102,f99]) ).
fof(f130,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| spl0_14 ),
inference(resolution,[],[f103,f18]) ).
fof(f132,plain,
( ~ greater_or_equal(s(n0),n0)
| spl0_14 ),
inference(resolution,[],[f130,f4]) ).
fof(f133,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[],[f132,f3]) ).
fof(f134,plain,
spl0_14,
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f136,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ safe(s(s(s(n0))),n0)
| ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| spl0_13 ),
inference(resolution,[],[f100,f6]) ).
fof(f137,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| spl0_13 ),
inference(forward_subsumption_resolution,[],[f136,f1]) ).
fof(f138,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| spl0_13 ),
inference(forward_subsumption_resolution,[],[f137,f17]) ).
fof(f145,definition,
( spl0_19
<=> achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f146,plain,
( ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| spl0_19 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f163,definition,
( spl0_23
<=> achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f164,plain,
( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| spl0_23 ),
inference(avatar_component_clause,[],[f163]) ).
fof(f168,plain,
( ~ spl0_23
| spl0_13 ),
inference(avatar_split_clause,[],[f138,f99,f163]) ).
fof(f170,plain,
( ~ safe(n0,s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| spl0_23 ),
inference(resolution,[],[f164,f11]) ).
fof(f173,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| spl0_23 ),
inference(forward_subsumption_resolution,[],[f170,f1]) ).
fof(f176,definition,
( spl0_24
<=> achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
introduced(definition,[new_symbols(definition,[spl0_24])],[avatar_definition]) ).
fof(f177,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| spl0_24 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f178,plain,
( ~ spl0_24
| ~ spl0_7
| spl0_23 ),
inference(avatar_split_clause,[],[f173,f163,f60,f176]) ).
fof(f183,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| spl0_7 ),
inference(resolution,[],[f61,f18]) ).
fof(f184,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f183,f3]) ).
fof(f185,plain,
spl0_7,
inference(avatar_contradiction_clause,[],[f184]) ).
fof(f186,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| spl0_24 ),
inference(resolution,[],[f177,f14]) ).
fof(f200,plain,
( ~ spl0_19
| ~ spl0_12
| ~ spl0_11
| spl0_24 ),
inference(avatar_split_clause,[],[f186,f176,f82,f85,f145]) ).
fof(f201,plain,
( ~ greater_or_equal(s(n0),s(n0))
| spl0_11 ),
inference(resolution,[],[f83,f18]) ).
fof(f202,plain,
( ~ greater_or_equal(n0,n0)
| spl0_11 ),
inference(resolution,[],[f201,f4]) ).
fof(f203,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[],[f202,f3]) ).
fof(f204,plain,
spl0_11,
inference(avatar_contradiction_clause,[],[f203]) ).
fof(f205,plain,
( ~ greater_or_equal(n0,n0)
| spl0_12 ),
inference(resolution,[],[f86,f18]) ).
fof(f206,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[],[f205,f3]) ).
fof(f207,plain,
spl0_12,
inference(avatar_contradiction_clause,[],[f206]) ).
fof(f209,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| spl0_19 ),
inference(resolution,[],[f146,f11]) ).
fof(f215,definition,
( spl0_28
<=> achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).
fof(f216,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| spl0_28 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f217,plain,
( ~ spl0_28
| ~ spl0_11
| ~ spl0_12
| spl0_19 ),
inference(avatar_split_clause,[],[f209,f145,f85,f82,f215]) ).
fof(f232,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| spl0_28 ),
inference(resolution,[],[f216,f6]) ).
fof(f236,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| spl0_28 ),
inference(forward_subsumption_resolution,[],[f232,f1]) ).
fof(f239,definition,
( spl0_29
<=> achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
fof(f240,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| spl0_29 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f241,plain,
( ~ spl0_29
| ~ spl0_7
| spl0_28 ),
inference(avatar_split_clause,[],[f236,f215,f60,f239]) ).
fof(f250,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| spl0_29 ),
inference(resolution,[],[f240,f7]) ).
fof(f252,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f250,f17]) ).
fof(f253,plain,
( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f252,f1]) ).
fof(f258,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| spl0_29 ),
inference(resolution,[],[f253,f10]) ).
fof(f259,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f258,f1]) ).
fof(f262,definition,
( spl0_30
<=> achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0)))) ),
introduced(definition,[new_symbols(definition,[spl0_30])],[avatar_definition]) ).
fof(f263,plain,
( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatoneast,east(m(s(n0)),c(s(n0))))
| spl0_30 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( ~ spl0_30
| ~ spl0_14
| spl0_29 ),
inference(avatar_split_clause,[],[f259,f239,f102,f262]) ).
fof(f269,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0)))
| spl0_30 ),
inference(resolution,[],[f263,f13]) ).
fof(f276,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| spl0_30 ),
inference(forward_subsumption_resolution,[],[f269,f15]) ).
fof(f277,plain,
( ~ spl0_12
| ~ spl0_11
| spl0_30 ),
inference(avatar_split_clause,[],[f276,f262,f82,f85]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f40]) ).
cnf(s8,plain,
( ~ spl0_2
| ~ spl0_10 ),
inference(sat_conversion,[],[f78]) ).
cnf(s9,plain,
( ~ spl0_6
| spl0_10
| ~ spl0_11
| ~ spl0_12 ),
inference(sat_conversion,[],[f87]) ).
cnf(s11,plain,
( spl0_6
| ~ spl0_13
| ~ spl0_14 ),
inference(sat_conversion,[],[f104]) ).
cnf(s17,plain,
spl0_14,
inference(sat_conversion,[],[f134]) ).
cnf(s22,plain,
( spl0_13
| ~ spl0_23 ),
inference(sat_conversion,[],[f168]) ).
cnf(s23,plain,
( ~ spl0_7
| spl0_23
| ~ spl0_24 ),
inference(sat_conversion,[],[f178]) ).
cnf(s25,plain,
spl0_7,
inference(sat_conversion,[],[f185]) ).
cnf(s29,plain,
( ~ spl0_11
| ~ spl0_12
| ~ spl0_19
| spl0_24 ),
inference(sat_conversion,[],[f200]) ).
cnf(s30,plain,
spl0_11,
inference(sat_conversion,[],[f204]) ).
cnf(s31,plain,
spl0_12,
inference(sat_conversion,[],[f207]) ).
cnf(s33,plain,
( ~ spl0_11
| ~ spl0_12
| spl0_19
| ~ spl0_28 ),
inference(sat_conversion,[],[f217]) ).
cnf(s37,plain,
( ~ spl0_7
| spl0_28
| ~ spl0_29 ),
inference(sat_conversion,[],[f241]) ).
cnf(s38,plain,
( ~ spl0_14
| spl0_29
| ~ spl0_30 ),
inference(sat_conversion,[],[f264]) ).
cnf(s41,plain,
( ~ spl0_11
| ~ spl0_12
| spl0_30 ),
inference(sat_conversion,[],[f277]) ).
cnf(s42,plain,
spl0_30,
inference(rat,[],[s41,s31,s30]) ).
cnf(s43,plain,
( ~ spl0_19
| spl0_24 ),
inference(rat,[],[s29,s31,s30]) ).
cnf(s48,plain,
( spl0_23
| ~ spl0_24 ),
inference(rat,[],[s23,s25]) ).
cnf(s49,plain,
spl0_29,
inference(rat,[],[s38,s42,s17]) ).
cnf(s50,plain,
spl0_28,
inference(rat,[],[s37,s25,s49]) ).
cnf(s51,plain,
spl0_19,
inference(rat,[],[s33,s30,s31,s50]) ).
cnf(s52,plain,
spl0_24,
inference(rat,[],[s43,s51]) ).
cnf(s53,plain,
spl0_23,
inference(rat,[],[s48,s52]) ).
cnf(s54,plain,
spl0_13,
inference(rat,[],[s22,s53]) ).
cnf(s57,plain,
spl0_6,
inference(rat,[],[s11,s17,s54]) ).
cnf(s59,plain,
spl0_10,
inference(rat,[],[s9,s31,s30,s57]) ).
cnf(s60,plain,
~ spl0_2,
inference(rat,[],[s8,s59]) ).
cnf(s62,plain,
$false,
inference(rat,[],[s3,s60]) ).
fof(f278,plain,
$false,
inference(avatar_sat_refutation,[],[s62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 22:29:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.73/1.11 % (3943585)Input is clausal, will run a generic CNF schedule.
% 1.73/1.11 % (3943594)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1378614772:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.73/1.11 % (3943594)First to succeed.
% 1.73/1.11 % (3943594)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3943585"
% 1.73/1.11 % (3943596)dis-21_1_sil=8000:lcm=predicate:random_seed=3234944159:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 1.73/1.11 % (3943595)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1624649922:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.73/1.11 % (3943591)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1070367114:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.73/1.11 % (3943593)lrs+10_1_sil=8000:sp=occurrence:random_seed=901658593:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.73/1.11 % (3943590)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1121500708:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.73/1.11 % (3943592)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2917981417:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.73/1.11 % (3943593)Refutation not found, incomplete strategy
% 1.73/1.11 % (3943593)------------------------------
% 1.73/1.11 % (3943593)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.73/1.11 % (3943593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/1.11 % (3943593)CaDiCaL version: 2.1.3
% 1.73/1.11 % (3943593)Termination reason: Refutation not found, incomplete strategy
% 1.73/1.11 % (3943593)Time elapsed: 0.001 s
% 1.73/1.11 % (3943593)Peak memory usage: 87 MB
% 1.73/1.11 % (3943595)Also succeeded, but the first one will report.
% 1.73/1.11 % (3943596)Also succeeded, but the first one will report.
% 1.73/1.11 % (3943594)Refutation found. Thanks to Tanya!
% 1.73/1.11 % SZS status Unsatisfiable for theBenchmark
% 1.73/1.11 % SZS output start Proof for theBenchmark
% See solution above
% 2.44/1.21 % (3943594)------------------------------
% 2.44/1.21 % (3943594)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.21 % (3943594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.21 % (3943594)CaDiCaL version: 2.1.3
% 2.44/1.21 % (3943594)Termination reason: Refutation
% 2.44/1.21 % (3943594)Time elapsed: 0.004 s
% 2.44/1.21 % (3943594)Peak memory usage: 89 MB
% 2.44/1.21 % (3943594)Instructions burned: 9 (million)
% 2.44/1.21 % (3943594)------------------------------
% 2.44/1.21 % (3943594)------------------------------
% 2.44/1.21 % (3943585)Success in time 0.269 s
% 2.44/1.21 % Vampire exiting
%------------------------------------------------------------------------------