%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL411-2 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:52:19 AM UTC 2026
% Result : Satisfiable 10.59s 2.47s
% Output : Saturation 11.53s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u28,axiom,
theorem(X1) ).
cnf(u295,axiom,
theorem(or(X0,or(or(X1,not(or(X0,X2))),X2))) ).
cnf(u404,axiom,
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ) ).
cnf(u448,axiom,
( ~ theorem(or(or(X2,X1),X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u498,axiom,
( ~ theorem(or(X0,or(X1,not(X2))))
| theorem(or(not(not(X0)),X1))
| ~ theorem(X2) ) ).
cnf(u75,axiom,
( theorem(or(X0,or(not(or(X0,X1)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u66,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u521,axiom,
( ~ theorem(not(or(X0,X1)))
| theorem(not(X0)) ) ).
cnf(u313,axiom,
( theorem(or(or(not(or(X0,not(X1))),X2),X0))
| ~ theorem(X1) ) ).
cnf(u138,axiom,
( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u442,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u37,axiom,
( theorem(or(or(X2,X1),not(or(X2,X0))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u49,axiom,
theorem(or(X0,not(or(X0,X0)))) ).
cnf(u502,axiom,
( ~ theorem(not(not(or(X0,X2))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u524,axiom,
( ~ theorem(not(or(not(or(X1,X0)),X1)))
| theorem(X0) ) ).
cnf(u489,axiom,
( ~ theorem(or(not(X0),X2))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u153,axiom,
( theorem(or(X2,or(not(or(X3,X0)),or(X3,X1))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u40,axiom,
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u73,axiom,
theorem(or(X0,or(not(or(X1,or(X0,X2))),or(X1,X2)))) ).
cnf(u288,axiom,
( theorem(or(X1,or(X2,not(not(X0)))))
| ~ theorem(X0) ) ).
cnf(u63,axiom,
( theorem(not(not(X0)))
| ~ theorem(X0) ) ).
cnf(u392,axiom,
( ~ theorem(or(not(X0),not(X1)))
| theorem(or(X2,not(or(X2,X0))))
| ~ theorem(X1) ) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(u452,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(or(not(X2),X3),X0)) ) ).
cnf(u519,axiom,
( ~ theorem(not(or(X2,X1)))
| theorem(not(or(not(X0),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u531,axiom,
( theorem(not(or(X0,not(X1))))
| ~ theorem(not(X0))
| ~ theorem(X1) ) ).
cnf(u239,axiom,
theorem(or(X0,or(not(X0),X1))) ).
cnf(u10,axiom,
axiom(or(not(X0),or(X1,X0))) ).
cnf(u417,axiom,
( theorem(or(or(not(or(X0,X1)),X2),or(X0,X3)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u151,axiom,
( theorem(or(X3,or(X1,or(X0,X2))))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u70,axiom,
theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))) ).
cnf(u207,axiom,
( theorem(or(not(or(or(X0,not(X1)),not(X2))),X0))
| ~ theorem(X1)
| ~ theorem(X2) ) ).
cnf(u317,axiom,
theorem(or(or(not(or(X0,or(X1,X1))),X0),X1)) ).
cnf(u154,axiom,
( theorem(or(X2,or(not(or(not(X1),X3)),or(X0,X3))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u478,axiom,
( ~ theorem(or(X2,not(X0)))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u490,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X0))
| theorem(or(X2,X1)) ) ).
cnf(u129,axiom,
( theorem(or(or(X1,X2),not(or(X1,or(not(X0),X2)))))
| ~ theorem(X0) ) ).
cnf(u201,axiom,
( ~ theorem(or(not(X1),not(X2)))
| ~ theorem(X2)
| theorem(or(not(or(X0,X1)),X0)) ) ).
cnf(u88,axiom,
theorem(or(or(not(or(X0,X1)),X0),X1)) ).
cnf(u148,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(X3,or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u160,axiom,
( theorem(or(X1,not(not(X0))))
| ~ theorem(X0) ) ).
cnf(u496,axiom,
( theorem(or(not(not(X0)),or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u396,axiom,
( theorem(or(or(not(or(X2,X0)),X1),X2))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u331,axiom,
( theorem(or(or(not(or(X2,not(X1))),X2),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u123,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u445,axiom,
( ~ theorem(or(or(X1,or(not(X3),X2)),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(X3) ) ).
cnf(u218,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X2,X0)))
| ~ theorem(X1) ) ).
cnf(u14,axiom,
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u513,axiom,
( ~ theorem(not(not(or(X0,not(X1)))))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u422,axiom,
( theorem(or(X0,or(not(or(X1,or(X0,X2))),X3)))
| ~ theorem(or(not(or(X1,X2)),X3)) ) ).
cnf(u466,axiom,
( ~ theorem(or(not(X3),X2))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u409,axiom,
( theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u219,axiom,
theorem(or(not(X0),or(X0,X1))) ).
cnf(u469,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),X3)))
| ~ theorem(or(X1,X0))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u133,axiom,
( theorem(or(not(or(not(X0),or(not(X1),X2))),X2))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u205,axiom,
( theorem(or(not(or(not(X0),not(X1))),X2))
| ~ theorem(X1)
| ~ theorem(or(X2,X0)) ) ).
cnf(u92,axiom,
theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))) ).
cnf(u55,axiom,
theorem(or(not(or(or(X0,X0),or(X0,X0))),X0)) ).
cnf(u435,axiom,
( ~ theorem(or(not(X1),X3))
| theorem(or(not(or(X0,X2)),or(X2,X3)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u99,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ) ).
cnf(u495,axiom,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(not(not(X0)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u507,axiom,
( ~ theorem(not(not(or(X1,or(X0,X2)))))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u325,axiom,
( theorem(or(not(or(X2,not(X1))),or(X0,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u231,axiom,
theorem(or(X0,or(X1,not(or(X1,X0))))) ).
cnf(u118,axiom,
( theorem(or(X1,not(or(not(X2),not(X0)))))
| ~ theorem(X0)
| ~ theorem(or(X1,X2)) ) ).
cnf(u294,axiom,
theorem(or(or(X0,not(or(X1,X2))),or(X2,X1))) ).
cnf(u34,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u481,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(not(not(X0))) ) ).
cnf(u517,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(or(X0,X1))) ) ).
cnf(u410,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X0,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(X2) ) ).
cnf(u470,axiom,
( ~ theorem(or(not(X3),X2))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u177,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(X0) ) ).
cnf(u77,axiom,
theorem(or(X0,or(not(or(X0,X1)),X1))) ).
cnf(u457,axiom,
( ~ theorem(or(not(X2),X0))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u197,axiom,
( theorem(or(X1,not(or(not(X0),not(X0)))))
| ~ theorem(X0) ) ).
cnf(u36,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ) ).
cnf(u68,axiom,
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u256,axiom,
theorem(or(or(not(X0),X1),X0)) ).
cnf(u140,axiom,
( theorem(or(not(or(not(X0),X1)),X1))
| ~ theorem(X0) ) ).
cnf(u444,axiom,
( ~ theorem(or(or(X1,X3),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u43,axiom,
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u202,axiom,
( theorem(or(not(or(X0,or(not(X1),not(X2)))),X0))
| ~ theorem(X2)
| ~ theorem(X1) ) ).
cnf(u439,axiom,
( theorem(or(not(or(X0,not(X2))),X1))
| ~ theorem(or(not(X0),X1))
| ~ theorem(X2) ) ).
cnf(u103,axiom,
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ) ).
cnf(u511,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(not(not(or(X2,X0)))) ) ).
cnf(u483,axiom,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(or(X2,not(not(X0)))) ) ).
cnf(u328,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(not(or(X3,not(X1))),X3))) ) ).
cnf(u536,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(not(X1)) ) ).
cnf(u62,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u270,axiom,
theorem(or(X0,or(or(X1,not(X1)),X2))) ).
cnf(u282,axiom,
theorem(or(or(or(X0,not(X0)),X1),X2)) ).
cnf(u522,axiom,
( ~ theorem(not(or(not(or(X2,X0)),or(X2,X1))))
| theorem(not(or(not(X0),X1))) ) ).
cnf(u291,axiom,
theorem(or(or(X0,not(X1)),X1)) ).
cnf(u329,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(not(or(X3,not(X1))),X3)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u458,axiom,
( ~ theorem(or(X2,X0))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u401,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X3)))
| ~ theorem(or(not(X2),X3))
| ~ theorem(X1) ) ).
cnf(u461,axiom,
( theorem(or(X0,not(or(not(X1),not(X2)))))
| ~ theorem(or(X1,X0))
| ~ theorem(X2) ) ).
cnf(u12,axiom,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u360,axiom,
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u311,axiom,
theorem(or(or(not(or(X0,X1)),X2),or(X1,X0))) ).
cnf(u128,axiom,
( ~ theorem(or(X1,or(not(X0),X2)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u19,axiom,
theorem(or(or(X0,X1),not(X1))) ).
cnf(u91,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u137,axiom,
( ~ theorem(or(not(X2),X0))
| ~ theorem(X2)
| theorem(or(not(or(not(X0),X1)),X1)) ) ).
cnf(u195,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(X0) ) ).
cnf(u537,axiom,
( ~ theorem(or(X2,X1))
| ~ theorem(not(X2))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u446,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u330,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,not(X1))),X2))
| ~ theorem(X0) ) ).
cnf(u390,axiom,
( theorem(or(X2,or(X1,not(or(X2,X0)))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u97,axiom,
( theorem(or(or(X0,X2),not(or(not(X1),X2))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u125,axiom,
( theorem(or(not(or(X1,or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u505,axiom,
( ~ theorem(not(not(X1)))
| theorem(or(X0,X1)) ) ).
cnf(u449,axiom,
( ~ theorem(or(or(X2,or(X1,X3)),X0))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u512,axiom,
( ~ theorem(not(not(or(X0,X0))))
| theorem(X0) ) ).
cnf(u540,axiom,
( theorem(or(not(or(X0,X1)),X2))
| ~ theorem(not(X0))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u232,axiom,
theorem(or(X0,or(or(X1,X2),not(or(X1,or(X0,X2)))))) ).
cnf(u408,axiom,
( theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u23,axiom,
( theorem(or(X0,X1))
| ~ theorem(X0) ) ).
cnf(u468,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u67,axiom,
theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X0,X1))) ).
cnf(u526,axiom,
( ~ theorem(not(or(X1,not(X0))))
| theorem(X0) ) ).
cnf(u362,axiom,
theorem(or(X0,or(X1,or(not(X2),X2)))) ).
cnf(u475,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u139,axiom,
( theorem(or(not(or(or(not(X0),X1),not(X2))),X1))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u318,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X2,X1))) ).
cnf(u314,axiom,
( theorem(or(or(not(or(not(X0),X1)),X2),X1))
| ~ theorem(X0) ) ).
cnf(u416,axiom,
( theorem(or(or(X0,not(or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u86,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u434,axiom,
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u377,axiom,
( ~ theorem(or(or(not(or(X1,not(X2))),X1),X2))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u41,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(X0,or(not(X2),X3))) ) ).
cnf(u494,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(not(not(X0)),X1)) ) ).
cnf(u506,axiom,
( ~ theorem(not(not(or(X1,X0))))
| theorem(or(X0,X1)) ) ).
cnf(u101,axiom,
( theorem(or(not(or(or(X1,X1),not(X0))),X1))
| ~ theorem(X0) ) ).
cnf(u509,axiom,
( ~ theorem(not(not(or(not(X2),X1))))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u324,axiom,
( theorem(or(X0,or(X2,not(or(X2,not(X1))))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u173,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u60,axiom,
theorem(or(X0,not(X0))) ).
cnf(u217,axiom,
( theorem(or(not(or(X0,X1)),or(X2,X0)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u104,axiom,
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u164,axiom,
( theorem(or(X1,or(not(or(X2,or(not(X0),X3))),or(X2,X3))))
| ~ theorem(X0) ) ).
cnf(u275,axiom,
theorem(or(X0,or(X1,or(X2,not(X2))))) ).
cnf(u127,axiom,
( ~ theorem(or(X1,or(X2,or(not(X0),X3))))
| theorem(or(X1,or(X2,X3)))
| ~ theorem(X0) ) ).
cnf(u11,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u407,axiom,
( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
| ~ theorem(or(not(or(X2,X1)),X3)) ) ).
cnf(u71,axiom,
theorem(or(X0,or(not(X1),X1))) ).
cnf(u514,axiom,
( ~ theorem(not(not(X0)))
| theorem(X0) ) ).
cnf(u451,axiom,
( ~ theorem(or(or(not(X3),X2),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X3)) ) ).
cnf(u243,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u420,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X0,X2)) ) ).
cnf(u74,axiom,
theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))) ).
cnf(u378,axiom,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u438,axiom,
( ~ theorem(or(not(X0),not(X1)))
| theorem(or(not(or(X0,X2)),X2))
| ~ theorem(X1) ) ).
cnf(u17,axiom,
( theorem(or(X0,X1))
| ~ theorem(X1) ) ).
cnf(u45,axiom,
theorem(or(not(or(X0,X0)),X0)) ).
cnf(u206,axiom,
( theorem(or(not(or(or(X0,not(X1)),or(X0,not(X1)))),X0))
| ~ theorem(X1) ) ).
cnf(u425,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X3,X1)) ) ).
cnf(u485,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(not(not(X0)))
| ~ theorem(X1) ) ).
cnf(u149,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(X0) ) ).
cnf(u225,axiom,
theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X1,X0))) ).
cnf(u48,axiom,
( ~ theorem(or(X0,X0))
| theorem(X0) ) ).
cnf(u221,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(or(X0,X2),X1))) ).
cnf(u533,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X1))
| theorem(not(not(X0))) ) ).
cnf(u152,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X3,X0)) ) ).
cnf(u293,axiom,
theorem(or(or(X0,not(or(X1,X1))),X1)) ).
cnf(u518,axiom,
( ~ theorem(not(or(X0,X2)))
| theorem(not(or(X0,X1)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u212,axiom,
( theorem(or(X0,not(or(not(X1),X0))))
| ~ theorem(X1) ) ).
cnf(u224,axiom,
theorem(or(not(or(X0,X1)),or(or(X0,X2),not(or(not(X1),X2))))) ).
cnf(u323,axiom,
( ~ theorem(or(X2,not(X1)))
| theorem(or(X0,X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u115,axiom,
theorem(or(X0,or(or(not(X1),X1),X2))) ).
cnf(u460,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u187,axiom,
( theorem(or(or(X0,X1),X2))
| ~ theorem(X0) ) ).
cnf(u527,axiom,
( ~ theorem(not(or(not(X0),X1)))
| theorem(X0) ) ).
cnf(u455,axiom,
( ~ theorem(or(or(X1,not(X2)),X0))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u482,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X1,X2)) ) ).
cnf(u497,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u310,axiom,
theorem(or(or(not(or(X0,X0)),X1),X0)) ).
cnf(u78,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(X1) ) ).
cnf(u297,axiom,
( theorem(or(or(X0,not(or(not(X1),X2))),X2))
| ~ theorem(X1) ) ).
cnf(u198,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u357,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(X3,X1))) ) ).
cnf(u369,axiom,
theorem(or(or(or(not(X0),X0),X1),X2)) ).
cnf(u33,axiom,
theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u486,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u429,axiom,
( ~ theorem(or(not(not(X0)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u93,axiom,
( theorem(or(not(or(not(X1),X0)),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u250,axiom,
theorem(or(X0,or(X1,not(X0)))) ).
cnf(u52,axiom,
theorem(or(not(X0),X0)) ).
cnf(u312,axiom,
theorem(or(X0,or(or(not(or(X0,X1)),X2),X1))) ).
cnf(u156,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,X0))
| ~ theorem(X1) ) ).
cnf(u47,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ) ).
cnf(u504,axiom,
( ~ theorem(not(not(X0)))
| theorem(or(X0,X1)) ) ).
cnf(u327,axiom,
( ~ theorem(or(or(not(or(X0,not(X1))),X0),X1))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u499,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(not(not(X0)),X2))
| ~ theorem(X1) ) ).
cnf(u163,axiom,
( theorem(or(X1,or(not(or(X2,not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u515,axiom,
( ~ theorem(not(not(not(X1))))
| theorem(X0)
| ~ theorem(or(X1,X0)) ) ).
cnf(u223,axiom,
theorem(or(not(or(not(X0),X1)),or(or(X2,X1),not(or(X2,X0))))) ).
cnf(u122,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u358,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u301,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u226,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X1,X0)))
| ~ theorem(X2) ) ).
cnf(u254,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u9,axiom,
axiom(or(not(or(X0,X0)),X0)) ).
cnf(u462,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u405,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u69,axiom,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u296,axiom,
( theorem(or(or(X0,not(or(X1,not(X2)))),X1))
| ~ theorem(X2) ) ).
cnf(u72,axiom,
theorem(or(X0,or(not(or(X1,X0)),X1))) ).
cnf(u100,axiom,
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ) ).
cnf(u132,axiom,
( theorem(or(not(or(not(X0),X1)),X2))
| ~ theorem(X0)
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u436,axiom,
( theorem(or(not(or(X0,X2)),or(X1,X2)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u320,axiom,
( theorem(or(or(not(or(X0,or(X1,not(X2)))),X0),X1))
| ~ theorem(X2) ) ).
cnf(u35,axiom,
theorem(or(or(not(or(X0,X1)),or(X0,X2)),not(or(not(X1),X2)))) ).
cnf(u480,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(or(X1,not(not(X0)))) ) ).
cnf(u508,axiom,
( ~ theorem(not(not(or(X2,X0))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u95,axiom,
( ~ theorem(or(X2,or(not(X1),X3)))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u503,axiom,
( ~ theorem(not(not(or(X0,or(not(X2),X1)))))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u54,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(or(not(X1),X0)) ) ).
cnf(u98,axiom,
( ~ theorem(or(X1,or(X2,not(X0))))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u126,axiom,
( theorem(or(X1,or(not(or(X1,or(not(X0),X2))),X2)))
| ~ theorem(X0) ) ).
cnf(u16,axiom,
theorem(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u170,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(X0) ) ).
cnf(u289,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u230,axiom,
theorem(or(X0,or(X1,not(X1)))) ).
cnf(u406,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X2,X0)) ) ).
cnf(u13,axiom,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u450,axiom,
( ~ theorem(or(or(X3,X1),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u393,axiom,
( theorem(or(X3,or(not(or(not(X2),X0)),X1)))
| ~ theorem(X2)
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u453,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(or(X3,X1),X0)) ) ).
cnf(u245,axiom,
theorem(or(or(X0,X1),not(X0))) ).
cnf(u389,axiom,
( ~ theorem(or(not(X0),not(or(X1,X0))))
| theorem(or(X1,not(or(X1,X0)))) ) ).
cnf(u308,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u76,axiom,
theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))) ).
cnf(u414,axiom,
( theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u94,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u39,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u484,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X2,X1)) ) ).
cnf(u419,axiom,
( theorem(or(X0,or(not(or(X1,X0)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u83,axiom,
theorem(or(or(not(X0),X0),X1)) ).
cnf(u479,axiom,
( ~ theorem(or(X0,X1))
| theorem(X1)
| ~ theorem(not(X0)) ) ).
cnf(u42,axiom,
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u102,axiom,
( theorem(or(X1,or(not(or(or(X1,X2),not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u321,axiom,
( theorem(or(or(not(or(X0,or(not(X1),X2))),X0),X2))
| ~ theorem(X1) ) ).
cnf(u146,axiom,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(or(X0,X1)) ) ).
cnf(u265,axiom,
theorem(or(or(X0,not(X0)),X1)) ).
cnf(u57,axiom,
( ~ theorem(or(X1,X1))
| theorem(or(X0,X1)) ) ).
cnf(u510,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(not(not(or(not(X1),X2)))) ) ).
cnf(u394,axiom,
( theorem(or(X2,or(not(or(not(X3),X0)),X1)))
| ~ theorem(or(not(X0),X1))
| ~ theorem(or(X2,X3)) ) ).
cnf(u454,axiom,
( ~ theorem(or(or(X1,X1),X0))
| theorem(or(X0,X1)) ) ).
cnf(u161,axiom,
( theorem(or(X1,not(or(not(X0),not(X2)))))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u443,axiom,
( theorem(or(or(X2,X1),not(or(X0,X2))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u20,axiom,
theorem(or(or(X0,X1),not(or(X1,X0)))) ).
cnf(u465,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u356,axiom,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ) ).
cnf(u532,axiom,
( theorem(not(or(X0,X0)))
| ~ theorem(not(X0)) ) ).
cnf(u319,axiom,
theorem(or(X0,or(or(not(or(X1,or(X0,X2))),X1),X2))) ).
cnf(u400,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u428,axiom,
( ~ theorem(or(not(not(X1)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u15,axiom,
theorem(or(not(X0),or(X1,X0))) ).
cnf(u423,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(not(or(X0,X1)),X2)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u87,axiom,
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ) ).
cnf(u539,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X0,X2)))
| ~ theorem(not(X1)) ) ).
cnf(u467,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u18,axiom,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ) ).
cnf(u90,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(X0,or(X3,X1))) ) ).
cnf(u150,axiom,
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u326,axiom,
( theorem(or(X0,not(or(not(X2),not(X1)))))
| ~ theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u222,axiom,
( theorem(or(not(or(not(X0),X1)),or(X1,X2)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u441,axiom,
( ~ theorem(or(X2,or(X0,X3)))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u520,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(X0)) ) ).
cnf(u124,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),or(X0,X2)),X1)) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL411-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 % Computer : n010.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sun Sep 27 15:40:46 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.47 Running first-order theorem proving
% 0.14/0.47 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
% 10.59/2.46 % (1116449)Input is clausal, will run a generic CNF schedule.
% 10.59/2.46 % (1116455)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=872394449:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 10.59/2.46 % (1116459)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1026663471:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 10.59/2.46 % (1116457)lrs+10_1_sil=8000:sp=occurrence:random_seed=1185290840:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 10.59/2.46 % (1116458)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3759472577:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 10.59/2.46 % (1116456)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2020859325:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 10.59/2.46 % (1116457)Refutation not found, incomplete strategy
% 10.59/2.46 % (1116457)------------------------------
% 10.59/2.46 % (1116457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.46 % (1116457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.46 % (1116457)CaDiCaL version: 2.1.3
% 10.59/2.46 % (1116457)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.46 % (1116457)Time elapsed: 0.001 s
% 10.59/2.46 % (1116457)Peak memory usage: 86 MB
% 10.59/2.46 % (1116454)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=3273258960:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 10.59/2.46 % (1116459)Refutation not found, incomplete strategy
% 10.59/2.46 % (1116459)------------------------------
% 10.59/2.46 % (1116459)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.46 % (1116459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.46 % (1116459)CaDiCaL version: 2.1.3
% 10.59/2.46 % (1116459)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.46 % (1116459)Time elapsed: 0.003 s
% 10.59/2.46 % (1116459)Peak memory usage: 88 MB
% 10.59/2.46 % (1116459)Instructions burned: 1 (million)
% 10.59/2.46 % (1116458)Refutation not found, incomplete strategy
% 10.59/2.46 % (1116458)------------------------------
% 10.59/2.46 % (1116458)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.46 % (1116458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.46 % (1116458)CaDiCaL version: 2.1.3
% 10.59/2.46 % (1116458)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.46 % (1116458)Time elapsed: 0.001 s
% 10.59/2.46 % (1116458)Peak memory usage: 86 MB
% 10.59/2.46 % (1116460)dis-21_1_sil=8000:lcm=predicate:random_seed=819205447: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)
% 10.59/2.46 % (1116460)Refutation not found, incomplete strategy
% 10.59/2.46 % (1116460)------------------------------
% 10.59/2.46 % (1116460)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.46 % (1116460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.46 % (1116460)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116460)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116460)Time elapsed: 0.001 s
% 10.59/2.47 % (1116460)Peak memory usage: 86 MB
% 10.59/2.47 % (1116457)------------------------------
% 10.59/2.47 % (1116457)------------------------------
% 10.59/2.47 % (1116458)------------------------------
% 10.59/2.47 % (1116458)------------------------------
% 10.59/2.47 % (1116459)------------------------------
% 10.59/2.47 % (1116459)------------------------------
% 10.59/2.47 % (1116460)------------------------------
% 10.59/2.47 % (1116460)------------------------------
% 10.59/2.47 % (1116469)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2635944413:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2993 on theBenchmark for (2993ds/189Mi)
% 10.59/2.47 % (1116469)Refutation not found, incomplete strategy
% 10.59/2.47 % (1116469)------------------------------
% 10.59/2.47 % (1116469)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116469)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116469)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116469)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116469)Time elapsed: 0.001 s
% 10.59/2.47 % (1116469)Peak memory usage: 86 MB
% 10.59/2.47 % (1116468)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=48316374:i=143:sd=2:aac=none:ss=axioms:sgt=16_2994 on theBenchmark for (2994ds/143Mi)
% 10.59/2.47 % (1116468)Refutation not found, incomplete strategy
% 10.59/2.47 % (1116468)------------------------------
% 10.59/2.47 % (1116468)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116468)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116468)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116468)Time elapsed: 0.001 s
% 10.59/2.47 % (1116468)Peak memory usage: 86 MB
% 10.59/2.47 % (1116470)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3068981243:st=4:i=219:sd=3:ss=axioms_2993 on theBenchmark for (2993ds/219Mi)
% 10.59/2.47 % (1116470)Refutation not found, incomplete strategy
% 10.59/2.47 % (1116470)------------------------------
% 10.59/2.47 % (1116470)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116470)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116470)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116470)Time elapsed: 0.001 s
% 10.59/2.47 % (1116470)Peak memory usage: 86 MB
% 10.59/2.47 % (1116471)lrs+10_64_to=lpo:sil=8000:random_seed=2293642017:i=126:bd=preordered_2993 on theBenchmark for (2993ds/126Mi)
% 10.59/2.47 % (1116469)------------------------------
% 10.59/2.47 % (1116469)------------------------------
% 10.59/2.47 % (1116471)Instruction limit reached!
% 10.59/2.47 % (1116471)------------------------------
% 10.59/2.47 % (1116471)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116471)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116471)Termination reason: Instruction limit
% 10.59/2.47 % (1116471)Termination phase: Saturation
% 10.59/2.47 % (1116471)Time elapsed: 0.125 s
% 10.59/2.47 % (1116471)Peak memory usage: 89 MB
% 10.59/2.47 % (1116471)Instructions burned: 127 (million)
% 10.59/2.47 % (1116456)Refutation not found, incomplete strategy
% 10.59/2.47 % (1116456)------------------------------
% 10.59/2.47 % (1116456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116456)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116456)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116456)Time elapsed: 0.965 s
% 10.59/2.47 % (1116456)Peak memory usage: 127 MB
% 10.59/2.47 % (1116456)Instructions burned: 900 (million)
% 10.59/2.47 % (1116468)------------------------------
% 10.59/2.47 % (1116468)------------------------------
% 10.59/2.47 % (1116470)------------------------------
% 10.59/2.47 % (1116470)------------------------------
% 10.59/2.47 % (1116454)First to succeed.
% 10.59/2.47 % (1116454)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1116449"
% 10.59/2.47 % (1116477)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=1836592025:i=157:gtg=all_2989 on theBenchmark for (2989ds/157Mi)
% 10.59/2.47 % (1116476)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2132284245:avsq=on:i=194:fgj=on:bd=preordered_2989 on theBenchmark for (2989ds/194Mi)
% 10.59/2.47 % (1116476)Refutation not found, incomplete strategy
% 10.59/2.47 % (1116476)------------------------------
% 10.59/2.47 % (1116476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.59/2.47 % (1116476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.59/2.47 % (1116476)CaDiCaL version: 2.1.3
% 10.59/2.47 % (1116476)Termination reason: Refutation not found, incomplete strategy
% 10.59/2.47 % (1116476)Time elapsed: 0.002 s
% 10.59/2.47 % (1116476)Peak memory usage: 87 MB
% 10.59/2.47 % SZS status Satisfiable for theBenchmark
% 10.59/2.47 % SZS output start Saturation.
% See solution above
% 11.53/2.70 % SZS output start Definitions and Model Updates.
% 11.53/2.70 for all inputs,
% 11.53/2.70 define implies(X0,X1) := or(not(X0),X1)
% 11.53/2.70 % SZS output end Definitions and Model Updates.
% 11.53/2.70 % (1116454)------------------------------
% 11.53/2.70 % (1116454)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.53/2.70 % (1116454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.53/2.70 % (1116454)CaDiCaL version: 2.1.3
% 11.53/2.70 % (1116454)Termination reason: Satisfiable
% 11.53/2.70 % (1116454)Time elapsed: 1.084 s
% 11.53/2.70 % (1116454)Peak memory usage: 131 MB
% 11.53/2.70 % (1116454)Instructions burned: 1186 (million)
% 11.53/2.70 % (1116454)------------------------------
% 11.53/2.70 % (1116454)------------------------------
% 11.53/2.70 % (1116449)Success in time 1.544 s
% 11.53/2.70 % Vampire exiting
%------------------------------------------------------------------------------