%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO652-1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:28:31 PM UTC 2026
% Result : Unsatisfiable 2.99s 1.09s
% Output : Refutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 11 unt; 2 def)
% Number of atoms : 321 ( 0 equ)
% Maximal formula atoms : 19 ( 6 avg)
% Number of connectives : 537 ( 268 ~; 267 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X3,X0,X1] :
( 'E'(f(X2),f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X3),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X0),suc(X1))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X0),f(suc(X0)))
| 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
fof(f4,axiom,
! [X0] :
( iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_149) ).
fof(f6,axiom,
! [X0] : 'LE'(f(X0),s('0')),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_199) ).
fof(f7,axiom,
! [X0] :
( ~ 'LE'(f(suc(X0)),s('0'))
| 'E'('0',f(suc(X0)))
| 'LE'(f(X0),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_191) ).
fof(f11,axiom,
! [X2,X3,X0,X1] :
( ~ iLEQ(suc(X1),suc(X2))
| ~ iLEQ(suc(X3),suc(X0))
| ~ iLEQ(suc(X0),suc(X1))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X0)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_96) ).
fof(f12,axiom,
! [X0] :
( ~ 'LE'(f(X0),s('0'))
| 'E'('0',f(X0))
| 'LE'(f(X0),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_17) ).
fof(f14,axiom,
! [X0] :
( ~ 'LE'(f(suc(suc(X0))),s('0'))
| 'E'('0',f(suc(suc(X0))))
| 'LE'(f(X0),'0') ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f16,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_99) ).
fof(f22,axiom,
! [X0] :
( iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).
fof(f24,plain,
! [X0] :
( 'LE'(f(X0),'0')
| 'E'('0',f(X0)) ),
inference(resolution,[],[f12,f6]) ).
fof(f25,plain,
! [X0] :
( 'LE'(f(X0),'0')
| 'E'('0',f(suc(X0))) ),
inference(resolution,[],[f7,f6]) ).
fof(f26,plain,
'E'('0',f(z)),
inference(resolution,[],[f24,f16]) ).
fof(f27,plain,
! [X0] :
( 'LE'(f(X0),'0')
| 'E'('0',f(suc(suc(X0)))) ),
inference(resolution,[],[f14,f6]) ).
fof(f28,plain,
'E'('0',f(suc(z))),
inference(resolution,[],[f25,f16]) ).
fof(f29,plain,
'E'('0',f(suc(suc(z)))),
inference(resolution,[],[f27,f16]) ).
fof(f38,plain,
! [X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(factoring,[],[f11]) ).
fof(f39,plain,
! [X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X1))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'(f(X1),f(suc(X1))) ),
inference(duplicate_literal_removal,[],[f38]) ).
fof(f50,plain,
! [X0] :
( ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'(f(X0),f(suc(X0))) ),
inference(factoring,[],[f39]) ).
fof(f51,plain,
! [X0] :
( ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'(f(X0),f(suc(X0))) ),
inference(duplicate_literal_removal,[],[f50]) ).
fof(f54,plain,
! [X0] :
( ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(resolution,[],[f51,f4]) ).
fof(f57,plain,
! [X0] :
( ~ 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0))) ),
inference(duplicate_literal_removal,[],[f54]) ).
fof(f60,plain,
! [X2,X3,X0,X1] :
( ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X3))) ),
inference(resolution,[],[f57,f3]) ).
fof(f85,plain,
! [X2,X3,X0,X1] :
( 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X3))) ),
inference(duplicate_literal_removal,[],[f60]) ).
fof(f88,plain,
! [X2,X3,X0,X1] :
( ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
inference(resolution,[],[f85,f57]) ).
fof(f89,plain,
! [X2,X3,X0,X1] :
( 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X1)))) ),
inference(duplicate_literal_removal,[],[f88]) ).
fof(f90,plain,
! [X2,X3,X0,X1] :
( ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X3))) ),
inference(resolution,[],[f89,f57]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( 'E'(f(X2),f(suc(X2)))
| ~ iLEQ(suc(X1),suc(X0))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X3)))) ),
inference(duplicate_literal_removal,[],[f90]) ).
fof(f92,plain,
! [X2,X3,X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X0)))
| ~ iLEQ(suc(X2),suc(X3))
| ~ 'E'('0',f(X0))
| ~ iLEQ(suc(X3),suc(X0))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X2))) ),
inference(resolution,[],[f91,f57]) ).
fof(f93,plain,
! [X2,X3,X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X0))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X2)))) ),
inference(duplicate_literal_removal,[],[f92]) ).
fof(f102,plain,
! [X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(factoring,[],[f93]) ).
fof(f103,plain,
! [X0,X1] :
( ~ iLEQ(suc(X0),suc(X1))
| ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(duplicate_literal_removal,[],[f102]) ).
fof(f114,plain,
! [X0] :
( ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(factoring,[],[f103]) ).
fof(f115,plain,
! [X0] :
( ~ iLEQ(suc(X0),suc(X0))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0)))) ),
inference(duplicate_literal_removal,[],[f114]) ).
fof(f125,plain,
! [X0] :
( ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X0)))
| 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(X0)) ),
inference(resolution,[],[f115,f22]) ).
fof(f126,plain,
! [X0] :
( 'E'(f(X0),f(suc(X0)))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0)) ),
inference(duplicate_literal_removal,[],[f125]) ).
fof(f132,plain,
! [X0] :
( ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(X0))
| ~ 'E'('0',f(suc(X0))) ),
inference(resolution,[],[f126,f57]) ).
fof(f133,plain,
! [X0] :
( ~ 'E'('0',f(suc(suc(X0))))
| ~ 'E'('0',f(suc(X0)))
| ~ 'E'('0',f(X0)) ),
inference(duplicate_literal_removal,[],[f132]) ).
fof(f134,plain,
( ~ 'E'('0',f(suc(z)))
| ~ 'E'('0',f(z)) ),
inference(resolution,[],[f133,f29]) ).
fof(f136,definition,
( spl0_1
<=> 'E'('0',f(z)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f137,plain,
( ~ 'E'('0',f(z))
| spl0_1 ),
inference(avatar_component_clause,[],[f136]) ).
fof(f139,definition,
( spl0_2
<=> 'E'('0',f(suc(z))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f140,plain,
( ~ 'E'('0',f(suc(z)))
| spl0_2 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f141,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f134,f139,f136]) ).
fof(f142,plain,
( $false
| spl0_1 ),
inference(resolution,[],[f137,f26]) ).
fof(f143,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f142]) ).
fof(f144,plain,
( $false
| spl0_2 ),
inference(resolution,[],[f140,f28]) ).
fof(f145,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f144]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f141]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f143]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f145]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f146,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO652-1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n006.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 18:00:55 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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
% 2.99/1.09 % (11483)Input is clausal, will run a generic CNF schedule.
% 2.99/1.09 % (11488)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=1756308119:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.99/1.09 % (11493)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3517169504:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.99/1.09 % (11491)lrs+10_1_sil=8000:sp=occurrence:random_seed=1682299214:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.99/1.09 % (11489)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2249730211:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.99/1.09 % (11490)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4159668321:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.99/1.09 % (11492)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1355265855:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.99/1.09 % (11491)Refutation not found, incomplete strategy
% 2.99/1.09 % (11491)------------------------------
% 2.99/1.09 % (11491)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.09 % (11492)Refutation not found, incomplete strategy
% 2.99/1.09 % (11492)------------------------------
% 2.99/1.09 % (11492)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.09 % (11491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.09 % (11492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.09 % (11491)CaDiCaL version: 2.1.3
% 2.99/1.09 % (11491)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.09 % (11491)Time elapsed: 0.001 s
% 2.99/1.09 % (11492)CaDiCaL version: 2.1.3
% 2.99/1.09 % (11491)Peak memory usage: 86 MB
% 2.99/1.09 % (11492)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.09 % (11492)Time elapsed: 0.001 s
% 2.99/1.09 % (11492)Peak memory usage: 86 MB
% 2.99/1.09 % (11494)dis-21_1_sil=8000:lcm=predicate:random_seed=2178767555: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)
% 2.99/1.09 % (11494)First to succeed.
% 2.99/1.09 % (11493)Also succeeded, but the first one will report.
% 2.99/1.09 % (11494)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11483"
% 2.99/1.09 % (11491)------------------------------
% 2.99/1.09 % (11491)------------------------------
% 2.99/1.09 % (11492)------------------------------
% 2.99/1.09 % (11492)------------------------------
% 2.99/1.09 % (11494)Refutation found. Thanks to Tanya!
% 2.99/1.09 % SZS status Unsatisfiable for theBenchmark
% 2.99/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 3.53/1.28 % (11494)------------------------------
% 3.53/1.28 % (11494)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.28 % (11494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.28 % (11494)CaDiCaL version: 2.1.3
% 3.53/1.28 % (11494)Termination reason: Refutation
% 3.53/1.28 % (11494)Time elapsed: 0.009 s
% 3.53/1.28 % (11494)Peak memory usage: 89 MB
% 3.53/1.28 % (11494)Instructions burned: 15 (million)
% 3.53/1.28 % (11494)------------------------------
% 3.53/1.28 % (11494)------------------------------
% 3.53/1.28 % (11483)Success in time 0.417 s
% 3.53/1.28 % Vampire exiting
%------------------------------------------------------------------------------