%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO499_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 02:26:41 PM UTC 2026
% Result : Theorem 3.10s 1.05s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 137 ( 9 unt; 0 typ; 12 def)
% Number of atoms : 713 ( 176 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 394 ( 168 ~; 197 |; 17 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 352 ( 350 fml; 2 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 18 ( 15 usr; 17 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-1 aty)
% Number of variables : 1 ( 1 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f: $o > $i ).
tff(func_def_1,type,
f1: $o > $i ).
tff(func_def_2,type,
f2: $o > $i ).
tff(func_def_3,type,
g: $o > $i ).
tff(func_def_4,type,
g1: $o > $i ).
tff(func_def_5,type,
g2: $o > $i ).
tff(func_def_6,type,
bG0: $o ).
tff(func_def_9,type,
bG1: $o ).
tff(func_def_10,type,
bG2: $o ).
tff(func_def_11,type,
bG3: $o ).
tff(func_def_12,type,
bG4: $o ).
tff(func_def_13,type,
bG5: $o ).
tff(func_def_14,type,
bG6: $o ).
tff(func_def_15,type,
bG7: $o ).
tff(func_def_16,type,
bG8: $o ).
tff(func_def_17,type,
bG9: $o ).
tff(func_def_18,type,
bG10: $o ).
tff(func_def_19,type,
bG11: $o ).
tff(f1,conjecture,
( ( f(a) = g(b) )
| ( f(b) != g(a) )
| ( f1(a) = g1(c) )
| ( f1(c) != g1(a) )
| ( f2(b) = g2(c) )
| ( f2(c) != g2(b) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f2,negated_conjecture,
~ ( ( f(a) = g(b) )
| ( f(b) != g(a) )
| ( f1(a) = g1(c) )
| ( f1(c) != g1(a) )
| ( f2(b) = g2(c) )
| ( f2(c) != g2(b) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ( f(a) = g(b) )
| ( f(b) != g(a) )
| ( f1(a) = g1(c) )
| ( f1(c) != g1(a) )
| ( f2(b) = g2(c) )
| ( f2(c) != g2(b) ) ),
inference(rectify,[],[f2]) ).
tff(f4,definition,
( c
<=> ( bG0 = $true ) ),
introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).
tff(f5,definition,
( b
<=> ( $true = bG1 ) ),
introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition]) ).
tff(f6,definition,
( b
<=> ( $true = bG2 ) ),
introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition]) ).
tff(f7,definition,
( c
<=> ( $true = bG3 ) ),
introduced(definition,[new_symbols(definition,[bG3])],[fool_formula_definition]) ).
tff(f8,definition,
( c
<=> ( $true = bG4 ) ),
introduced(definition,[new_symbols(definition,[bG4])],[fool_formula_definition]) ).
tff(f9,definition,
( a
<=> ( $true = bG5 ) ),
introduced(definition,[new_symbols(definition,[bG5])],[fool_formula_definition]) ).
tff(f10,definition,
( a
<=> ( $true = bG6 ) ),
introduced(definition,[new_symbols(definition,[bG6])],[fool_formula_definition]) ).
tff(f11,definition,
( c
<=> ( $true = bG7 ) ),
introduced(definition,[new_symbols(definition,[bG7])],[fool_formula_definition]) ).
tff(f12,definition,
( b
<=> ( $true = bG8 ) ),
introduced(definition,[new_symbols(definition,[bG8])],[fool_formula_definition]) ).
tff(f13,definition,
( a
<=> ( $true = bG9 ) ),
introduced(definition,[new_symbols(definition,[bG9])],[fool_formula_definition]) ).
tff(f14,definition,
( a
<=> ( $true = bG10 ) ),
introduced(definition,[new_symbols(definition,[bG10])],[fool_formula_definition]) ).
tff(f15,definition,
( b
<=> ( $true = bG11 ) ),
introduced(definition,[new_symbols(definition,[bG11])],[fool_formula_definition]) ).
tff(f16,plain,
~ ( ( f(bG10) = g(bG11) )
| ( f(bG8) != g(bG9) )
| ( f1(bG6) = g1(bG7) )
| ( f1(bG4) != g1(bG5) )
| ( f2(bG2) = g2(bG3) )
| ( f2(bG0) != g2(bG1) ) ),
inference(fool_elimination,[],[f3,f15,f14,f13,f12,f11,f10,f9,f8,f7,f6,f5,f4]) ).
tff(f17,plain,
( ( f(bG10) != g(bG11) )
& ( f(bG8) = g(bG9) )
& ( f1(bG6) != g1(bG7) )
& ( f1(bG4) = g1(bG5) )
& ( f2(bG2) != g2(bG3) )
& ( f2(bG0) = g2(bG1) ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f18,plain,
( ( c
| ( bG0 != $true ) )
& ( ( bG0 = $true )
| ~ c ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f19,plain,
( ( b
| ( $true != bG1 ) )
& ( ( $true = bG1 )
| ~ b ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f20,plain,
( ( b
| ( $true != bG2 ) )
& ( ( $true = bG2 )
| ~ b ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f21,plain,
( ( c
| ( $true != bG3 ) )
& ( ( $true = bG3 )
| ~ c ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f22,plain,
( ( c
| ( $true != bG4 ) )
& ( ( $true = bG4 )
| ~ c ) ),
inference(nnf_transformation,[],[f8]) ).
tff(f23,plain,
( ( a
| ( $true != bG5 ) )
& ( ( $true = bG5 )
| ~ a ) ),
inference(nnf_transformation,[],[f9]) ).
tff(f24,plain,
( ( a
| ( $true != bG6 ) )
& ( ( $true = bG6 )
| ~ a ) ),
inference(nnf_transformation,[],[f10]) ).
tff(f25,plain,
( ( c
| ( $true != bG7 ) )
& ( ( $true = bG7 )
| ~ c ) ),
inference(nnf_transformation,[],[f11]) ).
tff(f26,plain,
( ( b
| ( $true != bG8 ) )
& ( ( $true = bG8 )
| ~ b ) ),
inference(nnf_transformation,[],[f12]) ).
tff(f27,plain,
( ( a
| ( $true != bG9 ) )
& ( ( $true = bG9 )
| ~ a ) ),
inference(nnf_transformation,[],[f13]) ).
tff(f28,plain,
( ( a
| ( $true != bG10 ) )
& ( ( $true = bG10 )
| ~ a ) ),
inference(nnf_transformation,[],[f14]) ).
tff(f29,plain,
( ( b
| ( $true != bG11 ) )
& ( ( $true = bG11 )
| ~ b ) ),
inference(nnf_transformation,[],[f15]) ).
tff(f30,plain,
f2(bG0) = g2(bG1),
inference(cnf_transformation,[],[f17]) ).
tff(f31,plain,
f2(bG2) != g2(bG3),
inference(cnf_transformation,[],[f17]) ).
tff(f32,plain,
f1(bG4) = g1(bG5),
inference(cnf_transformation,[],[f17]) ).
tff(f33,plain,
f1(bG6) != g1(bG7),
inference(cnf_transformation,[],[f17]) ).
tff(f34,plain,
f(bG8) = g(bG9),
inference(cnf_transformation,[],[f17]) ).
tff(f35,plain,
f(bG10) != g(bG11),
inference(cnf_transformation,[],[f17]) ).
tff(f36,plain,
( ( bG0 = $true )
| ~ c ),
inference(cnf_transformation,[],[f18]) ).
tff(f37,plain,
( ( bG0 != $true )
| c ),
inference(cnf_transformation,[],[f18]) ).
tff(f38,plain,
( ( $true = bG1 )
| ~ b ),
inference(cnf_transformation,[],[f19]) ).
tff(f39,plain,
( ( $true != bG1 )
| b ),
inference(cnf_transformation,[],[f19]) ).
tff(f40,plain,
( ( $true = bG2 )
| ~ b ),
inference(cnf_transformation,[],[f20]) ).
tff(f41,plain,
( ( $true != bG2 )
| b ),
inference(cnf_transformation,[],[f20]) ).
tff(f42,plain,
( ( $true = bG3 )
| ~ c ),
inference(cnf_transformation,[],[f21]) ).
tff(f43,plain,
( ( $true != bG3 )
| c ),
inference(cnf_transformation,[],[f21]) ).
tff(f44,plain,
( ( $true = bG4 )
| ~ c ),
inference(cnf_transformation,[],[f22]) ).
tff(f45,plain,
( ( $true != bG4 )
| c ),
inference(cnf_transformation,[],[f22]) ).
tff(f46,plain,
( ( $true = bG5 )
| ~ a ),
inference(cnf_transformation,[],[f23]) ).
tff(f47,plain,
( ( $true != bG5 )
| a ),
inference(cnf_transformation,[],[f23]) ).
tff(f48,plain,
( ( $true = bG6 )
| ~ a ),
inference(cnf_transformation,[],[f24]) ).
tff(f49,plain,
( ( $true != bG6 )
| a ),
inference(cnf_transformation,[],[f24]) ).
tff(f50,plain,
( ( $true = bG7 )
| ~ c ),
inference(cnf_transformation,[],[f25]) ).
tff(f51,plain,
( ( $true != bG7 )
| c ),
inference(cnf_transformation,[],[f25]) ).
tff(f52,plain,
( ( $true = bG8 )
| ~ b ),
inference(cnf_transformation,[],[f26]) ).
tff(f53,plain,
( ( $true != bG8 )
| b ),
inference(cnf_transformation,[],[f26]) ).
tff(f54,plain,
( ( $true = bG9 )
| ~ a ),
inference(cnf_transformation,[],[f27]) ).
tff(f55,plain,
( ( $true != bG9 )
| a ),
inference(cnf_transformation,[],[f27]) ).
tff(f56,plain,
( ( $true = bG10 )
| ~ a ),
inference(cnf_transformation,[],[f28]) ).
tff(f57,plain,
( ( $true != bG10 )
| a ),
inference(cnf_transformation,[],[f28]) ).
tff(f58,plain,
( ( $true = bG11 )
| ~ b ),
inference(cnf_transformation,[],[f29]) ).
tff(f59,plain,
( ( $true != bG11 )
| b ),
inference(cnf_transformation,[],[f29]) ).
tff(f61,plain,
! [X0: $o] :
( ( $true = (X0) )
| ( $false = (X0) ) ),
introduced(definition,[],[fool_exhaustiveness_axiom]) ).
tff(f63,plain,
( ( f2(bG0) = g2($true) )
| ~ b ),
inference(superposition,[],[f30,f38]) ).
tff(f66,plain,
( ( f2(bG2) != g2($true) )
| ~ c ),
inference(superposition,[],[f31,f42]) ).
tff(f67,plain,
( ( f2(bG0) != f2(bG2) )
| ~ c
| ~ b ),
inference(superposition,[],[f66,f63]) ).
tff(f69,plain,
( ( f2(bG0) != f2($true) )
| ~ c
| ~ b
| ~ b ),
inference(superposition,[],[f67,f40]) ).
tff(f70,plain,
( ( f2(bG0) != f2($true) )
| ~ c
| ~ b ),
inference(duplicate_literal_removal,[],[f69]) ).
tff(f71,plain,
( ( f2($true) != f2($true) )
| ~ c
| ~ b
| ~ c ),
inference(superposition,[],[f70,f36]) ).
tff(f72,plain,
( ( f2($true) != f2($true) )
| ~ c
| ~ b ),
inference(duplicate_literal_removal,[],[f71]) ).
tff(f73,plain,
( ~ c
| ~ b ),
inference(trivial_inequality_removal,[],[f72]) ).
tff(f75,plain,
( ( f1(bG4) = g1($true) )
| ~ a ),
inference(superposition,[],[f32,f46]) ).
tff(f78,plain,
( ( f1(bG6) != g1($true) )
| ~ c ),
inference(superposition,[],[f33,f50]) ).
tff(f80,plain,
( ( f1(bG4) != f1(bG6) )
| ~ c
| ~ a ),
inference(superposition,[],[f78,f75]) ).
tff(f81,plain,
( ( f1(bG4) != f1($true) )
| ~ c
| ~ a
| ~ a ),
inference(superposition,[],[f80,f48]) ).
tff(f82,plain,
( ( f1(bG4) != f1($true) )
| ~ c
| ~ a ),
inference(duplicate_literal_removal,[],[f81]) ).
tff(f83,plain,
( ( f1($true) != f1($true) )
| ~ c
| ~ a
| ~ c ),
inference(superposition,[],[f82,f44]) ).
tff(f84,plain,
( ( f1($true) != f1($true) )
| ~ c
| ~ a ),
inference(duplicate_literal_removal,[],[f83]) ).
tff(f85,plain,
( ~ c
| ~ a ),
inference(trivial_inequality_removal,[],[f84]) ).
tff(f87,plain,
( ( f(bG8) = g($true) )
| ~ a ),
inference(superposition,[],[f34,f54]) ).
tff(f90,plain,
( ( f(bG10) != g($true) )
| ~ b ),
inference(superposition,[],[f35,f58]) ).
tff(f92,plain,
( ( f(bG8) != f(bG10) )
| ~ b
| ~ a ),
inference(superposition,[],[f90,f87]) ).
tff(f102,plain,
( ( $true != $true )
| c
| ( bG0 = $false ) ),
inference(superposition,[],[f37,f61]) ).
tff(f103,plain,
( ( $true != $true )
| b
| ( bG1 = $false ) ),
inference(superposition,[],[f39,f61]) ).
tff(f106,plain,
( ( $true != $true )
| b
| ( bG2 = $false ) ),
inference(superposition,[],[f41,f61]) ).
tff(f107,plain,
( ( $true != $true )
| c
| ( bG3 = $false ) ),
inference(superposition,[],[f43,f61]) ).
tff(f110,plain,
( ( $true != $true )
| c
| ( bG4 = $false ) ),
inference(superposition,[],[f45,f61]) ).
tff(f111,plain,
( ( $true != $true )
| a
| ( bG5 = $false ) ),
inference(superposition,[],[f47,f61]) ).
tff(f114,plain,
( ( $true != $true )
| a
| ( bG6 = $false ) ),
inference(superposition,[],[f49,f61]) ).
tff(f115,plain,
( ( $true != $true )
| c
| ( bG7 = $false ) ),
inference(superposition,[],[f51,f61]) ).
tff(f117,plain,
( ( $true != $true )
| b
| ( bG8 = $false ) ),
inference(superposition,[],[f53,f61]) ).
tff(f118,plain,
( ( $true != $true )
| a
| ( bG9 = $false ) ),
inference(superposition,[],[f55,f61]) ).
tff(f120,plain,
( ( $true != $true )
| a
| ( bG10 = $false ) ),
inference(superposition,[],[f57,f61]) ).
tff(f121,plain,
( ( $true != $true )
| b
| ( bG11 = $false ) ),
inference(superposition,[],[f59,f61]) ).
tff(f124,plain,
( ( bG11 = $false )
| b ),
inference(trivial_inequality_removal,[],[f121]) ).
tff(f125,plain,
( ( bG10 = $false )
| a ),
inference(trivial_inequality_removal,[],[f120]) ).
tff(f126,plain,
( ( bG9 = $false )
| a ),
inference(trivial_inequality_removal,[],[f118]) ).
tff(f127,plain,
( ( bG8 = $false )
| b ),
inference(trivial_inequality_removal,[],[f117]) ).
tff(f128,plain,
( ( bG7 = $false )
| c ),
inference(trivial_inequality_removal,[],[f115]) ).
tff(f129,plain,
( ( bG6 = $false )
| a ),
inference(trivial_inequality_removal,[],[f114]) ).
tff(f130,plain,
( ( bG5 = $false )
| a ),
inference(trivial_inequality_removal,[],[f111]) ).
tff(f131,plain,
( ( bG4 = $false )
| c ),
inference(trivial_inequality_removal,[],[f110]) ).
tff(f133,plain,
( ( bG3 = $false )
| c ),
inference(trivial_inequality_removal,[],[f107]) ).
tff(f134,plain,
( ( bG2 = $false )
| b ),
inference(trivial_inequality_removal,[],[f106]) ).
tff(f135,plain,
( ( bG1 = $false )
| b ),
inference(trivial_inequality_removal,[],[f103]) ).
tff(f136,plain,
( ( bG0 = $false )
| c ),
inference(trivial_inequality_removal,[],[f102]) ).
tff(f138,plain,
( ( f(bG8) != f($true) )
| ~ b
| ~ a
| ~ a ),
inference(superposition,[],[f92,f56]) ).
tff(f140,plain,
( ( f(bG8) != f($true) )
| ~ b
| ~ a ),
inference(duplicate_literal_removal,[],[f138]) ).
tff(f141,plain,
( ( f($true) != f($true) )
| ~ b
| ~ a
| ~ b ),
inference(superposition,[],[f140,f52]) ).
tff(f144,plain,
( ( f($true) != f($true) )
| ~ b
| ~ a ),
inference(duplicate_literal_removal,[],[f141]) ).
tff(f145,plain,
( ~ b
| ~ a ),
inference(trivial_inequality_removal,[],[f144]) ).
tff(f177,plain,
( ( f(bG10) != g($false) )
| b ),
inference(superposition,[],[f35,f124]) ).
tff(f203,plain,
( ( f(bG8) = g($false) )
| a ),
inference(superposition,[],[f34,f126]) ).
tff(f206,plain,
( ( f(bG8) != f(bG10) )
| b
| a ),
inference(superposition,[],[f177,f203]) ).
tff(f214,plain,
( ( f(bG8) != f($false) )
| b
| a
| a ),
inference(superposition,[],[f206,f125]) ).
tff(f217,plain,
( ( f(bG8) != f($false) )
| b
| a ),
inference(duplicate_literal_removal,[],[f214]) ).
tff(f218,plain,
( ( f($false) != f($false) )
| b
| a
| b ),
inference(superposition,[],[f217,f127]) ).
tff(f221,plain,
( ( f($false) != f($false) )
| b
| a ),
inference(duplicate_literal_removal,[],[f218]) ).
tff(f222,plain,
( b
| a ),
inference(trivial_inequality_removal,[],[f221]) ).
tff(f227,plain,
( ( f1(bG6) != g1($false) )
| c ),
inference(superposition,[],[f33,f128]) ).
tff(f247,plain,
( ( f1(bG4) = g1($false) )
| a ),
inference(superposition,[],[f32,f130]) ).
tff(f250,plain,
( ( f1(bG4) != f1(bG6) )
| c
| a ),
inference(superposition,[],[f227,f247]) ).
tff(f258,plain,
( ( f1(bG4) != f1($false) )
| c
| a
| a ),
inference(superposition,[],[f250,f129]) ).
tff(f261,plain,
( ( f1(bG4) != f1($false) )
| c
| a ),
inference(duplicate_literal_removal,[],[f258]) ).
tff(f262,plain,
( ( f1($false) != f1($false) )
| c
| a
| c ),
inference(superposition,[],[f261,f131]) ).
tff(f265,plain,
( ( f1($false) != f1($false) )
| c
| a ),
inference(duplicate_literal_removal,[],[f262]) ).
tff(f266,plain,
( c
| a ),
inference(trivial_inequality_removal,[],[f265]) ).
tff(f271,plain,
( ( f2(bG2) != g2($false) )
| c ),
inference(superposition,[],[f31,f133]) ).
tff(f275,plain,
( a
| ~ b ),
inference(resolution,[],[f266,f73]) ).
tff(f276,plain,
a,
inference(forward_subsumption_resolution,[],[f275,f222]) ).
tff(f288,plain,
( ( f2(bG0) = g2($false) )
| b ),
inference(superposition,[],[f30,f135]) ).
tff(f291,plain,
( ( f2(bG0) != f2(bG2) )
| c
| b ),
inference(superposition,[],[f271,f288]) ).
tff(f299,plain,
( ( f2(bG0) != f2($false) )
| c
| b
| b ),
inference(superposition,[],[f291,f134]) ).
tff(f302,plain,
( ( f2(bG0) != f2($false) )
| c
| b ),
inference(duplicate_literal_removal,[],[f299]) ).
tff(f303,plain,
( ( f2($false) != f2($false) )
| c
| b
| c ),
inference(superposition,[],[f302,f136]) ).
tff(f306,plain,
( ( f2($false) != f2($false) )
| c
| b ),
inference(duplicate_literal_removal,[],[f303]) ).
tff(f307,plain,
( c
| b ),
inference(trivial_inequality_removal,[],[f306]) ).
tff(f401,plain,
( b
| ~ a ),
inference(resolution,[],[f307,f85]) ).
tff(f403,plain,
~ a,
inference(forward_subsumption_resolution,[],[f401,f145]) ).
tff(f404,plain,
$false,
inference(forward_subsumption_resolution,[],[f403,f276]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO499_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n019.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 17:46:18 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.05 % (35102)Detected formulas, will run a generic FOF schedule.
% 3.10/1.05 % (35107)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=1995478421:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.05 % (35108)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2521438728:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.05 % (35113)dis-21_1_sil=8000:lcm=predicate:random_seed=3294416654:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.10/1.05 % (35109)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=159171981:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.05 % (35111)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=976350073:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.05 % (35110)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=997438856:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.05 % (35112)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=263939114:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.05 % (35113)Refutation not found, incomplete strategy
% 3.10/1.05 % (35113)------------------------------
% 3.10/1.05 % (35113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.05 % (35113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.05 % (35113)CaDiCaL version: 2.1.3
% 3.10/1.05 % (35113)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.05 % (35113)Time elapsed: 0.002 s
% 3.10/1.05 % (35113)Peak memory usage: 88 MB
% 3.10/1.05 % (35113)Instructions burned: 2 (million)
% 3.10/1.05 % (35110)Refutation not found, incomplete strategy
% 3.10/1.05 % (35110)------------------------------
% 3.10/1.05 % (35110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.05 % (35110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.05 % (35110)CaDiCaL version: 2.1.3
% 3.10/1.05 % (35110)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.05 % (35110)Time elapsed: 0.004 s
% 3.10/1.05 % (35110)Peak memory usage: 88 MB
% 3.10/1.05 % (35110)Instructions burned: 4 (million)
% 3.10/1.05 % (35111)First to succeed.
% 3.10/1.05 % (35111)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-35102"
% 3.10/1.05 % (35112)Also succeeded, but the first one will report.
% 3.10/1.05 [W928 17:46:19.514918485 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 [W928 17:46:19.514952369 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 [W928 17:46:19.514971869 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 [W928 17:46:19.514980009 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 [W928 17:46:19.514993242 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 [W928 17:46:19.514998670 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 3.10/1.05 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 3.10/1.05 % (35113)------------------------------
% 3.10/1.05 % (35113)------------------------------
% 3.10/1.05 % (35110)------------------------------
% 3.10/1.05 % (35110)------------------------------
% 3.10/1.05 % (35111)Refutation found. Thanks to Tanya!
% 3.10/1.05 % SZS status Theorem for theBenchmark
% 3.10/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.25 % (35111)------------------------------
% 3.48/1.25 % (35111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.25 % (35111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.25 % (35111)CaDiCaL version: 2.1.3
% 3.48/1.25 % (35111)Termination reason: Refutation
% 3.48/1.25 % (35111)Time elapsed: 0.008 s
% 3.48/1.25 % (35111)Peak memory usage: 88 MB
% 3.48/1.25 % (35111)Instructions burned: 13 (million)
% 3.48/1.25 % (35111)------------------------------
% 3.48/1.25 % (35111)------------------------------
% 3.48/1.25 % (35102)Success in time 0.404 s
% 3.48/1.25 % Vampire exiting
%------------------------------------------------------------------------------