%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL325-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:51:59 AM UTC 2026
% Result : Unsatisfiable 13.50s 2.56s
% Output : Refutation 14.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 132 ( 42 unt; 8 def)
% Number of atoms : 251 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 232 ( 113 ~; 111 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 12 ( 10 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 191 ( 0 sgn 191 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(or(p,q),not(and(p,q))),equivalent(p,not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
~ theorem(not(or(not(or(not(not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))),not(or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))),not(or(not(not(or(not(or(not(p),not(q))),not(or(not(not(q)),p))))),not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))))))),
inference(definition_unfolding,[],[f11,f12,f9,f9,f12]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f15,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f17,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f18,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f20,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f7,f16]) ).
fof(f21,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f14]) ).
fof(f22,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f7,f15]) ).
fof(f23,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f17,f7]) ).
fof(f24,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f18,f7]) ).
fof(f25,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f19,f21]) ).
fof(f26,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f19,f20]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f19,f22]) ).
fof(f30,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f27,f21]) ).
fof(f31,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f27,f20]) ).
fof(f33,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f27,f23]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f25,f19]) ).
fof(f36,plain,
! [X2,X0,X1] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f25,f27]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(X0,or(not(X2),X3))) ),
inference(resolution,[],[f35,f21]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f35,f20]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f35,f25]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f35,f30]) ).
fof(f51,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f35,f23]) ).
fof(f52,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f35,f24]) ).
fof(f58,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f47,f23]) ).
fof(f60,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f58,f35]) ).
fof(f63,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(resolution,[],[f58,f27]) ).
fof(f69,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f52,f58]) ).
fof(f76,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f69,f26]) ).
fof(f77,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f76,f35]) ).
fof(f81,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f31,f19]) ).
fof(f85,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(resolution,[],[f48,f21]) ).
fof(f86,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f48,f20]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(not(or(X0,X3)),X2))
| ~ theorem(or(not(X3),X1)) ),
inference(resolution,[],[f85,f19]) ).
fof(f115,plain,
! [X0,X1] :
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ),
inference(resolution,[],[f81,f26]) ).
fof(f118,plain,
! [X0,X1] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f77,f26]) ).
fof(f134,plain,
! [X0,X1] :
( theorem(not(or(not(X1),not(X0))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f115,f19]) ).
fof(f136,plain,
( ~ theorem(or(not(not(or(not(or(not(p),not(q))),not(or(not(not(q)),p))))),not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))))
| ~ theorem(or(not(not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))),not(or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))) ),
inference(resolution,[],[f134,f13]) ).
fof(f138,definition,
( spl0_1
<=> theorem(or(not(not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))),not(or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f140,plain,
( ~ theorem(or(not(not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))),not(or(not(or(not(p),not(q))),not(or(not(not(q)),p))))))
| spl0_1 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f142,definition,
( spl0_2
<=> theorem(or(not(not(or(not(or(not(p),not(q))),not(or(not(not(q)),p))))),not(or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f144,plain,
( ~ theorem(or(not(not(or(not(or(not(p),not(q))),not(or(not(not(q)),p))))),not(or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))))
| spl0_2 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f145,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f136,f142,f138]) ).
fof(f146,plain,
( ~ theorem(or(not(or(not(or(not(p),not(q))),not(or(not(not(q)),p)))),or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))
| spl0_1 ),
inference(resolution,[],[f140,f118]) ).
fof(f151,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[],[f63,f47]) ).
fof(f156,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f86,f19]) ).
fof(f160,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f86,f52]) ).
fof(f190,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),X2))
| ~ theorem(or(not(X1),X2))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f96,f160]) ).
fof(f272,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f60,f27]) ).
fof(f287,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(X0),or(not(X1),X2)))
| theorem(or(not(or(X3,X1)),or(X3,X2)))
| ~ theorem(X0) ),
inference(resolution,[],[f46,f19]) ).
fof(f365,plain,
! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[],[f33,f47]) ).
fof(f369,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
| ~ theorem(X2) ),
inference(resolution,[],[f365,f287]) ).
fof(f378,definition,
( spl0_3
<=> ! [X2] : ~ theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f379,plain,
( ! [X2] : ~ theorem(X2)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f378]) ).
fof(f381,definition,
( spl0_4
<=> ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f382,plain,
( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1)))))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f383,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f369,f381,f378]) ).
fof(f384,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f379,f21]) ).
fof(f437,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f384]) ).
fof(f443,plain,
( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(not(not(X1)),X0)))
| ~ spl0_4 ),
inference(resolution,[],[f382,f47]) ).
fof(f537,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X2),X0)),X1))
| ~ theorem(or(not(X0),X1))
| ~ theorem(X2) ),
inference(resolution,[],[f36,f19]) ).
fof(f680,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ),
inference(resolution,[],[f156,f76]) ).
fof(f894,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X0))
| ~ theorem(X2)
| theorem(X1)
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f537,f19]) ).
fof(f913,definition,
( spl0_8
<=> theorem(or(not(not(or(not(not(q)),p))),or(not(or(p,q)),not(not(not(or(not(p),not(q)))))))) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f915,plain,
( ~ theorem(or(not(not(or(not(not(q)),p))),or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))
| spl0_8 ),
inference(avatar_component_clause,[],[f913]) ).
fof(f992,plain,
! [X0,X1] :
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f680,f26]) ).
fof(f1008,plain,
! [X2,X0,X1] :
( theorem(or(not(not(X0)),or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f992,f47]) ).
fof(f1115,plain,
( ! [X0,X1] : theorem(or(not(not(X0)),or(not(or(X1,X0)),X1)))
| ~ spl0_4 ),
inference(resolution,[],[f443,f27]) ).
fof(f1118,plain,
( ! [X0,X1] : theorem(or(or(not(not(X0)),X1),not(or(X1,X0))))
| ~ spl0_4 ),
inference(resolution,[],[f443,f26]) ).
fof(f1141,plain,
( ~ theorem(or(not(not(or(not(not(q)),p))),or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))
| ~ theorem(or(not(not(or(not(p),not(q)))),or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))
| spl0_1 ),
inference(resolution,[],[f190,f146]) ).
fof(f1165,plain,
( ~ theorem(or(not(not(or(not(not(q)),p))),or(not(or(p,q)),not(not(not(or(not(p),not(q))))))))
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f1141,f151]) ).
fof(f1166,plain,
( ~ spl0_8
| spl0_1 ),
inference(avatar_split_clause,[],[f1165,f138,f913]) ).
fof(f1171,plain,
( ~ theorem(or(not(or(p,q)),not(not(or(not(not(q)),p)))))
| spl0_8 ),
inference(resolution,[],[f915,f272]) ).
fof(f1232,plain,
( ~ theorem(or(or(not(not(q)),p),not(or(p,q))))
| spl0_8 ),
inference(resolution,[],[f1171,f680]) ).
fof(f1237,plain,
( $false
| ~ spl0_4
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f1232,f1118]) ).
fof(f1238,plain,
( ~ spl0_4
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f1237]) ).
fof(f1241,plain,
( ~ theorem(or(not(or(not(or(p,q)),not(not(not(or(not(p),not(q))))))),or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))
| spl0_2 ),
inference(resolution,[],[f144,f118]) ).
fof(f1253,plain,
( ~ theorem(or(not(not(not(not(or(not(p),not(q)))))),or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))
| ~ theorem(or(not(not(or(p,q))),or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))
| spl0_2 ),
inference(resolution,[],[f1241,f190]) ).
fof(f1269,definition,
( spl0_17
<=> theorem(or(not(not(or(p,q))),or(not(or(not(p),not(q))),not(or(not(not(q)),p))))) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f1271,plain,
( ~ theorem(or(not(not(or(p,q))),or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))
| spl0_17 ),
inference(avatar_component_clause,[],[f1269]) ).
fof(f1273,definition,
( spl0_18
<=> theorem(or(not(not(not(not(or(not(p),not(q)))))),or(not(or(not(p),not(q))),not(or(not(not(q)),p))))) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f1275,plain,
( ~ theorem(or(not(not(not(not(or(not(p),not(q)))))),or(not(or(not(p),not(q))),not(or(not(not(q)),p)))))
| spl0_18 ),
inference(avatar_component_clause,[],[f1273]) ).
fof(f1276,plain,
( ~ spl0_17
| ~ spl0_18
| spl0_2 ),
inference(avatar_split_clause,[],[f1253,f142,f1273,f1269]) ).
fof(f1419,plain,
( ~ theorem(or(not(not(or(not(p),not(q)))),or(not(or(not(not(q)),p)),not(or(not(p),not(q))))))
| spl0_18 ),
inference(resolution,[],[f1275,f1008]) ).
fof(f1441,plain,
( $false
| spl0_18 ),
inference(forward_subsumption_resolution,[],[f1419,f23]) ).
fof(f1442,plain,
spl0_18,
inference(avatar_contradiction_clause,[],[f1441]) ).
fof(f1650,plain,
! [X2,X0,X1] :
( ~ theorem(X0)
| theorem(X1)
| ~ theorem(or(not(or(X2,not(X2))),X1)) ),
inference(resolution,[],[f894,f365]) ).
fof(f1661,definition,
( spl0_33
<=> ! [X2,X1] :
( theorem(X1)
| ~ theorem(or(not(or(X2,not(X2))),X1)) ) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
fof(f1662,plain,
( ! [X2,X1] :
( ~ theorem(or(not(or(X2,not(X2))),X1))
| theorem(X1) )
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f1661]) ).
fof(f1663,plain,
( spl0_33
| spl0_3 ),
inference(avatar_split_clause,[],[f1650,f378,f1661]) ).
fof(f1690,plain,
( ! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X0,X1)))
| ~ spl0_33 ),
inference(resolution,[],[f1662,f30]) ).
fof(f1773,plain,
( ! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X1,X0)))
| ~ spl0_33 ),
inference(resolution,[],[f1690,f47]) ).
fof(f1898,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(X0),or(X1,X2)))
| theorem(or(not(or(not(X2),X3)),or(X1,X3)))
| ~ theorem(X0) ),
inference(resolution,[],[f49,f19]) ).
fof(f1943,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(not(or(X0,X1)),X2)),or(X3,X2)))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f1898,f22]) ).
fof(f1990,plain,
! [X2,X3,X0,X1,X4] :
( ~ theorem(or(X3,or(not(or(X0,X2)),X4)))
| theorem(or(X3,or(X1,X4)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f1943,f35]) ).
fof(f2241,plain,
( ! [X2,X0,X1] :
( theorem(or(not(not(X0)),or(X1,X2)))
| ~ theorem(or(X2,or(X1,X0))) )
| ~ spl0_4 ),
inference(resolution,[],[f1990,f1115]) ).
fof(f2277,plain,
( ~ theorem(or(not(or(not(not(q)),p)),or(not(or(not(p),not(q))),or(p,q))))
| ~ spl0_4
| spl0_17 ),
inference(resolution,[],[f2241,f1271]) ).
fof(f3610,plain,
( ~ theorem(or(not(or(not(not(q)),p)),or(p,q)))
| ~ spl0_4
| spl0_17 ),
inference(resolution,[],[f2277,f51]) ).
fof(f3612,plain,
( $false
| ~ spl0_4
| spl0_17
| ~ spl0_33 ),
inference(forward_subsumption_resolution,[],[f3610,f1773]) ).
fof(f3613,plain,
( ~ spl0_4
| spl0_17
| ~ spl0_33 ),
inference(avatar_contradiction_clause,[],[f3612]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f145]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f383]) ).
cnf(s19,plain,
~ spl0_3,
inference(sat_conversion,[],[f437]) ).
cnf(s26,plain,
( spl0_1
| ~ spl0_8 ),
inference(sat_conversion,[],[f1166]) ).
cnf(s31,plain,
( ~ spl0_4
| spl0_8 ),
inference(sat_conversion,[],[f1238]) ).
cnf(s33,plain,
( spl0_2
| ~ spl0_17
| ~ spl0_18 ),
inference(sat_conversion,[],[f1276]) ).
cnf(s45,plain,
spl0_18,
inference(sat_conversion,[],[f1442]) ).
cnf(s49,plain,
( spl0_3
| spl0_33 ),
inference(sat_conversion,[],[f1663]) ).
cnf(s78,plain,
( ~ spl0_4
| spl0_17
| ~ spl0_33 ),
inference(sat_conversion,[],[f3613]) ).
cnf(s83,plain,
( spl0_2
| ~ spl0_17 ),
inference(rat,[],[s33,s45]) ).
cnf(s88,plain,
spl0_33,
inference(rat,[],[s49,s19]) ).
cnf(s90,plain,
spl0_4,
inference(rat,[],[s2,s19]) ).
cnf(s91,plain,
spl0_17,
inference(rat,[],[s78,s88,s90]) ).
cnf(s92,plain,
spl0_8,
inference(rat,[],[s31,s90]) ).
cnf(s93,plain,
spl0_2,
inference(rat,[],[s83,s91]) ).
cnf(s94,plain,
spl0_1,
inference(rat,[],[s26,s92]) ).
cnf(s95,plain,
$false,
inference(rat,[],[s1,s93,s94]) ).
fof(f3635,plain,
$false,
inference(avatar_sat_refutation,[],[s95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL325-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Sun Sep 27 15:34:04 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/0.32 Running first-order theorem proving
% 0.05/0.32 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
% 12.31/2.40 % (2524697)Input is clausal, will run a generic CNF schedule.
% 12.31/2.40 % (2524718)lrs+10_1_sil=8000:sp=occurrence:random_seed=44015639:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 12.31/2.40 % (2524716)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=232462674:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 12.31/2.40 % (2524715)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=3967519691:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 12.31/2.40 % (2524720)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2426369840:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 12.31/2.40 % (2524717)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3507239956:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 12.31/2.40 % (2524719)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3875559452:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 12.31/2.40 % (2524721)dis-21_1_sil=8000:lcm=predicate:random_seed=1895921767: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)
% 12.31/2.40 % (2524721)Instruction limit reached!
% 12.31/2.40 % (2524721)------------------------------
% 12.31/2.40 % (2524721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.40 % (2524721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.40 % (2524721)CaDiCaL version: 2.1.3
% 12.31/2.40 % (2524721)Termination reason: Instruction limit
% 12.31/2.40 % (2524721)Termination phase: Saturation
% 12.31/2.40 % (2524721)Time elapsed: 0.046 s
% 12.31/2.40 % (2524721)Peak memory usage: 87 MB
% 12.31/2.40 % (2524721)Instructions burned: 117 (million)
% 12.31/2.40 % (2524719)Instruction limit reached!
% 12.31/2.40 % (2524719)------------------------------
% 12.31/2.40 % (2524719)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.40 % (2524719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.40 % (2524719)CaDiCaL version: 2.1.3
% 12.31/2.40 % (2524719)Termination reason: Instruction limit
% 12.31/2.40 % (2524719)Termination phase: Saturation
% 12.31/2.40 % (2524719)Time elapsed: 0.056 s
% 12.31/2.40 % (2524719)Peak memory usage: 88 MB
% 12.31/2.40 % (2524719)Instructions burned: 115 (million)
% 12.31/2.40 % (2524718)Instruction limit reached!
% 12.31/2.40 % (2524718)------------------------------
% 12.31/2.40 % (2524718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.40 % (2524718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.40 % (2524718)CaDiCaL version: 2.1.3
% 12.31/2.40 % (2524718)Termination reason: Instruction limit
% 12.31/2.40 % (2524718)Termination phase: Saturation
% 12.31/2.40 % (2524718)Time elapsed: 0.058 s
% 12.31/2.40 % (2524718)Peak memory usage: 89 MB
% 12.31/2.40 % (2524718)Instructions burned: 111 (million)
% 12.31/2.40 % (2524720)Instruction limit reached!
% 12.31/2.40 % (2524720)------------------------------
% 12.31/2.40 % (2524720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.40 % (2524720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.40 % (2524720)CaDiCaL version: 2.1.3
% 12.31/2.40 % (2524720)Termination reason: Instruction limit
% 12.31/2.40 % (2524720)Termination phase: Saturation
% 12.31/2.40 % (2524720)Time elapsed: 0.090 s
% 12.31/2.40 % (2524720)Peak memory usage: 89 MB
% 12.31/2.40 % (2524720)Instructions burned: 182 (million)
% 12.31/2.40 % (2524737)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=3522163496:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 12.31/2.40 % (2524737)Refutation not found, incomplete strategy
% 12.31/2.40 % (2524737)------------------------------
% 12.31/2.40 % (2524737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.40 % (2524737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.40 % (2524737)CaDiCaL version: 2.1.3
% 12.31/2.40 % (2524737)Termination reason: Refutation not found, incomplete strategy
% 12.31/2.40 % (2524737)Time elapsed: 0.001 s
% 12.31/2.40 % (2524737)Peak memory usage: 88 MB
% 12.31/2.40 % (2524738)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=295260153: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)
% 13.50/2.56 % (2524739)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4044083277:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 13.50/2.56 % (2524738)Refutation not found, incomplete strategy
% 13.50/2.56 % (2524738)------------------------------
% 13.50/2.56 % (2524738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524738)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524738)Termination reason: Refutation not found, incomplete strategy
% 13.50/2.56 % (2524738)Time elapsed: 0.001 s
% 13.50/2.56 % (2524738)Peak memory usage: 87 MB
% 13.50/2.56 % (2524739)Refutation not found, incomplete strategy
% 13.50/2.56 % (2524739)------------------------------
% 13.50/2.56 % (2524739)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524739)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524739)Termination reason: Refutation not found, incomplete strategy
% 13.50/2.56 % (2524739)Time elapsed: 0.002 s
% 13.50/2.56 % (2524739)Peak memory usage: 87 MB
% 13.50/2.56 % (2524739)Instructions burned: 1 (million)
% 13.50/2.56 % (2524740)lrs+10_64_to=lpo:sil=8000:random_seed=548569041:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 13.50/2.56 % (2524737)------------------------------
% 13.50/2.56 % (2524737)------------------------------
% 13.50/2.56 % (2524740)Instruction limit reached!
% 13.50/2.56 % (2524740)------------------------------
% 13.50/2.56 % (2524740)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524740)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524740)Termination reason: Instruction limit
% 13.50/2.56 % (2524740)Termination phase: Saturation
% 13.50/2.56 % (2524740)Time elapsed: 0.067 s
% 13.50/2.56 % (2524740)Peak memory usage: 89 MB
% 13.50/2.56 % (2524740)Instructions burned: 126 (million)
% 13.50/2.56 % (2524738)------------------------------
% 13.50/2.56 % (2524738)------------------------------
% 13.50/2.56 % (2524739)------------------------------
% 13.50/2.56 % (2524739)------------------------------
% 13.50/2.56 % (2524761)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3476218631:avsq=on:i=194:fgj=on:bd=preordered_2994 on theBenchmark for (2994ds/194Mi)
% 13.50/2.56 % (2524762)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=265516921:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 13.50/2.56 % (2524761)Instruction limit reached!
% 13.50/2.56 % (2524761)------------------------------
% 13.50/2.56 % (2524761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524761)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524761)Termination reason: Instruction limit
% 13.50/2.56 % (2524761)Termination phase: Saturation
% 13.50/2.56 % (2524761)Time elapsed: 0.111 s
% 13.50/2.56 % (2524761)Peak memory usage: 89 MB
% 13.50/2.56 % (2524761)Instructions burned: 194 (million)
% 13.50/2.56 % (2524762)Instruction limit reached!
% 13.50/2.56 % (2524762)------------------------------
% 13.50/2.56 % (2524762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524762)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524762)Termination reason: Instruction limit
% 13.50/2.56 % (2524762)Termination phase: Saturation
% 13.50/2.56 % (2524762)Time elapsed: 0.076 s
% 13.50/2.56 % (2524762)Peak memory usage: 91 MB
% 13.50/2.56 % (2524762)Instructions burned: 158 (million)
% 13.50/2.56 % (2524764)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=392302433:i=3394:sd=4:ss=included:sgt=64_2993 on theBenchmark for (2993ds/3394Mi)
% 13.50/2.56 % (2524765)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=4224089139:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2993 on theBenchmark for (2993ds/106Mi)
% 13.50/2.56 % (2524765)Instruction limit reached!
% 13.50/2.56 % (2524765)------------------------------
% 13.50/2.56 % (2524765)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524765)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524765)Termination reason: Instruction limit
% 13.50/2.56 % (2524765)Termination phase: Saturation
% 13.50/2.56 % (2524765)Time elapsed: 0.050 s
% 13.50/2.56 % (2524765)Peak memory usage: 88 MB
% 13.50/2.56 % (2524765)Instructions burned: 106 (million)
% 13.50/2.56 % (2524774)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2186916755:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2991 on theBenchmark for (2991ds/242Mi)
% 13.50/2.56 % (2524773)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=3267805300:i=107_2991 on theBenchmark for (2991ds/107Mi)
% 13.50/2.56 % (2524773)Refutation not found, incomplete strategy
% 13.50/2.56 % (2524773)------------------------------
% 13.50/2.56 % (2524773)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524773)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524773)Termination reason: Refutation not found, incomplete strategy
% 13.50/2.56 % (2524773)Time elapsed: 0.001 s
% 13.50/2.56 % (2524773)Peak memory usage: 87 MB
% 13.50/2.56 % (2524774)Instruction limit reached!
% 13.50/2.56 % (2524774)------------------------------
% 13.50/2.56 % (2524774)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524774)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524774)Termination reason: Instruction limit
% 13.50/2.56 % (2524774)Termination phase: Saturation
% 13.50/2.56 % (2524774)Time elapsed: 0.096 s
% 13.50/2.56 % (2524774)Peak memory usage: 91 MB
% 13.50/2.56 % (2524774)Instructions burned: 244 (million)
% 13.50/2.56 % (2524781)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=3453702081:cond=fast:i=5208:av=off_2990 on theBenchmark for (2990ds/5208Mi)
% 13.50/2.56 % (2524788)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=4249320147:i=134:sd=2:doe=on:ss=axioms:sgt=14_2988 on theBenchmark for (2988ds/134Mi)
% 13.50/2.56 % (2524773)------------------------------
% 13.50/2.56 % (2524773)------------------------------
% 13.50/2.56 % (2524788)Instruction limit reached!
% 13.50/2.56 % (2524788)------------------------------
% 13.50/2.56 % (2524788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524788)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524788)Termination reason: Instruction limit
% 13.50/2.56 % (2524788)Termination phase: Saturation
% 13.50/2.56 % (2524788)Time elapsed: 0.073 s
% 13.50/2.56 % (2524788)Peak memory usage: 89 MB
% 13.50/2.56 % (2524788)Instructions burned: 135 (million)
% 13.50/2.56 % (2524794)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=4228747267:i=499:bd=all_2987 on theBenchmark for (2987ds/499Mi)
% 13.50/2.56 % (2524795)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=3566958350:i=191:fgj=on:bd=all_2986 on theBenchmark for (2986ds/191Mi)
% 13.50/2.56 % (2524795)Instruction limit reached!
% 13.50/2.56 % (2524795)------------------------------
% 13.50/2.56 % (2524795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524795)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524795)Termination reason: Instruction limit
% 13.50/2.56 % (2524795)Termination phase: Saturation
% 13.50/2.56 % (2524795)Time elapsed: 0.122 s
% 13.50/2.56 % (2524795)Peak memory usage: 93 MB
% 13.50/2.56 % (2524795)Instructions burned: 191 (million)
% 13.50/2.56 % (2524794)Instruction limit reached!
% 13.50/2.56 % (2524794)------------------------------
% 13.50/2.56 % (2524794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524794)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524794)Termination reason: Instruction limit
% 13.50/2.56 % (2524794)Termination phase: Saturation
% 13.50/2.56 % (2524794)Time elapsed: 0.249 s
% 13.50/2.56 % (2524794)Peak memory usage: 94 MB
% 13.50/2.56 % (2524794)Instructions burned: 500 (million)
% 13.50/2.56 % (2524764)First to succeed.
% 13.50/2.56 % (2524764)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2524697"
% 13.50/2.56 % (2524803)lrs-11_32_anc=all:sil=8000:spb=goal_then_units:sac=on:random_seed=1705765237:i=264:kws=precedence:fsr=off_2983 on theBenchmark for (2983ds/264Mi)
% 13.50/2.56 % (2524804)lrs-22_64_to=lpo:sil=8000:sp=const_frequency:urr=ec_only:nwc=4:flr=on:random_seed=342456256:cond=on:i=156:bs=on:gtg=exists_all:er=known_2982 on theBenchmark for (2982ds/156Mi)
% 13.50/2.56 % (2524804)Instruction limit reached!
% 13.50/2.56 % (2524804)------------------------------
% 13.50/2.56 % (2524804)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524804)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524804)Termination reason: Instruction limit
% 13.50/2.56 % (2524804)Termination phase: Saturation
% 13.50/2.56 % (2524804)Time elapsed: 0.050 s
% 13.50/2.56 % (2524804)Peak memory usage: 88 MB
% 13.50/2.56 % (2524804)Instructions burned: 157 (million)
% 13.50/2.56 % (2524803)Instruction limit reached!
% 13.50/2.56 % (2524803)------------------------------
% 13.50/2.56 % (2524803)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.50/2.56 % (2524803)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.50/2.56 % (2524803)CaDiCaL version: 2.1.3
% 13.50/2.56 % (2524803)Termination reason: Instruction limit
% 13.50/2.56 % (2524803)Termination phase: Saturation
% 13.50/2.56 % (2524803)Time elapsed: 0.134 s
% 13.50/2.56 % (2524803)Peak memory usage: 92 MB
% 13.50/2.56 % (2524803)Instructions burned: 266 (million)
% 13.50/2.56 % (2524764)Refutation found. Thanks to Tanya!
% 13.50/2.56 % SZS status Unsatisfiable for theBenchmark
% 13.50/2.56 % SZS output start Proof for theBenchmark
% See solution above
% 14.35/2.67 % (2524764)------------------------------
% 14.35/2.67 % (2524764)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.35/2.67 % (2524764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.35/2.67 % (2524764)CaDiCaL version: 2.1.3
% 14.35/2.67 % (2524764)Termination reason: Refutation
% 14.35/2.67 % (2524764)Time elapsed: 1.048 s
% 14.35/2.67 % (2524764)Peak memory usage: 139 MB
% 14.35/2.67 % (2524764)Instructions burned: 2063 (million)
% 14.35/2.67 % (2524764)------------------------------
% 14.35/2.67 % (2524764)------------------------------
% 14.35/2.67 % (2524697)Success in time 2.03 s
% 14.35/2.67 % Vampire exiting
%------------------------------------------------------------------------------