%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP088-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 10:16:37 AM UTC 2026
% Result : Unsatisfiable 0.95s 0.60s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 93 ( 66 unt; 4 def)
% Number of atoms : 128 ( 83 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 66 ( 31 ~; 31 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn 141 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
fof(f5,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| a2 != multiply(multiply(inverse(b2),b2),a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(reorient_equations,[],[f4]) ).
fof(f7,definition,
( spl0_1
<=> multiply(a4,b4) = multiply(b4,a4) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f9,plain,
( multiply(a4,b4) != multiply(b4,a4)
| spl0_1 ),
inference(avatar_component_clause,[],[f7]) ).
fof(f11,definition,
( spl0_2
<=> multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f13,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| spl0_2 ),
inference(avatar_component_clause,[],[f11]) ).
fof(f15,definition,
( spl0_3
<=> a2 = multiply(multiply(inverse(b2),b2),a2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f17,plain,
( a2 != multiply(multiply(inverse(b2),b2),a2)
| spl0_3 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f19,definition,
( spl0_4
<=> multiply(inverse(a1),a1) = multiply(inverse(b1),b1) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f21,plain,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| spl0_4 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f22,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f5,f19,f15,f11,f7]) ).
fof(f23,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f3]) ).
fof(f24,plain,
! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f3,f3]) ).
fof(f30,plain,
! [X2,X3,X0,X1] : divide(X1,divide(divide(X2,divide(X0,divide(X1,X2))),divide(X3,X0))) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f31,plain,
! [X2,X0,X1] : divide(X2,X2) = divide(X0,divide(X1,inverse(divide(X0,X1)))),
inference(superposition,[],[f1,f3]) ).
fof(f32,plain,
! [X2,X0,X1] : divide(X1,divide(divide(X0,divide(X2,X1)),X0)) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f35,plain,
! [X2,X0,X1] : inverse(divide(X1,divide(X0,divide(divide(X2,X2),X1)))) = X0,
inference(superposition,[],[f3,f1]) ).
fof(f36,plain,
! [X0,X1] : inverse(divide(X1,divide(X0,inverse(X1)))) = X0,
inference(forward_demodulation,[],[f35,f3]) ).
fof(f39,plain,
! [X2,X0,X1] : divide(X2,X2) = divide(X0,multiply(X1,divide(X0,X1))),
inference(forward_demodulation,[],[f31,f23]) ).
fof(f41,plain,
! [X0,X1] : inverse(divide(X1,multiply(X0,X1))) = X0,
inference(forward_demodulation,[],[f36,f23]) ).
fof(f44,plain,
! [X0,X1] : inverse(inverse(multiply(X0,divide(X1,X1)))) = X0,
inference(superposition,[],[f41,f3]) ).
fof(f56,plain,
! [X0,X1] : inverse(inverse(multiply(X0,inverse(divide(X1,X1))))) = X0,
inference(superposition,[],[f41,f24]) ).
fof(f99,plain,
! [X2,X0,X1] : divide(X1,X0) = multiply(X1,inverse(multiply(X0,divide(X2,X2)))),
inference(superposition,[],[f23,f44]) ).
fof(f111,plain,
! [X0,X1] : divide(X1,inverse(divide(X0,X1))) = X0,
inference(superposition,[],[f32,f3]) ).
fof(f117,plain,
! [X2,X0,X1] : divide(X1,X0) = divide(divide(X1,X2),divide(X0,X2)),
inference(superposition,[],[f1,f32]) ).
fof(f119,plain,
! [X2,X0,X1] : inverse(divide(divide(X1,divide(X0,divide(X2,X2))),X1)) = X0,
inference(superposition,[],[f3,f32]) ).
fof(f121,plain,
! [X2,X0,X1] : inverse(divide(divide(X1,divide(X0,inverse(divide(X2,X2)))),X1)) = X0,
inference(superposition,[],[f24,f32]) ).
fof(f122,plain,
! [X2,X0,X1] : inverse(divide(divide(X1,multiply(X0,divide(X2,X2))),X1)) = X0,
inference(forward_demodulation,[],[f121,f23]) ).
fof(f124,plain,
! [X0,X1] : multiply(X1,divide(X0,X1)) = X0,
inference(forward_demodulation,[],[f111,f23]) ).
fof(f131,plain,
! [X2,X0] : divide(X2,X2) = divide(X0,X0),
inference(backward_demodulation,[],[f39,f124]) ).
fof(f161,plain,
! [X2,X0,X1] : divide(X1,divide(X1,divide(X2,divide(X0,X0)))) = X2,
inference(superposition,[],[f1,f131]) ).
fof(f163,plain,
! [X2,X0,X1] : divide(X1,X2) = divide(X1,divide(X2,divide(X0,X0))),
inference(superposition,[],[f1,f131]) ).
fof(f168,plain,
! [X0,X1] : inverse(divide(divide(X1,X0),X1)) = X0,
inference(backward_demodulation,[],[f119,f163]) ).
fof(f172,plain,
! [X2,X1] : divide(X1,divide(X1,X2)) = X2,
inference(forward_demodulation,[],[f161,f163]) ).
fof(f177,plain,
! [X2,X0] : multiply(X0,divide(X2,X2)) = X0,
inference(backward_demodulation,[],[f122,f168]) ).
fof(f180,plain,
! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
inference(backward_demodulation,[],[f99,f177]) ).
fof(f182,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(backward_demodulation,[],[f44,f177]) ).
fof(f198,plain,
! [X0,X1] : multiply(X0,inverse(divide(X1,X1))) = X0,
inference(backward_demodulation,[],[f56,f182]) ).
fof(f204,plain,
! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
inference(forward_demodulation,[],[f198,f180]) ).
fof(f217,plain,
! [X0,X1] : inverse(X0) = divide(X1,multiply(X0,X1)),
inference(superposition,[],[f182,f41]) ).
fof(f316,plain,
! [X2,X3,X0,X1] : divide(X3,divide(X1,divide(X2,X3))) = divide(divide(X0,X1),divide(X0,X2)),
inference(superposition,[],[f32,f30]) ).
fof(f407,plain,
! [X0,X1] : multiply(divide(X1,X0),X0) = X1,
inference(superposition,[],[f124,f172]) ).
fof(f410,plain,
! [X2,X0,X1] : divide(X2,divide(X0,divide(X1,X2))) = divide(X1,X0),
inference(superposition,[],[f30,f172]) ).
fof(f427,plain,
! [X2,X0,X1] : divide(X2,X1) = divide(divide(X0,X1),divide(X0,X2)),
inference(backward_demodulation,[],[f316,f410]) ).
fof(f555,plain,
! [X0,X1] : multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(superposition,[],[f407,f23]) ).
fof(f566,plain,
! [X0,X1] : divide(multiply(X0,X1),X1) = X0,
inference(forward_demodulation,[],[f555,f180]) ).
fof(f627,plain,
! [X0,X1] : divide(multiply(X0,X1),X0) = X1,
inference(superposition,[],[f172,f566]) ).
fof(f628,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f124,f566]) ).
fof(f638,plain,
! [X0,X1] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[],[f168,f172]) ).
fof(f747,plain,
( multiply(a4,b4) != multiply(a4,b4)
| spl0_1 ),
inference(superposition,[],[f9,f628]) ).
fof(f759,plain,
( $false
| spl0_1 ),
inference(trivial_inequality_removal,[],[f747]) ).
fof(f760,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f759]) ).
fof(f769,plain,
( multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3))
| spl0_2 ),
inference(forward_demodulation,[],[f13,f628]) ).
fof(f885,plain,
! [X2,X0,X1] : divide(X1,multiply(X2,X0)) = divide(divide(X1,X2),X0),
inference(superposition,[],[f117,f627]) ).
fof(f905,plain,
! [X2,X0,X1] : divide(X2,X1) = divide(X0,multiply(X1,divide(X0,X2))),
inference(backward_demodulation,[],[f427,f885]) ).
fof(f949,plain,
! [X0,X1] : multiply(X0,X1) = divide(X1,inverse(X0)),
inference(superposition,[],[f172,f217]) ).
fof(f971,plain,
! [X2,X0,X1] : divide(X2,divide(X0,X1)) = multiply(X1,divide(X2,X0)),
inference(superposition,[],[f172,f905]) ).
fof(f1135,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = divide(inverse(X1),X0),
inference(superposition,[],[f638,f23]) ).
fof(f1272,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = divide(inverse(X0),X1),
inference(superposition,[],[f638,f949]) ).
fof(f1301,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = divide(X1,divide(inverse(X0),X2)),
inference(superposition,[],[f971,f949]) ).
fof(f1302,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = divide(X0,divide(inverse(X1),X2)),
inference(superposition,[],[f971,f23]) ).
fof(f1311,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = divide(X0,inverse(multiply(X2,X1))),
inference(forward_demodulation,[],[f1302,f1135]) ).
fof(f1312,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = divide(X1,inverse(multiply(X2,X0))),
inference(forward_demodulation,[],[f1301,f1135]) ).
fof(f1321,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X0,multiply(X2,X1)),
inference(forward_demodulation,[],[f1311,f23]) ).
fof(f1322,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X1,multiply(X2,X0)),
inference(forward_demodulation,[],[f1312,f23]) ).
fof(f1663,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = inverse(multiply(X1,X0)),
inference(superposition,[],[f1135,f1272]) ).
fof(f2219,plain,
! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = multiply(X2,multiply(X1,X0)),
inference(superposition,[],[f23,f1663]) ).
fof(f2232,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X2,multiply(X1,X0)),
inference(forward_demodulation,[],[f2219,f23]) ).
fof(f2631,plain,
( multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3))
| spl0_2 ),
inference(superposition,[],[f769,f1321]) ).
fof(f2651,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f2631,f2232]) ).
fof(f2652,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f2651]) ).
fof(f2695,plain,
( a2 != multiply(a2,multiply(inverse(b2),b2))
| spl0_3 ),
inference(forward_demodulation,[],[f17,f628]) ).
fof(f2696,plain,
( a2 != multiply(b2,multiply(a2,inverse(b2)))
| spl0_3 ),
inference(forward_demodulation,[],[f2695,f1322]) ).
fof(f2697,plain,
( a2 != multiply(b2,divide(a2,b2))
| spl0_3 ),
inference(forward_demodulation,[],[f2696,f180]) ).
fof(f2698,plain,
( a2 != divide(a2,divide(b2,b2))
| spl0_3 ),
inference(forward_demodulation,[],[f2697,f971]) ).
fof(f2699,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f2698,f204]) ).
fof(f2700,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f2699]) ).
fof(f2702,plain,
( multiply(inverse(a1),a1) != multiply(b1,inverse(b1))
| spl0_4 ),
inference(forward_demodulation,[],[f21,f628]) ).
fof(f2704,plain,
( multiply(inverse(a1),a1) != divide(b1,b1)
| spl0_4 ),
inference(forward_demodulation,[],[f2702,f180]) ).
fof(f2706,plain,
( divide(b1,b1) != multiply(a1,inverse(a1))
| spl0_4 ),
inference(forward_demodulation,[],[f2704,f628]) ).
fof(f2708,plain,
( divide(b1,b1) != divide(a1,a1)
| spl0_4 ),
inference(forward_demodulation,[],[f2706,f180]) ).
fof(f2709,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f2708,f131]) ).
fof(f2710,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f2709]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f22]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f760]) ).
cnf(s5,plain,
spl0_2,
inference(sat_conversion,[],[f2652]) ).
cnf(s6,plain,
spl0_3,
inference(sat_conversion,[],[f2700]) ).
cnf(s7,plain,
spl0_4,
inference(sat_conversion,[],[f2710]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s7,s6,s5,s3]) ).
fof(f2711,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP088-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:21:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.95/0.60 % (2565231)Will run a generic schedule for satisfiability detection.
% 0.95/0.60 % (2565236)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1393724426_2999 on theBenchmark for (2999ds/0Mi)
% 0.95/0.60 % TRYING [1]
% 0.95/0.60 % TRYING [2]
% 0.95/0.60 % TRYING [3]
% 0.95/0.60 % (2565237)% WARNING: option uhcvi not known.
% 0.95/0.60 % TRYING [4]
% 0.95/0.60 % (2565237)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1831518613:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.95/0.60 % (2565241)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1760858803:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.95/0.60 % (2565238)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2211946996:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.95/0.60 % (2565239)dis+10_1_sil=32000:sp=arity:random_seed=3655481583:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.95/0.60 % (2565240)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3555297100:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.95/0.60 % (2565242)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3131086990:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.95/0.60 % TRYING [5]
% 0.95/0.60 % (2565239)Instruction limit reached!
% 0.95/0.60 % (2565239)------------------------------
% 0.95/0.60 % (2565239)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.60 % (2565239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.60 % (2565239)CaDiCaL version: 2.1.3
% 0.95/0.60 % (2565239)Termination reason: Instruction limit
% 0.95/0.60 % (2565239)Termination phase: Saturation
% 0.95/0.60 % (2565239)Time elapsed: 0.057 s
% 0.95/0.60 % (2565239)Peak memory usage: 12 MB
% 0.95/0.60 % (2565239)Instructions burned: 103 (million)
% 0.95/0.60 % (2565240)Instruction limit reached!
% 0.95/0.60 % (2565240)------------------------------
% 0.95/0.60 % (2565240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.60 % (2565240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.60 % (2565240)CaDiCaL version: 2.1.3
% 0.95/0.60 % (2565240)Termination reason: Instruction limit
% 0.95/0.60 % (2565240)Termination phase: Saturation
% 0.95/0.60 % (2565240)Time elapsed: 0.064 s
% 0.95/0.60 % (2565240)Peak memory usage: 12 MB
% 0.95/0.60 % (2565240)Instructions burned: 117 (million)
% 0.95/0.60 % (2565250)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2050780464:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.95/0.60 % (2565241)Instruction limit reached!
% 0.95/0.60 % (2565241)------------------------------
% 0.95/0.60 % (2565241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.60 % (2565241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.60 % (2565241)CaDiCaL version: 2.1.3
% 0.95/0.60 % (2565241)Termination reason: Instruction limit
% 0.95/0.60 % (2565241)Termination phase: Saturation
% 0.95/0.60 % (2565241)Time elapsed: 0.077 s
% 0.95/0.60 % (2565241)Peak memory usage: 12 MB
% 0.95/0.60 % (2565241)Instructions burned: 132 (million)
% 0.95/0.60 % TRYING [1]
% 0.95/0.60 % TRYING [2]
% 0.95/0.60 % TRYING [3]
% 0.95/0.60 % (2565251)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2762334984:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.95/0.60 % TRYING [4]
% 0.95/0.60 % (2565242)Instruction limit reached!
% 0.95/0.60 % (2565242)------------------------------
% 0.95/0.60 % (2565242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.60 % (2565242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.60 % (2565242)CaDiCaL version: 2.1.3
% 0.95/0.60 % (2565242)Termination reason: Instruction limit
% 0.95/0.60 % (2565242)Termination phase: Saturation
% 0.95/0.60 % (2565242)Time elapsed: 0.096 s
% 0.95/0.60 % (2565242)Peak memory usage: 13 MB
% 0.95/0.60 % (2565242)Instructions burned: 159 (million)
% 0.95/0.60 % (2565253)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3380011991:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.95/0.60 % (2565256)ott-21_1_sil=16000:fs=off:random_seed=3250880899:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.95/0.60 % (2565251) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2565231-2565251"...
% 0.95/0.60 % (2565251)...printing done.
% 0.95/0.60 % (2565251)Refutation found. Thanks to Tanya!
% 0.95/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.95/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.95/0.60 % (2565251)------------------------------
% 0.95/0.60 % (2565251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.95/0.60 % (2565251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.95/0.60 % (2565251)CaDiCaL version: 2.1.3
% 0.95/0.60 % (2565251)Termination reason: Refutation
% 0.95/0.60 % (2565251)Time elapsed: 0.051 s
% 0.95/0.60 % (2565251)Peak memory usage: 13 MB
% 0.95/0.60 % (2565251)Instructions burned: 87 (million)
% 0.95/0.60 % (2565231)Success in time 0.174 s
% 0.95/0.60 % Vampire exiting
%------------------------------------------------------------------------------