%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV370+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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.07s 0.27s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 70 ( 10 unt; 4 def)
% Number of atoms : 150 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 136 ( 56 ~; 64 |; 1 &)
% ( 12 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 105 ( 0 sgn 99 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( contains_pq(insert_pq(X0,X1),X2)
<=> ( contains_pq(X0,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax9) ).
fof(f21,axiom,
! [X0,X1,X2,X3] :
( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
<=> ( contains_slb(X0,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(f55,axiom,
! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).
fof(f63,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( contains_cpq(triple(X1,X0,X2),X3)
<=> contains_pq(i(triple(X1,X0,X2)),X3) )
=> ! [X4,X5,X6,X7,X8] :
( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
<=> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l6_co) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( contains_cpq(triple(X1,X0,X2),X3)
<=> contains_pq(i(triple(X1,X0,X2)),X3) )
=> ! [X4,X5,X6,X7,X8] :
( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
<=> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f111,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
<~> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) )
& ! [X1,X2,X3] :
( contains_cpq(triple(X1,X0,X2),X3)
<=> contains_pq(i(triple(X1,X0,X2)),X3) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ contains_pq(insert_pq(X0,X1),X2)
| contains_pq(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f9]) ).
fof(f121,plain,
! [X2,X0,X1] :
( X1 != X2
| contains_pq(insert_pq(X0,X1),X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f122,plain,
! [X2,X0,X1] :
( contains_pq(insert_pq(X0,X1),X2)
| ~ contains_pq(X0,X2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| contains_slb(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( X1 != X2
| contains_slb(insert_slb(X0,pair(X1,X3)),X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f137,plain,
! [X2,X3,X0,X1] :
( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
| ~ contains_slb(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f159,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f39]) ).
fof(f160,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f39]) ).
fof(f176,plain,
! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
inference(cnf_transformation,[],[f55]) ).
fof(f177,plain,
( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
| contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
inference(cnf_transformation,[],[f111]) ).
fof(f178,plain,
( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
| ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
inference(cnf_transformation,[],[f111]) ).
fof(f179,plain,
! [X2,X3,X1] :
( contains_cpq(triple(X1,sK1,X2),X3)
| ~ contains_pq(i(triple(X1,sK1,X2)),X3) ),
inference(cnf_transformation,[],[f111]) ).
fof(f180,plain,
! [X2,X3,X1] :
( ~ contains_cpq(triple(X1,sK1,X2),X3)
| contains_pq(i(triple(X1,sK1,X2)),X3) ),
inference(cnf_transformation,[],[f111]) ).
fof(f185,plain,
! [X2,X0] : contains_pq(insert_pq(X0,X2),X2),
inference(equality_resolution,[],[f121]) ).
fof(f186,plain,
! [X2,X3,X0] : contains_slb(insert_slb(X0,pair(X2,X3)),X2),
inference(equality_resolution,[],[f136]) ).
fof(f190,definition,
( spl7_1
<=> contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f191,plain,
( ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
| spl7_1 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f192,plain,
( contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f194,definition,
( spl7_2
<=> contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f195,plain,
( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
| spl7_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f196,plain,
( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f197,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f177,f194,f190]) ).
fof(f198,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f178,f194,f190]) ).
fof(f199,plain,
( contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
| ~ spl7_2 ),
inference(forward_demodulation,[],[f196,f176]) ).
fof(f224,plain,
( ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6)
| spl7_1 ),
inference(resolution,[],[f159,f191]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ contains_slb(sK1,X0)
| contains_pq(i(triple(X1,sK1,X2)),X0) ),
inference(resolution,[],[f159,f180]) ).
fof(f226,plain,
! [X2,X0,X1] :
( contains_slb(sK1,X0)
| ~ contains_pq(i(triple(X1,sK1,X2)),X0) ),
inference(resolution,[],[f160,f179]) ).
fof(f228,plain,
( ~ contains_slb(sK1,sK6)
| spl7_1 ),
inference(resolution,[],[f137,f224]) ).
fof(f234,plain,
( ! [X0,X1] : ~ contains_pq(i(triple(X0,sK1,X1)),sK6)
| spl7_1 ),
inference(resolution,[],[f226,f228]) ).
fof(f235,plain,
! [X2,X3,X0,X1,X4] :
( ~ contains_pq(i(triple(X0,sK1,X1)),X2)
| contains_pq(i(triple(X3,sK1,X4)),X2) ),
inference(resolution,[],[f226,f225]) ).
fof(f236,plain,
( contains_pq(i(triple(sK2,sK1,sK3)),sK6)
| sK4 = sK6
| ~ spl7_2 ),
inference(resolution,[],[f120,f199]) ).
fof(f239,plain,
( sK4 = sK6
| spl7_1
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f236,f234]) ).
fof(f241,plain,
( ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK4)
| spl7_1
| ~ spl7_2 ),
inference(superposition,[],[f224,f239]) ).
fof(f244,plain,
( $false
| spl7_1
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f241,f186]) ).
fof(f245,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f244]) ).
fof(f246,plain,
( ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
| spl7_2 ),
inference(forward_demodulation,[],[f195,f176]) ).
fof(f247,plain,
( ~ contains_pq(i(triple(sK2,sK1,sK3)),sK6)
| spl7_2 ),
inference(resolution,[],[f246,f122]) ).
fof(f248,plain,
( contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6)
| ~ spl7_1 ),
inference(resolution,[],[f192,f160]) ).
fof(f252,plain,
( ! [X0,X1] : ~ contains_pq(i(triple(X0,sK1,X1)),sK6)
| spl7_2 ),
inference(resolution,[],[f235,f247]) ).
fof(f361,plain,
( contains_slb(sK1,sK6)
| sK4 = sK6
| ~ spl7_1 ),
inference(resolution,[],[f135,f248]) ).
fof(f363,definition,
( spl7_3
<=> sK4 = sK6 ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f365,plain,
( sK4 = sK6
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f367,definition,
( spl7_4
<=> contains_slb(sK1,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f369,plain,
( contains_slb(sK1,sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f370,plain,
( spl7_3
| spl7_4
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f361,f190,f367,f363]) ).
fof(f371,plain,
( ! [X0,X1] : contains_pq(i(triple(X0,sK1,X1)),sK6)
| ~ spl7_4 ),
inference(resolution,[],[f369,f225]) ).
fof(f372,plain,
( $false
| spl7_2
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f371,f252]) ).
fof(f373,plain,
( spl7_2
| ~ spl7_4 ),
inference(avatar_contradiction_clause,[],[f372]) ).
fof(f382,plain,
( ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK4)
| spl7_2
| ~ spl7_3 ),
inference(superposition,[],[f246,f365]) ).
fof(f383,plain,
( $false
| spl7_2
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f382,f185]) ).
fof(f384,plain,
( spl7_2
| ~ spl7_3 ),
inference(avatar_contradiction_clause,[],[f383]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f197]) ).
cnf(s2,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f198]) ).
cnf(s3,plain,
( spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f245]) ).
cnf(s4,plain,
( ~ spl7_1
| spl7_3
| spl7_4 ),
inference(sat_conversion,[],[f370]) ).
cnf(s5,plain,
( spl7_2
| ~ spl7_4 ),
inference(sat_conversion,[],[f373]) ).
cnf(s6,plain,
( spl7_2
| ~ spl7_3 ),
inference(sat_conversion,[],[f384]) ).
cnf(s7,plain,
spl7_1,
inference(rat,[],[s1,s3]) ).
cnf(s8,plain,
~ spl7_2,
inference(rat,[],[s2,s7]) ).
cnf(s9,plain,
~ spl7_3,
inference(rat,[],[s6,s8]) ).
cnf(s10,plain,
~ spl7_4,
inference(rat,[],[s5,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s4,s7,s9,s10]) ).
fof(f385,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV370+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n002.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 10:47:52 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.27 % (274058)Will run a generic schedule for satisfiability detection.
% 0.07/0.27 % (274069)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3145746512:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.27 % (274064)% WARNING: option uhcvi not known.
% 0.07/0.27 % (274068)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1380482138:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.27 % (274066)dis+10_1_sil=32000:sp=arity:random_seed=3047842319:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.27 % (274065)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2980780189:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.27 % (274064)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2990748176:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.27 % (274067)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=931705561:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.27 % (274067) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274058-274067"...
% 0.07/0.27 % (274067)...printing done.
% 0.07/0.27 % (274066) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274058-274066"...
% 0.07/0.27 % (274067)Refutation found. Thanks to Tanya!
% 0.07/0.27 % SZS status Theorem for theBenchmark
% 0.07/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.27 % (274067)------------------------------
% 0.07/0.27 % (274067)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.27 % (274067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.27 % (274067)CaDiCaL version: 2.1.3
% 0.07/0.27 % (274067)Termination reason: Refutation
% 0.07/0.27 % (274067)Time elapsed: 0.010 s
% 0.07/0.27 % (274067)Peak memory usage: 12 MB
% 0.07/0.27 % (274067)Instructions burned: 14 (million)
% 0.07/0.27 % (274058)Success in time 0.046 s
% 0.07/0.27 % Vampire exiting
%------------------------------------------------------------------------------