%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV383+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 : n019.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:07 PM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 60 ( 27 ~; 16 |; 11 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 48 ( 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ( ~ check_cpq(triple(X0,X1,X2))
| ~ ok(triple(X0,X1,X2)) )
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5)) ) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( check_cpq(triple(X0,X1,X2))
& ok(triple(X0,X1,X2)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( check_cpq(triple(X0,X1,X2))
& ok(triple(X0,X1,X2)) ) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( ok(triple(X3,X4,X5))
& check_cpq(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f86,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( ok(triple(X3,X4,X5))
& check_cpq(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f85]) ).
fof(f93,plain,
( ok(triple(sK3,sK4,sK5))
& check_cpq(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f86]) ).
fof(f143,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f84]) ).
fof(f144,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f93]) ).
fof(f145,plain,
succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
check_cpq(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
fof(f147,plain,
ok(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
fof(f187,plain,
( ~ check_cpq(triple(sK3,sK4,sK5))
| ~ ok(triple(sK3,sK4,sK5))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(resolution,[],[f143,f145]) ).
fof(f188,plain,
( ~ ok(triple(sK3,sK4,sK5))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(forward_subsumption_resolution,[],[f187,f146]) ).
fof(f189,plain,
check_cpq(triple(sK0,sK1,sK2)),
inference(forward_subsumption_resolution,[],[f188,f147]) ).
fof(f190,plain,
$false,
inference(forward_subsumption_resolution,[],[f189,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV383+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 % Computer : n019.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Mon Sep 28 10:46:48 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.24 Running first-order model finding
% 0.10/0.24 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.19/0.29 % (3926817)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (3926823)% WARNING: option uhcvi not known.
% 0.19/0.29 % (3926826)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2872093229:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % (3926825)dis+10_1_sil=32000:sp=arity:random_seed=2541549709:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (3926822)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3570865401_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % (3926823)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=865450766:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (3926824)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2693154494:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (3926827)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1221553095:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (3926828)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=918380762:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (3926824) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3926817-3926824"...
% 0.19/0.29 % (3926824)...printing done.
% 0.19/0.29 % (3926824)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (3926824)------------------------------
% 0.19/0.29 % (3926824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (3926824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (3926824)CaDiCaL version: 2.1.3
% 0.19/0.29 % (3926824)Termination reason: Refutation
% 0.19/0.29 % (3926824)Time elapsed: 0.004 s
% 0.19/0.29 % (3926824)Peak memory usage: 12 MB
% 0.19/0.29 % (3926824)Instructions burned: 4 (million)
% 0.19/0.29 % (3926817)Success in time 0.045 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------