%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NLP222-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:09:30 PM UTC 2026
% Result : Satisfiable 0.11s 0.44s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u102,negated_conjecture,
~ ssSkC0 ).
cnf(u109,negated_conjecture,
( actual_world(X0)
| proposition(X0,X1)
| ~ of(X0,X8,X7)
| ~ jules_forename(X0,X8)
| forename(X0,X8)
| be(X0,X6,X7,X7)
| ~ man(X0,X7)
| state(X0,X6)
| ~ of(X0,X4,X5)
| ~ man(X0,X5)
| ~ agent(X0,X3,X5)
| forename(X0,X4)
| ~ vincent_forename(X0,X4)
| ~ theme(X0,X3,X1)
| ~ event(X0,X3)
| present(X0,X3)
| think_believe_consider(X0,X3)
| ~ event(X1,X2)
| ~ agent(X1,X2,skf7(X1))
| present(X1,X2)
| ~ smoke(X1,X2)
| accessible_world(X0,X1) ) ).
cnf(u117,negated_conjecture,
( man(X1,skf7(X1))
| proposition(X0,X1)
| actual_world(X0)
| ~ of(X0,X7,X6)
| ~ jules_forename(X0,X7)
| forename(X0,X7)
| be(X0,X5,X6,X6)
| ~ man(X0,X6)
| state(X0,X5)
| ~ of(X0,X3,X4)
| ~ man(X0,X4)
| ~ agent(X0,X2,X4)
| forename(X0,X3)
| ~ vincent_forename(X0,X3)
| ~ theme(X0,X2,X1)
| ~ event(X0,X2)
| present(X0,X2)
| think_believe_consider(X0,X2)
| accessible_world(X0,X1) ) ).
cnf(u121,negated_conjecture,
( agent(skc22,skf5(X0),X0)
| ~ man(skc22,X0) ) ).
cnf(u129,negated_conjecture,
smoke(skc22,skf5(X1)) ).
cnf(u136,negated_conjecture,
~ present(skc22,skf5(X1)) ).
cnf(u140,negated_conjecture,
event(skc22,skf5(X1)) ).
cnf(u160,negated_conjecture,
~ be(skc17,skc18,skc21,skc19) ).
cnf(u165,negated_conjecture,
~ be(skc29,skc30,skc31,skc31) ).
cnf(u170,negated_conjecture,
of(skc17,skc20,skc21) ).
cnf(u175,negated_conjecture,
of(skc17,skc24,skc25) ).
cnf(u180,negated_conjecture,
agent(skc17,skc23,skc25) ).
cnf(u185,negated_conjecture,
theme(skc17,skc23,skc22) ).
cnf(u189,negated_conjecture,
~ of(skc29,skc32,skc31) ).
cnf(u194,negated_conjecture,
~ of(skc29,skc35,skc36) ).
cnf(u199,negated_conjecture,
~ agent(skc29,skc34,skc36) ).
cnf(u204,negated_conjecture,
~ theme(skc29,skc34,skc33) ).
cnf(u210,negated_conjecture,
man(skc17,skc21) ).
cnf(u215,negated_conjecture,
~ forename(skc17,skc20) ).
cnf(u220,negated_conjecture,
jules_forename(skc17,skc20) ).
cnf(u225,negated_conjecture,
man(skc17,skc19) ).
cnf(u230,negated_conjecture,
~ state(skc17,skc18) ).
cnf(u235,negated_conjecture,
man(skc17,skc25) ).
cnf(u240,negated_conjecture,
~ forename(skc17,skc24) ).
cnf(u245,negated_conjecture,
vincent_forename(skc17,skc24) ).
cnf(u250,negated_conjecture,
event(skc17,skc23) ).
cnf(u255,negated_conjecture,
~ present(skc17,skc23) ).
cnf(u260,negated_conjecture,
~ think_believe_consider(skc17,skc23) ).
cnf(u265,negated_conjecture,
~ accessible_world(skc17,skc22) ).
cnf(u270,negated_conjecture,
~ proposition(skc17,skc22) ).
cnf(u274,negated_conjecture,
~ jules_forename(skc29,skc32) ).
cnf(u280,negated_conjecture,
~ forename(skc29,skc32) ).
cnf(u284,negated_conjecture,
~ man(skc29,skc31) ).
cnf(u290,negated_conjecture,
~ state(skc29,skc30) ).
cnf(u294,negated_conjecture,
~ man(skc29,skc36) ).
cnf(u300,negated_conjecture,
~ forename(skc29,skc35) ).
cnf(u304,negated_conjecture,
~ vincent_forename(skc29,skc35) ).
cnf(u309,negated_conjecture,
~ event(skc29,skc34) ).
cnf(u315,negated_conjecture,
~ present(skc29,skc34) ).
cnf(u320,negated_conjecture,
~ think_believe_consider(skc29,skc34) ).
cnf(u325,negated_conjecture,
~ accessible_world(skc29,skc33) ).
cnf(u330,negated_conjecture,
~ proposition(skc29,skc33) ).
cnf(u339,negated_conjecture,
( state(skc17,X2)
| ~ of(skc17,X0,X1)
| ~ man(skc17,X1)
| be(skc17,X2,X1,X1)
| forename(skc17,X0)
| ~ jules_forename(skc17,X0) ) ).
cnf(u342,negated_conjecture,
~ actual_world(skc17) ).
cnf(u353,negated_conjecture,
( state(skc29,X3)
| ~ of(skc29,X1,X2)
| ~ man(skc29,X2)
| be(skc29,X3,X2,X2)
| forename(skc29,X1)
| ~ jules_forename(skc29,X1) ) ).
cnf(u364,negated_conjecture,
~ jules_forename(skc29,skc35) ).
cnf(u375,negated_conjecture,
~ jules_forename(skc17,skc24) ).
cnf(u382,negated_conjecture,
( be(skc17,skc18,X0,X0)
| ~ of(skc17,skc20,X0)
| ~ man(skc17,X0) ) ).
cnf(u393,negated_conjecture,
~ vincent_forename(skc17,skc20) ).
cnf(u369,negated_conjecture,
( forename(skc17,X0)
| ~ man(skc17,X1)
| be(skc17,skc18,X1,X1)
| ~ of(skc17,X0,X1)
| ~ jules_forename(skc17,X0) ) ).
cnf(u51,negated_conjecture,
~ actual_world(skc17) ).
cnf(u358,negated_conjecture,
( forename(skc29,X0)
| ~ man(skc29,X1)
| be(skc29,skc30,X1,X1)
| ~ of(skc29,X0,X1)
| ~ jules_forename(skc29,X0) ) ).
cnf(u50,negated_conjecture,
~ actual_world(skc29) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP222-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n011.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 18:31:30 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.44 % (2675043)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (2675054)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2065196059:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.44 % (2675054) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2675043-2675054"...
% 0.11/0.44 % (2675054)...printing done.
% 0.11/0.44 % SZS status Satisfiable for theBenchmark
% 0.11/0.44 % SZS output start Saturation.
% See solution above
% 0.11/0.44 % SZS output start Definitions and Model Updates.
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "be"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "state"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "forename"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "present"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "think_believe_consider"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "accessible_world"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "proposition"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "ssSkC0"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "actual_world"
% 0.11/0.44 % SZS output end Definitions and Model Updates.
% 0.11/0.44 % (2675054)------------------------------
% 0.11/0.44 % (2675054)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (2675054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (2675054)CaDiCaL version: 2.1.3
% 0.11/0.44 % (2675054)Termination reason: Satisfiable
% 0.11/0.44 % (2675054)Time elapsed: 0.002 s
% 0.11/0.44 % (2675054)Peak memory usage: 11 MB
% 0.11/0.44 % (2675054)Instructions burned: 5 (million)
% 0.11/0.44 % (2675043)Success in time 0.028 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------