%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n005.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:49 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 17 unt; 5 def)
% Number of atoms : 311 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 445 ( 222 ~; 218 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 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(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))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( ~ 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))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
fof(f11,axiom,
! [X2,X3,X0,X1] :
( ~ 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))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ 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))) ),
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(f26,definition,
( spl0_2
<=> safe(s(s(s(n0))),s(s(n0))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f27,plain,
( safe(s(s(s(n0))),s(s(n0)))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f28,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| spl0_2 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f30,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| spl0_2 ),
inference(resolution,[],[f28,f18]) ).
fof(f42,plain,
( ~ greater_or_equal(s(n0),n0)
| spl0_2 ),
inference(resolution,[],[f30,f4]) ).
fof(f43,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f42,f3]) ).
fof(f44,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f45,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,[],[f7,f15]) ).
fof(f46,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(forward_subsumption_resolution,[],[f45,f1]) ).
fof(f48,definition,
( spl0_5
<=> achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f50,plain,
( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f52,definition,
( spl0_6
<=> safe(s(s(s(n0))),s(n0)) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f53,plain,
( safe(s(s(s(n0))),s(n0))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f54,plain,
( ~ safe(s(s(s(n0))),s(n0))
| spl0_6 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f46,f52,f48]) ).
fof(f56,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| spl0_6 ),
inference(resolution,[],[f54,f18]) ).
fof(f57,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f56,f3]) ).
fof(f58,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f57]) ).
fof(f77,definition,
( spl0_10
<=> safe(s(n0),s(n0)) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f78,plain,
( safe(s(n0),s(n0))
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f79,plain,
( ~ safe(s(n0),s(n0))
| spl0_10 ),
inference(avatar_component_clause,[],[f77]) ).
fof(f81,definition,
( spl0_11
<=> safe(s(s(n0)),s(s(n0))) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f82,plain,
( safe(s(s(n0)),s(s(n0)))
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f83,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| spl0_11 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f85,plain,
( ~ greater_or_equal(n0,n0)
| spl0_10 ),
inference(resolution,[],[f79,f18]) ).
fof(f86,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f85,f3]) ).
fof(f87,plain,
spl0_10,
inference(avatar_contradiction_clause,[],[f86]) ).
fof(f88,plain,
( ~ greater_or_equal(s(n0),s(n0))
| spl0_11 ),
inference(resolution,[],[f83,f18]) ).
fof(f89,plain,
( ~ greater_or_equal(n0,n0)
| spl0_11 ),
inference(resolution,[],[f88,f4]) ).
fof(f90,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[],[f89,f3]) ).
fof(f91,plain,
spl0_11,
inference(avatar_contradiction_clause,[],[f90]) ).
fof(f96,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,[],[f50,f6]) ).
fof(f97,plain,
( ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f96,f27]) ).
fof(f98,plain,
( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f97,f1]) ).
fof(f107,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_2
| ~ spl0_5 ),
inference(resolution,[],[f98,f7]) ).
fof(f109,plain,
( ~ 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_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f107,f17]) ).
fof(f128,plain,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f109,f1]) ).
fof(f134,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_2
| ~ spl0_5 ),
inference(resolution,[],[f128,f6]) ).
fof(f135,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f134,f53]) ).
fof(f136,plain,
( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f135,f1]) ).
fof(f138,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_2
| ~ spl0_5
| ~ spl0_6 ),
inference(resolution,[],[f136,f11]) ).
fof(f141,plain,
( ~ 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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f138,f78]) ).
fof(f142,plain,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f141,f82]) ).
fof(f143,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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f142,f14]) ).
fof(f148,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f143,f82]) ).
fof(f149,plain,
( achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f148,f78]) ).
fof(f151,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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f149,f11]) ).
fof(f155,plain,
( ~ 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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f151,f1]) ).
fof(f156,plain,
( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f155,f53]) ).
fof(f160,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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f156,f6]) ).
fof(f161,plain,
( ~ 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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f160,f1]) ).
fof(f162,plain,
( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f161,f17]) ).
fof(f163,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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f162,f7]) ).
fof(f165,plain,
( ~ 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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f163,f1]) ).
fof(f166,plain,
( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f165,f27]) ).
fof(f171,plain,
( ~ safe(n0,s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f166,f6]) ).
fof(f172,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f171,f1]) ).
fof(f174,plain,
( achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f172,f53]) ).
fof(f176,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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f174,f7]) ).
fof(f178,plain,
( ~ 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_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f176,f1]) ).
fof(f179,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f178,f16]) ).
fof(f185,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f179,f18]) ).
fof(f186,plain,
( ~ greater_or_equal(s(n0),s(n0))
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f185,f4]) ).
fof(f187,plain,
( ~ greater_or_equal(n0,n0)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(resolution,[],[f186,f4]) ).
fof(f188,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f187,f3]) ).
fof(f189,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f188]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f44]) ).
cnf(s4,plain,
( spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f55]) ).
cnf(s5,plain,
spl0_6,
inference(sat_conversion,[],[f58]) ).
cnf(s8,plain,
spl0_10,
inference(sat_conversion,[],[f87]) ).
cnf(s9,plain,
spl0_11,
inference(sat_conversion,[],[f91]) ).
cnf(s13,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_6
| ~ spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f189]) ).
cnf(s17,plain,
spl0_5,
inference(rat,[],[s4,s5]) ).
cnf(s18,plain,
~ spl0_2,
inference(rat,[],[s13,s9,s8,s5,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s3,s18]) ).
fof(f190,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:29:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.46 % (232124)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (232129)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4236775782_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % (232130)% WARNING: option uhcvi not known.
% 0.11/0.46 % TRYING [1]
% 0.11/0.46 % TRYING [2]
% 0.11/0.46 % (232130)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=983575710:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (232133)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3892432756:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (232131)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=169207768:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (232134)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1954735764:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (232132)dis+10_1_sil=32000:sp=arity:random_seed=241364837:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (232135)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3560761792:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46 % TRYING [3]
% 0.11/0.46 % (232132) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-232124-232132"...
% 0.11/0.46 % (232130) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-232124-232130"...
% 0.11/0.46 % (232132)...printing done.
% 0.11/0.46 % (232132)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (232132)------------------------------
% 0.11/0.46 % (232132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (232132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (232132)CaDiCaL version: 2.1.3
% 0.11/0.46 % (232132)Termination reason: Refutation
% 0.11/0.46 % (232132)Time elapsed: 0.005 s
% 0.11/0.46 % (232132)Peak memory usage: 12 MB
% 0.11/0.46 % (232132)Instructions burned: 6 (million)
% 0.11/0.46 % (232124)Success in time 0.04 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------