%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV369+1 : TPTP v9.3.1. Released v3.3.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 01:21:05 PM UTC 2026
% Result : Theorem 0.05s 0.24s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 12 unt; 2 def)
% Number of atoms : 60 ( 2 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 23 ~; 18 |; 3 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_pq(create_pq,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax8) ).
fof(f20,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f54,axiom,
! [X0,X1] : i(triple(X0,create_slb,X1)) = create_pq,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).
fof(f63,conjecture,
! [X0,X1,X2] :
( contains_cpq(triple(X0,create_slb,X1),X2)
<=> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l5_co) ).
fof(f64,negated_conjecture,
~ ! [X0,X1,X2] :
( contains_cpq(triple(X0,create_slb,X1),X2)
<=> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f115,plain,
? [X0,X1,X2] :
( contains_cpq(triple(X0,create_slb,X1),X2)
<~> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
inference(ennf_transformation,[],[f64]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f125,plain,
? [X0,X1,X2] :
( ( ~ contains_pq(i(triple(X0,create_slb,X1)),X2)
| ~ contains_cpq(triple(X0,create_slb,X1),X2) )
& ( contains_pq(i(triple(X0,create_slb,X1)),X2)
| contains_cpq(triple(X0,create_slb,X1),X2) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f126,plain,
( ( ~ contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
| ~ contains_cpq(triple(sK1,create_slb,sK2),sK3) )
& ( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
| contains_cpq(triple(sK1,create_slb,sK2),sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f125]) ).
fof(f134,plain,
! [X0] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f149,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f20]) ).
fof(f174,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f124]) ).
fof(f190,plain,
! [X0,X1] : create_pq = i(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f54]) ).
fof(f192,plain,
( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
| contains_cpq(triple(sK1,create_slb,sK2),sK3) ),
inference(cnf_transformation,[],[f126]) ).
fof(f203,definition,
( spl4_1
<=> contains_cpq(triple(sK1,create_slb,sK2),sK3) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f204,plain,
( contains_cpq(triple(sK1,create_slb,sK2),sK3)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f205,plain,
( ~ contains_cpq(triple(sK1,create_slb,sK2),sK3)
| spl4_1 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f207,definition,
( spl4_2
<=> contains_pq(i(triple(sK1,create_slb,sK2)),sK3) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f208,plain,
( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f217,plain,
( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f192,f205]) ).
fof(f218,plain,
( spl4_2
| spl4_1 ),
inference(avatar_split_clause,[],[f217,f203,f207]) ).
fof(f232,plain,
( contains_pq(create_pq,sK3)
| ~ spl4_2 ),
inference(superposition,[],[f208,f190]) ).
fof(f233,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f232,f134]) ).
fof(f234,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f233]) ).
fof(f360,plain,
( contains_slb(create_slb,sK3)
| ~ spl4_1 ),
inference(resolution,[],[f174,f204]) ).
fof(f361,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f360,f149]) ).
fof(f362,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f361]) ).
cnf(s83,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f218]) ).
cnf(s105,plain,
~ spl4_2,
inference(sat_conversion,[],[f234]) ).
cnf(s182,plain,
~ spl4_1,
inference(sat_conversion,[],[f362]) ).
cnf(s183,plain,
$false,
inference(rat,[],[s83,s105,s182]) ).
fof(f363,plain,
$false,
inference(avatar_sat_refutation,[],[s183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV369+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.17 % Computer : n005.cluster.edu
% 0.05/0.17 % Model : x86_64 x86_64
% 0.05/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.17 % Memory : 8046.5625MB
% 0.05/0.17 % OS : Linux 6.8.0-71-generic
% 0.05/0.17 % CPULimit : 300
% 0.05/0.17 % WCLimit : 300
% 0.05/0.17 % DateTime : Mon Sep 28 10:44:32 UTC 2026
% 0.05/0.17 % CPUTime :
% 0.05/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.19 Running first-order model finding
% 0.05/0.20 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.05/0.24 % (710079)Will run a generic schedule for satisfiability detection.
% 0.05/0.24 % (710086)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3804837292:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.05/0.24 % (710085)% WARNING: option uhcvi not known.
% 0.05/0.24 % (710086) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-710079-710086"...
% 0.05/0.24 % (710086)...printing done.
% 0.05/0.24 % (710086)Refutation found. Thanks to Tanya!
% 0.05/0.24 % SZS status Theorem for theBenchmark
% 0.05/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/0.24 % (710086)------------------------------
% 0.05/0.24 % (710086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/0.24 % (710086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/0.24 % (710086)CaDiCaL version: 2.1.3
% 0.05/0.24 % (710086)Termination reason: Refutation
% 0.05/0.24 % (710086)Time elapsed: 0.004 s
% 0.05/0.24 % (710086)Peak memory usage: 12 MB
% 0.05/0.24 % (710086)Instructions burned: 8 (million)
% 0.05/0.24 % (710079)Success in time 0.032 s
% 0.05/0.24 % Vampire exiting
%------------------------------------------------------------------------------