%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC005-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:02:00 PM UTC 2026
% Result : Unsatisfiable 1.67s 1.30s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 21
% Syntax : Number of formulae : 85 ( 13 unt; 5 def)
% Number of atoms : 295 ( 73 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 420 ( 210 ~; 205 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause74) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause75) ).
fof(f76,axiom,
! [X0] :
( ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause76) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f107,axiom,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause104) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause115) ).
fof(f125,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f210,negated_conjecture,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| sk3 = X0
| tl(sk4) != X0
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X0,X1),X2) != sk4
| app(X0,X2) != sk3
| ~ neq(X1,nil)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f210,f204,f205]) ).
fof(f220,plain,
( ~ ssList(tl(sk4))
| sk3 = tl(sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f211]) ).
fof(f224,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f231,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f224]) ).
fof(f234,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f251,definition,
( spl0_5
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f254,definition,
( spl0_6
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f255,plain,
( ~ neq(nil,sk4)
| spl0_6 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,definition,
( spl0_7
<=> sk3 = tl(sk4) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f258,plain,
( sk3 = tl(sk4)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,definition,
( spl0_8
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f261,plain,
( ~ ssList(tl(sk4))
| spl0_8 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_7
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f220,f260,f257,f254,f251]) ).
fof(f264,definition,
( spl0_9
<=> ! [X2,X0,X1] :
( ~ ssList(X0)
| ~ neq(X1,nil)
| app(X0,X2) != sk3
| app(app(X0,X1),X2) != sk4
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f265,plain,
( ! [X2,X0,X1] :
( app(app(X0,X1),X2) != sk4
| ~ neq(X1,nil)
| app(X0,X2) != sk3
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( ~ spl0_5
| spl0_9 ),
inference(avatar_split_clause,[],[f218,f264,f251]) ).
fof(f267,plain,
( neq(sk4,nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f270,plain,
spl0_5,
inference(avatar_split_clause,[],[f234,f251]) ).
fof(f285,plain,
( ! [X0,X1] :
( app(X0,X1) != sk4
| ~ neq(X0,nil)
| sk3 != app(nil,X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl0_9 ),
inference(superposition,[],[f265,f74]) ).
fof(f286,plain,
( ! [X0,X1] :
( app(X0,X1) != sk4
| ~ neq(X0,nil)
| sk3 != app(nil,X1)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_9 ),
inference(duplicate_literal_removal,[],[f285]) ).
fof(f288,plain,
( ! [X0,X1] :
( app(X0,X1) != sk4
| ~ neq(X0,nil)
| sk3 != app(nil,X1)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f286,f8]) ).
fof(f290,plain,
( ! [X0,X1] :
( app(X0,X1) != sk4
| ~ neq(X0,nil)
| sk3 != X1
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_9 ),
inference(forward_subsumption_demodulation,[],[f288,f74]) ).
fof(f298,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_8 ),
inference(resolution,[],[f75,f261]) ).
fof(f299,plain,
( nil = sk4
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f298,f203]) ).
fof(f302,plain,
( neq(nil,nil)
| ~ spl0_5
| spl0_8 ),
inference(superposition,[],[f267,f299]) ).
fof(f306,plain,
( ~ ssList(nil)
| ~ spl0_5
| spl0_8 ),
inference(resolution,[],[f302,f231]) ).
fof(f307,plain,
( $false
| ~ spl0_5
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f306,f8]) ).
fof(f308,plain,
( ~ spl0_5
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f307]) ).
fof(f323,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_6 ),
inference(resolution,[],[f102,f255]) ).
fof(f326,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f323,f8]) ).
fof(f327,plain,
( nil = sk4
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f326,f203]) ).
fof(f329,plain,
( ~ neq(nil,nil)
| spl0_6 ),
inference(superposition,[],[f255,f327]) ).
fof(f331,plain,
( neq(nil,nil)
| ~ spl0_5
| spl0_6 ),
inference(superposition,[],[f267,f327]) ).
fof(f344,plain,
( $false
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f331,f329]) ).
fof(f345,plain,
( ~ spl0_5
| spl0_6 ),
inference(avatar_contradiction_clause,[],[f344]) ).
fof(f376,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| ~ neq(cons(X0,nil),nil)
| sk3 != X1
| ~ ssList(X1)
| ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl0_9 ),
inference(superposition,[],[f290,f126]) ).
fof(f381,plain,
( ! [X0,X1] :
( ~ neq(cons(X0,nil),nil)
| cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl0_9 ),
inference(duplicate_literal_removal,[],[f376]) ).
fof(f396,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil))
| ~ ssList(nil)
| nil = cons(X0,nil) )
| ~ spl0_9 ),
inference(resolution,[],[f381,f102]) ).
fof(f397,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(nil)
| nil = cons(X0,nil) )
| ~ spl0_9 ),
inference(duplicate_literal_removal,[],[f396]) ).
fof(f398,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(nil)
| nil = cons(X0,nil) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f397,f86]) ).
fof(f406,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(nil) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f398,f99]) ).
fof(f407,plain,
( ! [X0,X1] :
( cons(X0,X1) != sk4
| sk3 != X1
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f406,f8]) ).
fof(f414,plain,
( ! [X0] :
( sk4 != X0
| tl(X0) != sk3
| ~ ssList(tl(X0))
| ~ ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 )
| ~ spl0_9 ),
inference(superposition,[],[f407,f107]) ).
fof(f417,plain,
( ! [X0] :
( sk4 != X0
| tl(X0) != sk3
| ~ ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f414,f75]) ).
fof(f418,plain,
( ! [X0] :
( tl(X0) != sk3
| sk4 != X0
| ~ ssList(X0)
| nil = X0 )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f417,f76]) ).
fof(f427,plain,
( ! [X0] :
( tl(X0) != tl(sk4)
| sk4 != X0
| ~ ssList(X0)
| nil = X0 )
| ~ spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f418,f258]) ).
fof(f436,plain,
( sk4 != sk4
| ~ ssList(sk4)
| nil = sk4
| ~ spl0_7
| ~ spl0_9 ),
inference(equality_resolution,[],[f427]) ).
fof(f437,plain,
( ~ ssList(sk4)
| nil = sk4
| ~ spl0_7
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f436]) ).
fof(f438,plain,
( nil = sk4
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f437,f203]) ).
fof(f447,plain,
( neq(nil,nil)
| ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f267,f438]) ).
fof(f470,plain,
( ~ ssList(nil)
| ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(resolution,[],[f447,f231]) ).
fof(f471,plain,
( $false
| ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f470,f8]) ).
fof(f472,plain,
( ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f471]) ).
cnf(s4,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f262]) ).
cnf(s5,plain,
( ~ spl0_5
| spl0_9 ),
inference(sat_conversion,[],[f266]) ).
cnf(s8,plain,
spl0_5,
inference(sat_conversion,[],[f270]) ).
cnf(s13,plain,
( ~ spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f308]) ).
cnf(s14,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f345]) ).
cnf(s17,plain,
( ~ spl0_5
| ~ spl0_7
| ~ spl0_9 ),
inference(sat_conversion,[],[f472]) ).
cnf(s18,plain,
spl0_6,
inference(rat,[],[s14,s8]) ).
cnf(s19,plain,
spl0_8,
inference(rat,[],[s13,s8]) ).
cnf(s20,plain,
spl0_9,
inference(rat,[],[s5,s8]) ).
cnf(s21,plain,
~ spl0_7,
inference(rat,[],[s17,s8,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s4,s19,s21,s18,s8]) ).
fof(f473,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC005-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:30:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.67/1.30 % (187426)Input is clausal, will run a generic CNF schedule.
% 1.67/1.30 % (187434)lrs+10_1_sil=8000:sp=occurrence:random_seed=1143939703:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.67/1.30 % (187434)Instruction limit reached!
% 1.67/1.30 % (187434)------------------------------
% 1.67/1.30 % (187434)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.67/1.30 % (187434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.67/1.30 % (187434)CaDiCaL version: 2.1.3
% 1.67/1.30 % (187434)Termination reason: Instruction limit
% 1.67/1.30 % (187434)Termination phase: Saturation
% 1.67/1.30 % (187434)Time elapsed: 0.037 s
% 1.67/1.30 % (187434)Peak memory usage: 90 MB
% 1.67/1.30 % (187434)Instructions burned: 108 (million)
% 1.67/1.30 % (187435)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=745402431:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.67/1.30 % (187431)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1491854737:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.67/1.30 % (187433)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=630026088:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.67/1.30 % (187432)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=160471201:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.67/1.30 % (187437)dis-21_1_sil=8000:lcm=predicate:random_seed=1468558866:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 1.67/1.30 % (187436)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2282911360:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.67/1.30 % (187435)First to succeed.
% 1.67/1.30 % (187435)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-187426"
% 1.67/1.30 % (187437)Instruction limit reached!
% 1.67/1.30 % (187437)------------------------------
% 1.67/1.30 % (187437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.67/1.30 % (187437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.67/1.30 % (187437)CaDiCaL version: 2.1.3
% 1.67/1.30 % (187437)Termination reason: Instruction limit
% 1.67/1.30 % (187437)Termination phase: Saturation
% 1.67/1.30 % (187437)Time elapsed: 0.060 s
% 1.67/1.30 % (187437)Peak memory usage: 89 MB
% 1.67/1.30 % (187437)Instructions burned: 118 (million)
% 1.67/1.30 % (187439)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=714839247:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 1.67/1.30 % (187436)Instruction limit reached!
% 1.67/1.30 % (187436)------------------------------
% 1.67/1.30 % (187436)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.67/1.30 % (187436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.67/1.30 % (187436)CaDiCaL version: 2.1.3
% 1.67/1.30 % (187436)Termination reason: Instruction limit
% 1.67/1.30 % (187436)Termination phase: Saturation
% 1.67/1.30 % (187436)Time elapsed: 0.122 s
% 1.67/1.30 % (187436)Peak memory usage: 90 MB
% 1.67/1.30 % (187436)Instructions burned: 181 (million)
% 1.67/1.30 % (187439)Also succeeded, but the first one will report.
% 1.67/1.30 % (187446)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3201221831:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 1.67/1.30 % (187435)Refutation found. Thanks to Tanya!
% 1.67/1.30 % SZS status Unsatisfiable for theBenchmark
% 1.67/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/1.50 % (187435)------------------------------
% 0.14/1.50 % (187435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.14/1.50 % (187435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/1.50 % (187435)CaDiCaL version: 2.1.3
% 0.14/1.50 % (187435)Termination reason: Refutation
% 0.14/1.50 % (187435)Time elapsed: 0.012 s
% 0.14/1.50 % (187435)Peak memory usage: 90 MB
% 0.14/1.50 % (187435)Instructions burned: 14 (million)
% 0.14/1.50 % (187435)------------------------------
% 0.14/1.50 % (187435)------------------------------
% 0.14/1.50 % (187426)Success in time 0.455 s
% 0.14/1.50 % Vampire exiting
%------------------------------------------------------------------------------