%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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 11:57:24 AM UTC 2026
% Result : Unsatisfiable 6.78s 17.04s
% Output : Refutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 153 ( 32 unt; 17 def)
% Number of atoms : 366 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 389 ( 176 ~; 196 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 19 ( 18 usr; 18 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 344 ( 0 sgn 344 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_CAMeredith) ).
fof(f3,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_3) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4))))
| is_a_theorem(or(not(or(not(X3),X0)),or(X2,or(X4,X0)))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(not(or(not(X3),X1)),or(or(X4,X1),or(not(X1),X2))))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(or(X0,X1)),X2)),or(not(or(not(X3),X1)),or(or(not(X1),X4),X2)))),
inference(resolution,[],[f5,f4]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,X0))),or(not(or(not(X3),X0)),or(X4,or(X2,X0))))),
inference(resolution,[],[f6,f4]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| is_a_theorem(or(not(or(not(X3),X0)),or(X4,or(X2,X0)))) ),
inference(resolution,[],[f8,f1]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(X0),or(not(X1),or(X2,X1)))),or(X3,or(not(or(not(X4),X1)),or(not(X1),or(X2,X1)))))),
inference(resolution,[],[f19,f2]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(X0),or(or(not(X1),X2),X1))),or(X3,or(not(or(not(X4),X1)),or(or(not(X1),X2),X1))))),
inference(resolution,[],[f19,f6]) ).
fof(f140,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(not(or(not(X0),X1))),X2)),or(X3,or(or(not(X1),or(X4,X1)),X2)))),
inference(resolution,[],[f20,f4]) ).
fof(f149,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(X0),or(not(X1),or(X2,X1))))
| is_a_theorem(or(X3,or(not(or(not(X4),X1)),or(not(X1),or(X2,X1))))) ),
inference(resolution,[],[f20,f1]) ).
fof(f160,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(or(not(or(not(X0),or(not(or(not(X1),X2)),or(or(not(X2),X3),X2)))),or(X4,or(X5,or(not(or(not(X1),X2)),or(or(not(X2),X3),X2)))))),
inference(resolution,[],[f23,f19]) ).
fof(f1065,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2))))),
inference(resolution,[],[f149,f140]) ).
fof(f1266,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2)))) ),
inference(resolution,[],[f1065,f1]) ).
fof(f1291,definition,
( spl0_1
<=> ! [X2,X4,X1,X3] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f1292,plain,
( ! [X2,X3,X1,X4] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(or(not(X3),or(X4,X3)),X2))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f1291]) ).
fof(f1294,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f1295,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f1294]) ).
fof(f1296,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f1266,f1294,f1291]) ).
fof(f1442,plain,
( $false
| ~ spl0_2 ),
inference(backward_subsumption_resolution,[],[f1065,f1295]) ).
fof(f1521,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f1442]) ).
fof(f1525,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(not(or(not(or(not(X0),or(X1,X0))),X2)),or(not(X3),or(X3,X2))))
| ~ spl0_1 ),
inference(resolution,[],[f4,f1292]) ).
fof(f1547,definition,
( spl0_3
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(X3,X1)))) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f1548,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(not(not(X1)),X1)),or(X2,or(X3,X1))))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f1547]) ).
fof(f3681,plain,
( ! [X2,X0,X1] : is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))))
| ~ spl0_1 ),
inference(resolution,[],[f149,f1525]) ).
fof(f3787,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))) )
| ~ spl0_1 ),
inference(resolution,[],[f3681,f1]) ).
fof(f3809,definition,
( spl0_12
<=> ! [X2,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f3810,plain,
( ! [X2,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X2,X2))))
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f3809]) ).
fof(f3811,plain,
( spl0_12
| spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f3787,f1291,f1294,f3809]) ).
fof(f3812,plain,
( ! [X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(not(X0),or(X0,X1))))
| ~ spl0_12 ),
inference(resolution,[],[f3810,f4]) ).
fof(f3813,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),or(X1,X1))),or(X2,or(not(X1),or(X1,X1)))))
| ~ spl0_12 ),
inference(resolution,[],[f3810,f19]) ).
fof(f4033,plain,
( ! [X0,X1] : is_a_theorem(or(not(or(not(X0),X0)),or(not(X0),or(X1,X0))))
| ~ spl0_12 ),
inference(resolution,[],[f3812,f4]) ).
fof(f4199,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))))
| ~ spl0_12 ),
inference(resolution,[],[f4033,f149]) ).
fof(f4667,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) )
| ~ spl0_12 ),
inference(resolution,[],[f4199,f1]) ).
fof(f4694,definition,
( spl0_14
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f4695,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2))))
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f4694]) ).
fof(f4696,plain,
( spl0_14
| spl0_2
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f4667,f3809,f1294,f4694]) ).
fof(f4717,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(not(X2),or(X2,X1))))
| ~ spl0_14 ),
inference(resolution,[],[f4695,f4]) ).
fof(f4718,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(not(or(not(X0),or(X1,X2))),or(X3,or(not(X2),or(X1,X2)))))
| ~ spl0_14 ),
inference(resolution,[],[f4695,f19]) ).
fof(f4735,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| is_a_theorem(or(not(X1),or(X2,X1))) )
| ~ spl0_14 ),
inference(resolution,[],[f4695,f1]) ).
fof(f5126,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(not(X0),or(X2,X1))))
| ~ spl0_14 ),
inference(resolution,[],[f4717,f4]) ).
fof(f5775,plain,
( ! [X2,X0,X1] :
( is_a_theorem(or(not(X0),or(X2,X1)))
| ~ is_a_theorem(or(not(X0),X1)) )
| ~ spl0_14 ),
inference(resolution,[],[f5126,f1]) ).
fof(f5863,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(X0)
| is_a_theorem(or(X2,X1)) )
| ~ spl0_14 ),
inference(resolution,[],[f5775,f1]) ).
fof(f5897,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(X0),X3))
| is_a_theorem(or(X1,or(X2,X3)))
| ~ is_a_theorem(X0) )
| ~ spl0_14 ),
inference(resolution,[],[f5863,f5775]) ).
fof(f7589,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(or(not(X0),or(not(or(not(X1),X2)),or(or(not(X2),X3),X2))))
| is_a_theorem(or(X4,or(X5,or(not(or(not(X1),X2)),or(or(not(X2),X3),X2))))) ),
inference(resolution,[],[f160,f1]) ).
fof(f17689,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(not(X0)),X1)),or(X2,or(or(X0,X0),X1))))
| ~ spl0_12 ),
inference(resolution,[],[f3813,f4]) ).
fof(f17750,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(or(X0,X0)),not(X0))),or(X1,or(X2,not(X0)))))
| ~ spl0_12 ),
inference(resolution,[],[f17689,f4]) ).
fof(f21481,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(X0),or(X1,X2)))
| is_a_theorem(or(X3,or(not(X2),or(X1,X2)))) )
| ~ spl0_14 ),
inference(resolution,[],[f4718,f1]) ).
fof(f22498,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))))
| ~ spl0_12
| ~ spl0_14 ),
inference(resolution,[],[f21481,f17750]) ).
fof(f22561,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(not(or(X1,X2)),or(not(X3),or(X1,X2)))))
| ~ spl0_14 ),
inference(resolution,[],[f21481,f5126]) ).
fof(f24005,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(X1,X2)),or(not(X3),or(X1,X2)))) )
| ~ spl0_14 ),
inference(resolution,[],[f22561,f1]) ).
fof(f24065,definition,
( spl0_151
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(X1,X2)),or(not(X3),or(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_151])],[avatar_definition]) ).
fof(f24066,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(X1,X2)),or(not(X3),or(X1,X2))))
| ~ spl0_151 ),
inference(avatar_component_clause,[],[f24065]) ).
fof(f24067,plain,
( spl0_151
| spl0_2
| ~ spl0_14 ),
inference(avatar_split_clause,[],[f24005,f4694,f1294,f24065]) ).
fof(f24103,plain,
( ! [X2,X0,X1] :
( is_a_theorem(or(not(X2),or(X0,X1)))
| ~ is_a_theorem(or(X0,X1)) )
| ~ spl0_151 ),
inference(resolution,[],[f24066,f1]) ).
fof(f24181,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X2,or(X3,or(X0,X1))))
| ~ is_a_theorem(X4) )
| ~ spl0_14
| ~ spl0_151 ),
inference(resolution,[],[f24103,f5897]) ).
fof(f24220,definition,
( spl0_153
<=> ! [X2,X0,X1,X3] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X2,or(X3,or(X0,X1)))) ) ),
introduced(definition,[new_symbols(definition,[spl0_153])],[avatar_definition]) ).
fof(f24221,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(or(X2,or(X3,or(X0,X1))))
| ~ is_a_theorem(or(X0,X1)) )
| ~ spl0_153 ),
inference(avatar_component_clause,[],[f24220]) ).
fof(f24222,plain,
( spl0_2
| spl0_153
| ~ spl0_14
| ~ spl0_151 ),
inference(avatar_split_clause,[],[f24181,f24065,f4694,f24220,f1294]) ).
fof(f24430,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(or(not(or(not(X0),X2)),or(X3,or(X1,X2))))
| ~ is_a_theorem(or(X0,X1)) )
| ~ spl0_153 ),
inference(resolution,[],[f24221,f4]) ).
fof(f24780,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))) )
| ~ spl0_12
| ~ spl0_14 ),
inference(resolution,[],[f22498,f1]) ).
fof(f24841,definition,
( spl0_159
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2))))) ),
introduced(definition,[new_symbols(definition,[spl0_159])],[avatar_definition]) ).
fof(f24842,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(X1,not(X2))),or(X3,or(X1,not(X2)))))
| ~ spl0_159 ),
inference(avatar_component_clause,[],[f24841]) ).
fof(f24843,plain,
( spl0_159
| spl0_2
| ~ spl0_12
| ~ spl0_14 ),
inference(avatar_split_clause,[],[f24780,f4694,f3809,f1294,f24841]) ).
fof(f24844,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(not(X0)),X0)),or(X1,or(not(X2),X0))))
| ~ spl0_159 ),
inference(resolution,[],[f24842,f4]) ).
fof(f24930,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))))
| ~ spl0_14
| ~ spl0_159 ),
inference(resolution,[],[f24844,f21481]) ).
fof(f25988,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))) )
| ~ spl0_14
| ~ spl0_159 ),
inference(resolution,[],[f24930,f1]) ).
fof(f26048,definition,
( spl0_169
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_169])],[avatar_definition]) ).
fof(f26049,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(X3,or(not(X1),X2))))
| ~ spl0_169 ),
inference(avatar_component_clause,[],[f26048]) ).
fof(f26050,plain,
( spl0_169
| spl0_2
| ~ spl0_14
| ~ spl0_159 ),
inference(avatar_split_clause,[],[f25988,f24841,f4694,f1294,f26048]) ).
fof(f26051,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(not(X0)),X0)),or(X1,or(X2,X0))))
| ~ spl0_169 ),
inference(resolution,[],[f26049,f4]) ).
fof(f26116,plain,
( spl0_3
| ~ spl0_169 ),
inference(avatar_split_clause,[],[f26051,f26048,f1547]) ).
fof(f26150,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(not(or(X1,X2)),or(X3,or(X1,X2)))))
| ~ spl0_3
| ~ spl0_14 ),
inference(resolution,[],[f1548,f21481]) ).
fof(f26723,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))) )
| ~ spl0_3
| ~ spl0_14 ),
inference(resolution,[],[f26150,f1]) ).
fof(f26784,definition,
( spl0_177
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_177])],[avatar_definition]) ).
fof(f26785,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2))))
| ~ spl0_177 ),
inference(avatar_component_clause,[],[f26784]) ).
fof(f26786,plain,
( spl0_177
| spl0_2
| ~ spl0_3
| ~ spl0_14 ),
inference(avatar_split_clause,[],[f26723,f4694,f1547,f1294,f26784]) ).
fof(f34474,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(X0),X2))
| ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X3,or(X1,X2))) )
| ~ spl0_153 ),
inference(resolution,[],[f24430,f1]) ).
fof(f34713,plain,
( ! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(X3,or(X2,or(X4,or(X0,X1)))))
| ~ is_a_theorem(or(or(X0,X1),X2)) )
| ~ spl0_153
| ~ spl0_177 ),
inference(resolution,[],[f34474,f26785]) ).
fof(f39480,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(or(X0,X1),X2))
| ~ is_a_theorem(X3)
| is_a_theorem(or(X2,or(X4,or(X0,X1)))) )
| ~ spl0_153
| ~ spl0_177 ),
inference(resolution,[],[f34713,f1]) ).
fof(f39561,definition,
( spl0_233
<=> ! [X4,X0,X2,X1] :
( ~ is_a_theorem(or(or(X0,X1),X2))
| is_a_theorem(or(X2,or(X4,or(X0,X1)))) ) ),
introduced(definition,[new_symbols(definition,[spl0_233])],[avatar_definition]) ).
fof(f39562,plain,
( ! [X2,X0,X1,X4] :
( is_a_theorem(or(X2,or(X4,or(X0,X1))))
| ~ is_a_theorem(or(or(X0,X1),X2)) )
| ~ spl0_233 ),
inference(avatar_component_clause,[],[f39561]) ).
fof(f39563,plain,
( spl0_2
| spl0_233
| ~ spl0_153
| ~ spl0_177 ),
inference(avatar_split_clause,[],[f39480,f26784,f24220,f39561,f1294]) ).
fof(f39597,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(or(X0,X1),not(X2)))
| ~ is_a_theorem(X2)
| is_a_theorem(or(X3,or(X0,X1))) )
| ~ spl0_233 ),
inference(resolution,[],[f39562,f1]) ).
fof(f40868,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X3))))),
inference(resolution,[],[f7589,f6]) ).
fof(f41543,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X3)))) ),
inference(resolution,[],[f40868,f1]) ).
fof(f41626,definition,
( spl0_246
<=> ! [X4,X2,X1,X3] : is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X3)))) ),
introduced(definition,[new_symbols(definition,[spl0_246])],[avatar_definition]) ).
fof(f41627,plain,
( ! [X2,X3,X1,X4] : is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X3))))
| ~ spl0_246 ),
inference(avatar_component_clause,[],[f41626]) ).
fof(f41628,plain,
( spl0_246
| spl0_2 ),
inference(avatar_split_clause,[],[f41543,f1294,f41626]) ).
fof(f42105,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X2))) )
| ~ spl0_246 ),
inference(resolution,[],[f41627,f1]) ).
fof(f42184,definition,
( spl0_247
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X2))) ),
introduced(definition,[new_symbols(definition,[spl0_247])],[avatar_definition]) ).
fof(f42185,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X2)))
| ~ spl0_247 ),
inference(avatar_component_clause,[],[f42184]) ).
fof(f42186,plain,
( spl0_247
| spl0_2
| ~ spl0_246 ),
inference(avatar_split_clause,[],[f42105,f41626,f1294,f42184]) ).
fof(f42188,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(or(not(X1),X3),X1))))
| ~ spl0_247 ),
inference(resolution,[],[f42185,f19]) ).
fof(f45826,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(not(or(not(or(not(X0),X1)),X2)),or(X3,or(X0,X2))))
| ~ spl0_247 ),
inference(resolution,[],[f42188,f4]) ).
fof(f46415,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),X2))
| is_a_theorem(or(X3,or(X0,X2))) )
| ~ spl0_247 ),
inference(resolution,[],[f45826,f1]) ).
fof(f46462,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(X1,or(or(not(X2),X3),X2))))
| ~ spl0_247 ),
inference(resolution,[],[f46415,f42185]) ).
fof(f47030,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(X1,or(or(not(X2),X3),X2))) )
| ~ spl0_247 ),
inference(resolution,[],[f46462,f1]) ).
fof(f47119,definition,
( spl0_270
<=> ! [X2,X1,X3] : is_a_theorem(or(X1,or(or(not(X2),X3),X2))) ),
introduced(definition,[new_symbols(definition,[spl0_270])],[avatar_definition]) ).
fof(f47120,plain,
( ! [X2,X3,X1] : is_a_theorem(or(X1,or(or(not(X2),X3),X2)))
| ~ spl0_270 ),
inference(avatar_component_clause,[],[f47119]) ).
fof(f47121,plain,
( spl0_270
| spl0_2
| ~ spl0_247 ),
inference(avatar_split_clause,[],[f47030,f42184,f1294,f47119]) ).
fof(f47134,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(or(not(X1),X2),X1)) )
| ~ spl0_270 ),
inference(resolution,[],[f47120,f1]) ).
fof(f47219,definition,
( spl0_271
<=> ! [X2,X1] : is_a_theorem(or(or(not(X1),X2),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_271])],[avatar_definition]) ).
fof(f47220,plain,
( ! [X2,X1] : is_a_theorem(or(or(not(X1),X2),X1))
| ~ spl0_271 ),
inference(avatar_component_clause,[],[f47219]) ).
fof(f47221,plain,
( spl0_271
| spl0_2
| ~ spl0_270 ),
inference(avatar_split_clause,[],[f47134,f47119,f1294,f47219]) ).
fof(f47222,plain,
( ! [X2,X0,X1] :
( is_a_theorem(or(X1,or(not(not(X0)),X2)))
| ~ is_a_theorem(X0) )
| ~ spl0_233
| ~ spl0_271 ),
inference(resolution,[],[f47220,f39597]) ).
fof(f47247,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(or(not(not(X0)),X2)) )
| ~ spl0_233
| ~ spl0_271 ),
inference(resolution,[],[f47222,f1]) ).
fof(f47336,definition,
( spl0_274
<=> ! [X2,X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(not(X0)),X2)) ) ),
introduced(definition,[new_symbols(definition,[spl0_274])],[avatar_definition]) ).
fof(f47337,plain,
( ! [X2,X0] :
( is_a_theorem(or(not(not(X0)),X2))
| ~ is_a_theorem(X0) )
| ~ spl0_274 ),
inference(avatar_component_clause,[],[f47336]) ).
fof(f47338,plain,
( spl0_2
| spl0_274
| ~ spl0_233
| ~ spl0_271 ),
inference(avatar_split_clause,[],[f47247,f47219,f39561,f47336,f1294]) ).
fof(f47374,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(X1),or(X2,X1))) )
| ~ spl0_14
| ~ spl0_274 ),
inference(resolution,[],[f47337,f4735]) ).
fof(f47529,definition,
( spl0_297
<=> ! [X2,X1] : is_a_theorem(or(not(X1),or(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_297])],[avatar_definition]) ).
fof(f47530,plain,
( ! [X2,X1] : is_a_theorem(or(not(X1),or(X2,X1)))
| ~ spl0_297 ),
inference(avatar_component_clause,[],[f47529]) ).
fof(f47531,plain,
( spl0_297
| spl0_2
| ~ spl0_14
| ~ spl0_274 ),
inference(avatar_split_clause,[],[f47374,f47336,f4694,f1294,f47529]) ).
fof(f50791,plain,
( $false
| ~ spl0_297 ),
inference(backward_subsumption_resolution,[],[f3,f47530]) ).
fof(f50894,plain,
~ spl0_297,
inference(avatar_contradiction_clause,[],[f50791]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f1296]) ).
cnf(s79,plain,
~ spl0_2,
inference(sat_conversion,[],[f1521]) ).
cnf(s87,plain,
( ~ spl0_1
| spl0_2
| spl0_12 ),
inference(sat_conversion,[],[f3811]) ).
cnf(s89,plain,
( spl0_2
| ~ spl0_12
| spl0_14 ),
inference(sat_conversion,[],[f4696]) ).
cnf(s273,plain,
( spl0_2
| ~ spl0_14
| spl0_151 ),
inference(sat_conversion,[],[f24067]) ).
cnf(s275,plain,
( spl0_2
| ~ spl0_14
| ~ spl0_151
| spl0_153 ),
inference(sat_conversion,[],[f24222]) ).
cnf(s285,plain,
( spl0_2
| ~ spl0_12
| ~ spl0_14
| spl0_159 ),
inference(sat_conversion,[],[f24843]) ).
cnf(s295,plain,
( spl0_2
| ~ spl0_14
| ~ spl0_159
| spl0_169 ),
inference(sat_conversion,[],[f26050]) ).
cnf(s297,plain,
( spl0_3
| ~ spl0_169 ),
inference(sat_conversion,[],[f26116]) ).
cnf(s356,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_14
| spl0_177 ),
inference(sat_conversion,[],[f26786]) ).
cnf(s627,plain,
( spl0_2
| ~ spl0_153
| ~ spl0_177
| spl0_233 ),
inference(sat_conversion,[],[f39563]) ).
cnf(s641,plain,
( spl0_2
| spl0_246 ),
inference(sat_conversion,[],[f41628]) ).
cnf(s646,plain,
( spl0_2
| ~ spl0_246
| spl0_247 ),
inference(sat_conversion,[],[f42186]) ).
cnf(s754,plain,
( spl0_2
| ~ spl0_247
| spl0_270 ),
inference(sat_conversion,[],[f47121]) ).
cnf(s760,plain,
( spl0_2
| ~ spl0_270
| spl0_271 ),
inference(sat_conversion,[],[f47221]) ).
cnf(s763,plain,
( spl0_2
| ~ spl0_233
| ~ spl0_271
| spl0_274 ),
inference(sat_conversion,[],[f47338]) ).
cnf(s793,plain,
( spl0_2
| ~ spl0_14
| ~ spl0_274
| spl0_297 ),
inference(sat_conversion,[],[f47531]) ).
cnf(s1536,plain,
~ spl0_297,
inference(sat_conversion,[],[f50894]) ).
cnf(s1550,plain,
( spl0_2
| ~ spl0_14
| ~ spl0_274 ),
inference(rat,[],[s793,s1536]) ).
cnf(s1551,plain,
spl0_246,
inference(rat,[],[s641,s79]) ).
cnf(s1562,plain,
spl0_247,
inference(rat,[],[s646,s79,s1551]) ).
cnf(s1563,plain,
spl0_270,
inference(rat,[],[s754,s79,s1562]) ).
cnf(s1602,plain,
spl0_271,
inference(rat,[],[s760,s79,s1563]) ).
cnf(s1603,plain,
spl0_1,
inference(rat,[],[s1,s79]) ).
cnf(s1607,plain,
spl0_12,
inference(rat,[],[s87,s79,s1603]) ).
cnf(s1613,plain,
spl0_14,
inference(rat,[],[s89,s79,s1607]) ).
cnf(s1617,plain,
~ spl0_274,
inference(rat,[],[s1550,s79,s1613]) ).
cnf(s1644,plain,
spl0_151,
inference(rat,[],[s273,s79,s1613]) ).
cnf(s1686,plain,
spl0_159,
inference(rat,[],[s285,s1607,s79,s1613]) ).
cnf(s1748,plain,
~ spl0_233,
inference(rat,[],[s763,s1602,s79,s1617]) ).
cnf(s1754,plain,
spl0_153,
inference(rat,[],[s275,s1613,s79,s1644]) ).
cnf(s1767,plain,
spl0_169,
inference(rat,[],[s295,s1613,s79,s1686]) ).
cnf(s1788,plain,
~ spl0_177,
inference(rat,[],[s627,s1748,s79,s1754]) ).
cnf(s1791,plain,
spl0_3,
inference(rat,[],[s297,s1767]) ).
cnf(s1795,plain,
$false,
inference(rat,[],[s356,s1613,s79,s1788,s1791]) ).
fof(f50906,plain,
$false,
inference(avatar_sat_refutation,[],[s1795]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/15.62 % Computer : n013.cluster.edu
% 0.11/15.62 % Model : x86_64 x86_64
% 0.11/15.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.62 % Memory : 8046.5625MB
% 0.11/15.62 % OS : Linux 6.8.0-71-generic
% 0.11/15.63 % CPULimit : 300
% 0.11/15.63 % WCLimit : 300
% 0.11/15.63 % DateTime : Sun Sep 27 15:16:16 UTC 2026
% 0.11/15.63 % CPUTime :
% 0.11/15.63 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/15.66 Running first-order model finding
% 0.11/15.66 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.78/17.04 % (335911)Will run a generic schedule for satisfiability detection.
% 6.78/17.04 % (335921)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2758321170:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.78/17.04 % (335917)% WARNING: option uhcvi not known.
% 6.78/17.04 % (335916)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2383902019_2999 on theBenchmark for (2999ds/0Mi)
% 6.78/17.04 % (335917)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=420825711:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.78/17.04 % (335918)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2942691544:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.78/17.04 % (335919)dis+10_1_sil=32000:sp=arity:random_seed=2576485486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.78/17.04 % (335920)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4090653513:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.78/17.04 % (335922)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2678937323:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.78/17.04 % TRYING [1]
% 6.78/17.04 % TRYING [2]
% 6.78/17.04 % TRYING [3]
% 6.78/17.04 % (335921)Instruction limit reached!
% 6.78/17.04 % (335921)------------------------------
% 6.78/17.04 % (335921)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335921)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335921)Termination reason: Instruction limit
% 6.78/17.04 % (335921)Termination phase: Saturation
% 6.78/17.04 % (335921)Time elapsed: 0.043 s
% 6.78/17.04 % (335921)Peak memory usage: 13 MB
% 6.78/17.04 % (335921)Instructions burned: 132 (million)
% 6.78/17.04 % (335930)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1350447355:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.78/17.04 % TRYING [1]
% 6.78/17.04 % TRYING [2]
% 6.78/17.04 % TRYING [3]
% 6.78/17.04 % (335919)Instruction limit reached!
% 6.78/17.04 % (335919)------------------------------
% 6.78/17.04 % (335919)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335919)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335919)Termination reason: Instruction limit
% 6.78/17.04 % (335919)Termination phase: Saturation
% 6.78/17.04 % (335919)Time elapsed: 0.062 s
% 6.78/17.04 % (335919)Peak memory usage: 12 MB
% 6.78/17.04 % (335919)Instructions burned: 103 (million)
% 6.78/17.04 % (335920)Instruction limit reached!
% 6.78/17.04 % (335920)------------------------------
% 6.78/17.04 % (335920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335920)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335920)Termination reason: Instruction limit
% 6.78/17.04 % (335920)Termination phase: Saturation
% 6.78/17.04 % (335920)Time elapsed: 0.071 s
% 6.78/17.04 % (335920)Peak memory usage: 11 MB
% 6.78/17.04 % (335920)Instructions burned: 116 (million)
% 6.78/17.04 % (335932)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3944795395:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.78/17.04 % (335933)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=3332035518:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.78/17.04 % TRYING [4]
% 6.78/17.04 % (335922)Instruction limit reached!
% 6.78/17.04 % (335922)------------------------------
% 6.78/17.04 % (335922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335922)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335922)Termination reason: Instruction limit
% 6.78/17.04 % (335922)Termination phase: Saturation
% 6.78/17.04 % (335922)Time elapsed: 0.099 s
% 6.78/17.04 % (335922)Peak memory usage: 12 MB
% 6.78/17.04 % (335922)Instructions burned: 161 (million)
% 6.78/17.04 % TRYING [4]
% 6.78/17.04 % (335936)ott-21_1_sil=16000:fs=off:random_seed=3950138439:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.78/17.04 % (335932)Instruction limit reached!
% 6.78/17.04 % (335932)------------------------------
% 6.78/17.04 % (335932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335932)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335932)Termination reason: Instruction limit
% 6.78/17.04 % (335932)Termination phase: Saturation
% 6.78/17.04 % (335932)Time elapsed: 0.077 s
% 6.78/17.04 % (335932)Peak memory usage: 12 MB
% 6.78/17.04 % (335932)Instructions burned: 132 (million)
% 6.78/17.04 % (335938)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=515739823:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.78/17.04 % (335936)Instruction limit reached!
% 6.78/17.04 % (335936)------------------------------
% 6.78/17.04 % (335936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335936)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335936)Termination reason: Instruction limit
% 6.78/17.04 % (335936)Termination phase: Saturation
% 6.78/17.04 % (335936)Time elapsed: 0.093 s
% 6.78/17.04 % (335936)Peak memory usage: 11 MB
% 6.78/17.04 % (335936)Instructions burned: 180 (million)
% 6.78/17.04 % (335940)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=605502333:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.78/17.04 % TRYING [1]
% 6.78/17.04 % TRYING [2]
% 6.78/17.04 % TRYING [3]
% 6.78/17.04 % (335930)Instruction limit reached!
% 6.78/17.04 % (335930)------------------------------
% 6.78/17.04 % (335930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335930)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335930)Termination reason: Instruction limit
% 6.78/17.04 % (335930)Termination phase: Finite model building SAT solving
% 6.78/17.04 % (335930)Time elapsed: 0.234 s
% 6.78/17.04 % (335930)Peak memory usage: 14 MB
% 6.78/17.04 % (335930)Instructions burned: 718 (million)
% 6.78/17.04 % (335942)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2859815966:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 6.78/17.04 % TRYING [4]
% 6.78/17.04 % (335938)Instruction limit reached!
% 6.78/17.04 % (335938)------------------------------
% 6.78/17.04 % (335938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335938)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335938)Termination reason: Instruction limit
% 6.78/17.04 % (335938)Termination phase: Saturation
% 6.78/17.04 % (335938)Time elapsed: 0.303 s
% 6.78/17.04 % (335938)Peak memory usage: 15 MB
% 6.78/17.04 % (335938)Instructions burned: 478 (million)
% 6.78/17.04 % (335944)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3902653130:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 6.78/17.04 % (335933)Instruction limit reached!
% 6.78/17.04 % (335933)------------------------------
% 6.78/17.04 % (335933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335933)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335933)Termination reason: Instruction limit
% 6.78/17.04 % (335933)Termination phase: Saturation
% 6.78/17.04 % (335933)Time elapsed: 0.412 s
% 6.78/17.04 % (335933)Peak memory usage: 21 MB
% 6.78/17.04 % (335933)Instructions burned: 685 (million)
% 6.78/17.04 % (335946)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2798936314:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 6.78/17.04 % TRYING [14]
% 6.78/17.04 % (335942)Instruction limit reached!
% 6.78/17.04 % (335942)------------------------------
% 6.78/17.04 % (335942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335942)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335942)Termination reason: Instruction limit
% 6.78/17.04 % (335942)Termination phase: Saturation
% 6.78/17.04 % (335942)Time elapsed: 0.380 s
% 6.78/17.04 % (335942)Peak memory usage: 24 MB
% 6.78/17.04 % (335942)Instructions burned: 1181 (million)
% 6.78/17.04 % (335948)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1064632755:i=879:kws=inv_precedence:fsr=off_2992 on theBenchmark for (2992ds/879Mi)
% 6.78/17.04 % (335940)Instruction limit reached!
% 6.78/17.04 % (335940)------------------------------
% 6.78/17.04 % (335940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335940)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335940)Termination reason: Instruction limit
% 6.78/17.04 % (335940)Termination phase: Finite model building SAT solving
% 6.78/17.04 % (335940)Time elapsed: 0.563 s
% 6.78/17.04 % (335940)Peak memory usage: 13 MB
% 6.78/17.04 % (335940)Instructions burned: 865 (million)
% 6.78/17.04 % (335950)fmb+10_1_sil=64000:random_seed=1695609800:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 6.78/17.04 % TRYING [1]
% 6.78/17.04 % TRYING [2]
% 6.78/17.04 % TRYING [3]
% 6.78/17.04 % (335944)Instruction limit reached!
% 6.78/17.04 % (335944)------------------------------
% 6.78/17.04 % (335944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335944)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335944)Termination reason: Instruction limit
% 6.78/17.04 % (335944)Termination phase: Finite model building constraint generation
% 6.78/17.04 % (335944)Time elapsed: 0.326 s
% 6.78/17.04 % (335944)Peak memory usage: 76 MB
% 6.78/17.04 % (335944)Instructions burned: 891 (million)
% 6.78/17.04 % (335952)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2467384073:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 6.78/17.04 % TRYING [20]
% 6.78/17.04 % TRYING [4]
% 6.78/17.04 % (335948)Instruction limit reached!
% 6.78/17.04 % (335948)------------------------------
% 6.78/17.04 % (335948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335948)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335948)Termination reason: Instruction limit
% 6.78/17.04 % (335948)Termination phase: Saturation
% 6.78/17.04 % (335948)Time elapsed: 0.260 s
% 6.78/17.04 % (335948)Peak memory usage: 17 MB
% 6.78/17.04 % (335948)Instructions burned: 883 (million)
% 6.78/17.04 % (335954)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=4229113839:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 6.78/17.04 % TRYING [8]
% 6.78/17.04 % (335946)Instruction limit reached!
% 6.78/17.04 % (335946)------------------------------
% 6.78/17.04 % (335946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335946)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335946)Termination reason: Instruction limit
% 6.78/17.04 % (335946)Termination phase: Saturation
% 6.78/17.04 % (335946)Time elapsed: 0.454 s
% 6.78/17.04 % (335946)Peak memory usage: 19 MB
% 6.78/17.04 % (335946)Instructions burned: 692 (million)
% 6.78/17.04 % (335956)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=812394331:i=5131_2989 on theBenchmark for (2989ds/5131Mi)
% 6.78/17.04 % (335954)Instruction limit reached!
% 6.78/17.04 % (335954)------------------------------
% 6.78/17.04 % (335954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.04 % (335954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.04 % (335954)CaDiCaL version: 2.1.3
% 6.78/17.04 % (335954)Termination reason: Instruction limit
% 6.78/17.04 % (335954)Termination phase: Finite model building constraint generation
% 6.78/17.04 % (335954)Time elapsed: 0.188 s
% 6.78/17.04 % (335954)Peak memory usage: 62 MB
% 6.78/17.04 % (335954)Instructions burned: 922 (million)
% 6.78/17.04 % (335958)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2389982476:i=1472:ins=7:fdi=8:gsp=on_2988 on theBenchmark for (2988ds/1472Mi)
% 6.78/17.04 % (335917) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-335911-335917"...
% 6.78/17.04 % (335917)...printing done.
% 6.78/17.04 % (335917)Refutation found. Thanks to Tanya!
% 6.78/17.04 % SZS status Unsatisfiable for theBenchmark
% 6.78/17.04 % SZS output start Proof for theBenchmark
% See solution above
% 6.78/17.05 % (335917)------------------------------
% 6.78/17.05 % (335917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.78/17.05 % (335917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.78/17.05 % (335917)CaDiCaL version: 2.1.3
% 6.78/17.05 % (335917)Termination reason: Refutation
% 6.78/17.05 % (335917)Time elapsed: 1.326 s
% 6.78/17.05 % (335917)Peak memory usage: 38 MB
% 6.78/17.05 % (335917)Instructions burned: 2264 (million)
% 6.78/17.05 % (335911)Success in time 1.374 s
% 6.78/17.05 % Vampire exiting
%------------------------------------------------------------------------------