%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL412-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:20 AM UTC 2026
% Result : Satisfiable 4.19s 1.81s
% Output : Saturation 7.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u28,axiom,
theorem(X1) ).
cnf(u295,axiom,
theorem(or(or(X0,not(X0)),X1)) ).
cnf(u228,axiom,
( theorem(or(not(or(X2,not(X1))),or(X0,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u339,axiom,
theorem(or(or(or(X0,not(X0)),X1),X2)) ).
cnf(u476,axiom,
( theorem(or(or(not(or(X0,X1)),X2),or(X0,X3)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u75,axiom,
theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))) ).
cnf(u543,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(or(X1,not(not(X0)))) ) ).
cnf(u471,axiom,
( ~ theorem(or(not(not(X0)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u135,axiom,
( ~ theorem(or(X1,or(not(X0),X2)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u587,axiom,
( theorem(not(or(X0,X0)))
| ~ theorem(not(X0)) ) ).
cnf(u22,axiom,
theorem(or(or(X0,X1),not(or(X1,X0)))) ).
cnf(u521,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u313,axiom,
theorem(or(or(X0,not(X1)),X1)) ).
cnf(u593,axiom,
( ~ theorem(or(X2,X1))
| ~ theorem(not(X2))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u37,axiom,
theorem(or(or(not(or(X0,X1)),or(X0,X2)),not(or(not(X1),X2)))) ).
cnf(u49,axiom,
theorem(or(X0,not(or(X0,X0)))) ).
cnf(u502,axiom,
( ~ theorem(or(or(X1,X3),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u489,axiom,
( ~ theorem(or(X2,or(X0,X3)))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u153,axiom,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(or(X0,X1)) ) ).
cnf(u40,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u112,axiom,
theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))) ).
cnf(u172,axiom,
( theorem(or(X1,or(not(or(X2,or(not(X0),X3))),or(X2,X3))))
| ~ theorem(X0) ) ).
cnf(u348,axiom,
theorem(or(or(X0,X1),not(X0))) ).
cnf(u63,axiom,
( theorem(not(not(X0)))
| ~ theorem(X0) ) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(u452,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X2,X0)) ) ).
cnf(u179,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(X0) ) ).
cnf(u519,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u251,axiom,
theorem(or(X0,or(or(not(or(X1,or(X0,X2))),X1),X2))) ).
cnf(u10,axiom,
axiom(or(not(or(X0,X0)),X0)) ).
cnf(u70,axiom,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u525,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u317,axiom,
theorem(or(X0,or(or(X1,not(or(X0,X2))),X2))) ).
cnf(u597,axiom,
( ~ theorem(or(X1,X2))
| ~ theorem(not(X2))
| theorem(or(X0,X1)) ) ).
cnf(u478,axiom,
( theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u490,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u433,axiom,
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X2,or(X1,X0))) ) ).
cnf(u129,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u157,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(X0) ) ).
cnf(u606,axiom,
( ~ theorem(not(or(not(X0),X1)))
| theorem(X0) ) ).
cnf(u44,axiom,
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u88,axiom,
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ) ).
cnf(u558,axiom,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(not(not(X0)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u568,axiom,
( ~ theorem(not(not(or(X0,or(not(X2),X1)))))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u160,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X3,X0)) ) ).
cnf(u259,axiom,
( theorem(or(X1,or(not(or(or(not(X0),X2),or(not(X0),X2))),X2)))
| ~ theorem(X0) ) ).
cnf(u496,axiom,
( theorem(or(not(or(not(X2),not(X1))),X0))
| ~ theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u111,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u123,axiom,
( theorem(or(or(X0,X1),X2))
| ~ theorem(X0) ) ).
cnf(u267,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(or(X0,X2),X1))) ).
cnf(u513,axiom,
( ~ theorem(or(or(X1,X1),X0))
| theorem(or(X0,X1)) ) ).
cnf(u227,axiom,
( ~ theorem(or(X2,not(X1)))
| theorem(or(X0,X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u579,axiom,
( ~ theorem(not(not(or(X0,not(X1)))))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u14,axiom,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u186,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(X0) ) ).
cnf(u158,axiom,
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u493,axiom,
( theorem(or(not(or(X2,not(X1))),or(X0,X3)))
| ~ theorem(or(X0,X1))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u365,axiom,
( ~ theorem(or(or(not(or(X1,not(X2))),X1),X2))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u436,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,or(X3,X0)))
| ~ theorem(or(X2,X1)) ) ).
cnf(u73,axiom,
theorem(or(X0,or(not(or(X1,X0)),X1))) ).
cnf(u139,axiom,
( theorem(or(not(or(not(X0),X1)),X2))
| ~ theorem(X0)
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u133,axiom,
( theorem(or(X1,or(not(or(X1,or(not(X0),X2))),X2)))
| ~ theorem(X0) ) ).
cnf(u596,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X0,X2)))
| ~ theorem(not(X1)) ) ).
cnf(u544,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(not(not(X0))) ) ).
cnf(u548,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(not(not(X0)))
| ~ theorem(X1) ) ).
cnf(u136,axiom,
( theorem(or(or(X1,X2),not(or(X1,or(not(X0),X2)))))
| ~ theorem(X0) ) ).
cnf(u616,axiom,
( ~ theorem(not(or(X0,X1)))
| theorem(not(X0)) ) ).
cnf(u196,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(X0) ) ).
cnf(u208,axiom,
( theorem(or(not(or(or(X0,not(X1)),not(X2))),X0))
| ~ theorem(X1)
| ~ theorem(X2) ) ).
cnf(u435,axiom,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(or(X2,or(X3,X0))) ) ).
cnf(u99,axiom,
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ) ).
cnf(u567,axiom,
( ~ theorem(not(not(or(X0,X2))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u159,axiom,
( theorem(or(X3,or(X1,or(X0,X2))))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u171,axiom,
( theorem(or(X1,or(not(or(X2,not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u507,axiom,
( ~ theorem(or(or(X2,or(X1,X3)),X0))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u203,axiom,
( theorem(or(not(or(X0,or(not(X1),not(X2)))),X0))
| ~ theorem(X2)
| ~ theorem(X1) ) ).
cnf(u231,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(not(or(X3,not(X1))),X3))) ) ).
cnf(u573,axiom,
( ~ theorem(not(not(or(X2,X0))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u277,axiom,
( theorem(or(X0,or(X1,not(or(X1,not(X2))))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u589,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X1))
| theorem(not(not(X0))) ) ).
cnf(u198,axiom,
( theorem(or(X1,not(or(not(X0),not(X0)))))
| ~ theorem(X0) ) ).
cnf(u517,axiom,
( ~ theorem(or(X2,X0))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u234,axiom,
( theorem(or(or(not(or(X2,not(X1))),X2),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u353,axiom,
theorem(or(or(not(or(X0,X0)),X1),X0)) ).
cnf(u470,axiom,
( ~ theorem(or(not(not(X1)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u77,axiom,
theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))) ).
cnf(u36,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u68,axiom,
theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X0,X1))) ).
cnf(u307,axiom,
theorem(or(X0,or(not(X0),X1))) ).
cnf(u140,axiom,
( theorem(or(not(or(not(X0),or(not(X1),X2))),X2))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u592,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(not(X1)) ) ).
cnf(u379,axiom,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ) ).
cnf(u43,axiom,
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u511,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(or(not(X2),X3),X0)) ) ).
cnf(u546,axiom,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(or(X2,not(not(X0)))) ) ).
cnf(u483,axiom,
( ~ theorem(or(not(X1),X3))
| theorem(or(not(or(X0,X2)),or(X2,X3)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u147,axiom,
( theorem(or(not(or(not(X0),X1)),X1))
| ~ theorem(X0) ) ).
cnf(u615,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(X0)) ) ).
cnf(u536,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u62,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u270,axiom,
theorem(or(not(or(X0,X1)),or(or(X0,X2),not(or(not(X1),X2))))) ).
cnf(u561,axiom,
( ~ theorem(or(X0,or(X1,not(X2))))
| theorem(or(not(not(X0)),X1))
| ~ theorem(X2) ) ).
cnf(u78,axiom,
theorem(or(X0,or(not(or(X0,X1)),X1))) ).
cnf(u162,axiom,
( theorem(or(X2,or(not(or(not(X1),X3)),or(X0,X3))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u389,axiom,
( theorem(or(X1,or(or(X2,X0),X3)))
| ~ theorem(X0) ) ).
cnf(u461,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X0,X2)) ) ).
cnf(u253,axiom,
( theorem(or(or(not(or(X0,or(not(X1),X2))),X0),X2))
| ~ theorem(X1) ) ).
cnf(u206,axiom,
( theorem(or(not(or(not(X0),not(X1))),X2))
| ~ theorem(X1)
| ~ theorem(or(X2,X0)) ) ).
cnf(u12,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u316,axiom,
theorem(or(or(X0,not(or(X1,X2))),or(X2,X1))) ).
cnf(u84,axiom,
theorem(or(or(not(X0),X0),X1)) ).
cnf(u311,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u355,axiom,
theorem(or(X0,or(or(not(or(X0,X1)),X2),X1))) ).
cnf(u383,axiom,
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u562,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(not(not(X0)),X2))
| ~ theorem(X1) ) ).
cnf(u492,axiom,
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u79,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(X1) ) ).
cnf(u522,axiom,
( theorem(or(X0,not(or(not(X1),not(X2)))))
| ~ theorem(or(X2,X0))
| ~ theorem(X1) ) ).
cnf(u559,axiom,
( theorem(or(not(not(X0)),or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u487,axiom,
( theorem(or(not(or(X0,not(X2))),X1))
| ~ theorem(or(not(X0),X1))
| ~ theorem(X2) ) ).
cnf(u594,axiom,
( theorem(or(not(or(or(X0,X1),or(X0,X1))),X1))
| ~ theorem(not(X0)) ) ).
cnf(u38,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ) ).
cnf(u553,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X0))
| theorem(or(X2,X1)) ) ).
cnf(u110,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(X0,or(X3,X1))) ) ).
cnf(u617,axiom,
( ~ theorem(not(or(X1,or(X0,X2))))
| theorem(not(or(X0,or(X1,X2)))) ) ).
cnf(u446,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u330,axiom,
theorem(or(or(not(X0),X1),X0)) ).
cnf(u97,axiom,
( theorem(or(not(or(or(X1,X1),not(X0))),X1))
| ~ theorem(X0) ) ).
cnf(u125,axiom,
( theorem(or(X1,not(or(not(X2),not(X0)))))
| ~ theorem(X0)
| ~ theorem(or(X1,X2)) ) ).
cnf(u169,axiom,
( theorem(or(X1,not(or(not(X0),not(X2)))))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u229,axiom,
( theorem(or(X0,not(or(not(X2),not(X1)))))
| ~ theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u529,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u512,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(or(X3,X1),X0)) ) ).
cnf(u540,axiom,
( ~ theorem(or(X0,X1))
| theorem(X1)
| ~ theorem(not(X0)) ) ).
cnf(u232,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(not(or(X3,not(X1))),X3)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u23,axiom,
( theorem(or(X0,X1))
| ~ theorem(X0) ) ).
cnf(u403,axiom,
theorem(or(or(or(not(X0),X0),X1),X2)) ).
cnf(u67,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u526,axiom,
( ~ theorem(or(not(X3),X2))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u547,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X2,X1)) ) ).
cnf(u464,axiom,
( theorem(or(X0,or(not(or(X1,or(X0,X2))),X3)))
| ~ theorem(or(not(or(X1,X2)),X3)) ) ).
cnf(u11,axiom,
axiom(or(not(X0),or(X1,X0))) ).
cnf(u318,axiom,
( theorem(or(or(X0,not(or(X1,not(X2)))),X1))
| ~ theorem(X2) ) ).
cnf(u199,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u262,axiom,
theorem(or(or(not(or(or(X0,X1),or(X0,X1))),X1),X0)) ).
cnf(u96,axiom,
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ) ).
cnf(u608,axiom,
( ~ theorem(not(or(not(or(X1,X0)),X1)))
| theorem(X0) ) ).
cnf(u434,axiom,
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ) ).
cnf(u613,axiom,
( ~ theorem(not(or(X0,X2)))
| theorem(not(or(X0,X1)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u41,axiom,
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u494,axiom,
( theorem(or(not(or(X2,not(X1))),or(X2,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u506,axiom,
( ~ theorem(or(or(X2,X1),X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u509,axiom,
( ~ theorem(or(or(not(X3),X2),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X3)) ) ).
cnf(u145,axiom,
( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u207,axiom,
( theorem(or(not(or(or(X0,not(X1)),or(X0,not(X1)))),X0))
| ~ theorem(X1) ) ).
cnf(u60,axiom,
theorem(or(X0,not(X0))) ).
cnf(u577,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(not(not(or(X2,X0)))) ) ).
cnf(u276,axiom,
theorem(or(X0,or(X1,not(or(X1,X0))))) ).
cnf(u164,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,X0))
| ~ theorem(X1) ) ).
cnf(u275,axiom,
theorem(or(X0,or(X1,not(X1)))) ).
cnf(u588,axiom,
( theorem(not(or(not(X0),X1)))
| ~ theorem(not(X1))
| ~ theorem(X0) ) ).
cnf(u570,axiom,
( ~ theorem(not(not(X1)))
| theorem(or(X0,X1)) ) ).
cnf(u456,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X0,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(X2) ) ).
cnf(u71,axiom,
theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))) ).
cnf(u514,axiom,
( ~ theorem(or(or(X1,not(X2)),X0))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u451,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u74,axiom,
theorem(or(X0,or(not(or(X1,or(X0,X2))),or(X1,X2)))) ).
cnf(u378,axiom,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X2,or(X0,X1))) ) ).
cnf(u134,axiom,
( ~ theorem(or(X1,or(X2,or(not(X0),X3))))
| theorem(or(X1,or(X2,X3)))
| ~ theorem(X0) ) ).
cnf(u438,axiom,
( theorem(or(or(X2,X0),X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u17,axiom,
theorem(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u482,axiom,
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u89,axiom,
theorem(or(or(not(or(X0,X1)),X0),X1)) ).
cnf(u264,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X2,X0)))
| ~ theorem(X1) ) ).
cnf(u48,axiom,
( ~ theorem(or(X0,X0))
| theorem(X0) ) ).
cnf(u560,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u328,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u279,axiom,
theorem(or(X0,or(or(X1,X2),not(or(X1,or(X0,X2)))))) ).
cnf(u212,axiom,
( theorem(or(X0,not(or(not(X1),X0))))
| ~ theorem(X1) ) ).
cnf(u115,axiom,
( ~ theorem(or(X2,or(not(X1),X3)))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u574,axiom,
( ~ theorem(not(not(or(not(X2),X1))))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u431,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u395,axiom,
theorem(or(X0,or(X1,or(not(X2),X2)))) ).
cnf(u618,axiom,
( ~ theorem(not(or(not(or(X2,X0)),or(X2,X1))))
| theorem(not(or(not(X0),X1))) ) ).
cnf(u527,axiom,
( theorem(or(X0,or(not(or(or(not(X1),X2),or(not(X1),X2))),X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u455,axiom,
( theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u310,axiom,
( theorem(or(X1,or(X2,not(not(X0)))))
| ~ theorem(X0) ) ).
cnf(u354,axiom,
theorem(or(or(not(or(X0,X1)),X2),or(X1,X0))) ).
cnf(u250,axiom,
theorem(or(or(not(or(X0,or(X1,X1))),X0),X1)) ).
cnf(u357,axiom,
( theorem(or(or(not(or(not(X0),X1)),X2),X1))
| ~ theorem(X0) ) ).
cnf(u21,axiom,
theorem(or(or(X0,X1),not(X1))) ).
cnf(u486,axiom,
( ~ theorem(or(not(X0),not(X1)))
| theorem(or(not(or(X0,X2)),X2))
| ~ theorem(X1) ) ).
cnf(u429,axiom,
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u93,axiom,
theorem(or(X0,or(or(not(X1),X1),X2))) ).
cnf(u545,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X1,X2)) ) ).
cnf(u52,axiom,
theorem(or(not(X0),X0)) ).
cnf(u260,axiom,
( theorem(or(X0,or(not(or(or(not(X1),X2),or(not(X1),X2))),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u272,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X1,X0)))
| ~ theorem(X2) ) ).
cnf(u156,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(X3,or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u332,axiom,
theorem(or(X0,or(X1,or(X2,not(X2))))) ).
cnf(u47,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ) ).
cnf(u268,axiom,
( theorem(or(not(or(not(X0),X1)),or(X1,X2)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u571,axiom,
( ~ theorem(not(not(or(X1,X0))))
| theorem(or(X0,X1)) ) ).
cnf(u499,axiom,
( ~ theorem(or(X2,or(X3,not(X1))))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u271,axiom,
theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X1,X0))) ).
cnf(u202,axiom,
( ~ theorem(or(not(X1),not(X2)))
| ~ theorem(X2)
| theorem(or(not(or(X0,X1)),X0)) ) ).
cnf(u586,axiom,
( theorem(not(or(X0,not(X1))))
| ~ theorem(not(X0))
| ~ theorem(X1) ) ).
cnf(u263,axiom,
( theorem(or(not(or(X0,X1)),or(X2,X0)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u286,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X2,X1))) ).
cnf(u460,axiom,
( theorem(or(X0,or(not(or(X1,X0)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u182,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u226,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u581,axiom,
( ~ theorem(not(not(not(X1))))
| theorem(X0)
| ~ theorem(or(X1,X0)) ) ).
cnf(u462,axiom,
( theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u69,axiom,
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u578,axiom,
( ~ theorem(not(not(or(X0,X0))))
| theorem(X0) ) ).
cnf(u72,axiom,
theorem(or(X0,or(not(X1),X1))) ).
cnf(u100,axiom,
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u552,axiom,
( ~ theorem(or(not(X0),X2))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u132,axiom,
( theorem(or(not(or(X1,or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u144,axiom,
( ~ theorem(or(not(X2),X0))
| ~ theorem(X2)
| theorem(or(not(or(not(X0),X1)),X1)) ) ).
cnf(u612,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(or(X0,X1))) ) ).
cnf(u35,axiom,
theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u219,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u508,axiom,
( ~ theorem(or(or(X3,X1),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u95,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ) ).
cnf(u575,axiom,
( ~ theorem(not(not(or(X1,not(X2)))))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u278,axiom,
theorem(or(X0,or(X1,not(or(or(X0,X1),or(X0,X1)))))) ).
cnf(u610,axiom,
( ~ theorem(not(or(X1,not(X0))))
| theorem(X0) ) ).
cnf(u54,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(or(not(X1),X0)) ) ).
cnf(u98,axiom,
( theorem(or(X1,or(not(or(or(X1,X2),not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u528,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u346,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u289,axiom,
theorem(or(X0,or(X1,not(X0)))) ).
cnf(u230,axiom,
( ~ theorem(or(or(not(or(X0,not(X1))),X0),X1))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u113,axiom,
( theorem(or(not(or(not(X1),X0)),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u13,axiom,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u450,axiom,
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ) ).
cnf(u503,axiom,
( ~ theorem(or(or(X1,or(not(X3),X2)),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(X3) ) ).
cnf(u453,axiom,
( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
| ~ theorem(or(not(or(X2,X1)),X3)) ) ).
cnf(u465,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X3,X0)) ) ).
cnf(u381,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u16,axiom,
theorem(or(not(X0),or(X1,X0))) ).
cnf(u114,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u76,axiom,
( theorem(or(X0,or(not(or(X0,X1)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u380,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(X3,X1))) ) ).
cnf(u315,axiom,
theorem(or(or(X0,not(or(X1,X1))),X1)) ).
cnf(u94,axiom,
( ~ theorem(or(X1,or(X2,not(X0))))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u39,axiom,
( theorem(or(or(X2,X1),not(or(X2,X0))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u484,axiom,
( theorem(or(not(or(X0,X2)),or(X1,X2)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u530,axiom,
( ~ theorem(or(X2,not(X3)))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u447,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X3)))
| ~ theorem(or(not(X2),X3))
| ~ theorem(X1) ) ).
cnf(u491,axiom,
( theorem(or(or(X2,X1),not(or(X0,X2))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u580,axiom,
( ~ theorem(not(not(X0)))
| theorem(X0) ) ).
cnf(u614,axiom,
( ~ theorem(not(or(X2,X1)))
| theorem(not(or(not(X0),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u42,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(X0,or(not(X2),X3))) ) ).
cnf(u557,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(not(not(X0)),X1)) ) ).
cnf(u569,axiom,
( ~ theorem(not(not(X0)))
| theorem(or(X0,X1)) ) ).
cnf(u146,axiom,
( theorem(or(not(or(or(not(X0),X1),not(X2))),X1))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u510,axiom,
( ~ theorem(or(or(X2,not(X3)),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X3)) ) ).
cnf(u265,axiom,
theorem(or(not(X0),or(X0,X1))) ).
cnf(u57,axiom,
( ~ theorem(or(X1,X1))
| theorem(or(X0,X1)) ) ).
cnf(u480,axiom,
( theorem(or(or(X0,not(or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u117,axiom,
( theorem(or(or(X0,X2),not(or(not(X1),X2))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u454,axiom,
( theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u161,axiom,
( theorem(or(X2,or(not(or(X3,X0)),or(X3,X1))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u233,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,not(X1))),X2))
| ~ theorem(X0) ) ).
cnf(u258,axiom,
( theorem(or(X0,not(or(or(X0,not(X1)),or(X0,not(X1))))))
| ~ theorem(X1) ) ).
cnf(u55,axiom,
theorem(or(not(or(or(X0,X0),or(X0,X0))),X0)) ).
cnf(u20,axiom,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ) ).
cnf(u356,axiom,
( theorem(or(or(not(or(X0,not(X1))),X2),X0))
| ~ theorem(X1) ) ).
cnf(u319,axiom,
( theorem(or(or(X0,not(or(not(X1),X2))),X2))
| ~ theorem(X1) ) ).
cnf(u252,axiom,
( theorem(or(or(not(or(X0,or(X1,not(X2)))),X0),X1))
| ~ theorem(X2) ) ).
cnf(u576,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(not(not(or(not(X1),X2)))) ) ).
cnf(u15,axiom,
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u87,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u539,axiom,
( ~ theorem(or(X2,not(X0)))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u467,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X3,X1)) ) ).
cnf(u131,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),or(X0,X2)),X1)) ).
cnf(u18,axiom,
( theorem(or(X0,X1))
| ~ theorem(X1) ) ).
cnf(u46,axiom,
theorem(or(not(or(X0,X0)),X0)) ).
cnf(u549,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u269,axiom,
theorem(or(not(or(not(X0),X1)),or(or(X2,X1),not(or(X2,X0))))) ).
cnf(u498,axiom,
( ~ theorem(or(X2,not(X1)))
| ~ theorem(or(X0,X1))
| theorem(or(X3,or(X0,X2))) ) ).
cnf(u501,axiom,
( theorem(or(or(X0,X2),not(or(X2,not(X1)))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u520,axiom,
( theorem(or(X0,not(or(not(X1),not(X2)))))
| ~ theorem(or(X1,X0))
| ~ theorem(X2) ) ).
cnf(u572,axiom,
( ~ theorem(not(not(or(X1,or(X0,X2)))))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u130,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u300,axiom,
theorem(or(X0,or(or(X1,not(X1)),X2))) ).
cnf(u168,axiom,
( theorem(or(X1,not(not(X0))))
| ~ theorem(X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL412-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:35:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.19/1.81 % (2750539)Input is clausal, will run a generic CNF schedule.
% 4.19/1.81 % (2750561)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=2588746290:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.19/1.81 % (2750563)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1318207629:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.19/1.81 % (2750568)lrs+10_1_sil=8000:sp=occurrence:random_seed=3029076231:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.19/1.81 % (2750568)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750568)------------------------------
% 4.19/1.81 % (2750568)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750568)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750568)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750568)Time elapsed: 0.001 s
% 4.19/1.81 % (2750568)Peak memory usage: 86 MB
% 4.19/1.81 % (2750570)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1585587983:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.19/1.81 % (2750566)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3825038066:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.19/1.81 % (2750569)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3643053292:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.19/1.81 % (2750569)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750569)------------------------------
% 4.19/1.81 % (2750569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750569)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750569)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750569)Time elapsed: 0.001 s
% 4.19/1.81 % (2750569)Peak memory usage: 86 MB
% 4.19/1.81 % (2750570)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750570)------------------------------
% 4.19/1.81 % (2750570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750570)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750570)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750570)Time elapsed: 0.003 s
% 4.19/1.81 % (2750570)Peak memory usage: 88 MB
% 4.19/1.81 % (2750570)Instructions burned: 2 (million)
% 4.19/1.81 % (2750571)dis-21_1_sil=8000:lcm=predicate:random_seed=480569902: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)
% 4.19/1.81 % (2750571)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750571)------------------------------
% 4.19/1.81 % (2750571)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750571)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750571)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750571)Time elapsed: 0.001 s
% 4.19/1.81 % (2750571)Peak memory usage: 86 MB
% 4.19/1.81 % (2750568)------------------------------
% 4.19/1.81 % (2750568)------------------------------
% 4.19/1.81 % (2750569)------------------------------
% 4.19/1.81 % (2750569)------------------------------
% 4.19/1.81 % (2750570)------------------------------
% 4.19/1.81 % (2750570)------------------------------
% 4.19/1.81 % (2750571)------------------------------
% 4.19/1.81 % (2750571)------------------------------
% 4.19/1.81 % (2750561)First to succeed.
% 4.19/1.81 % (2750561)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2750539"
% 4.19/1.81 % (2750595)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=3099516670:i=143:sd=2:aac=none:ss=axioms:sgt=16_2993 on theBenchmark for (2993ds/143Mi)
% 4.19/1.81 % (2750595)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750595)------------------------------
% 4.19/1.81 % (2750595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750595)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750595)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750595)Time elapsed: 0.001 s
% 4.19/1.81 % (2750595)Peak memory usage: 86 MB
% 4.19/1.81 % (2750596)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1986809384: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)
% 4.19/1.81 % (2750596)Refutation not found, incomplete strategy
% 4.19/1.81 % (2750596)------------------------------
% 4.19/1.81 % (2750596)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.19/1.81 % (2750596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.19/1.81 % (2750596)CaDiCaL version: 2.1.3
% 4.19/1.81 % (2750596)Termination reason: Refutation not found, incomplete strategy
% 4.19/1.81 % (2750596)Time elapsed: 0.001 s
% 4.19/1.81 % (2750596)Peak memory usage: 86 MB
% 4.19/1.81 % SZS status Satisfiable for theBenchmark
% 4.19/1.81 % SZS output start Saturation.
% See solution above
% 7.21/1.96 % SZS output start Definitions and Model Updates.
% 7.21/1.96 for all inputs,
% 7.21/1.96 define and(X0,X1) := not(or(not(X0),not(X1)))
% 7.21/1.96 for all inputs,
% 7.21/1.96 define implies(X0,X1) := or(not(X0),X1)
% 7.21/1.96 % SZS output end Definitions and Model Updates.
% 7.21/1.96 % (2750561)------------------------------
% 7.21/1.96 % (2750561)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.21/1.96 % (2750561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.21/1.96 % (2750561)CaDiCaL version: 2.1.3
% 7.21/1.96 % (2750561)Termination reason: Satisfiable
% 7.21/1.96 % (2750561)Time elapsed: 0.578 s
% 7.21/1.96 % (2750561)Peak memory usage: 131 MB
% 7.21/1.96 % (2750561)Instructions burned: 1221 (million)
% 7.21/1.96 % (2750561)------------------------------
% 7.21/1.96 % (2750561)------------------------------
% 7.21/1.96 % (2750539)Success in time 0.947 s
% 7.21/1.96 % Vampire exiting
%------------------------------------------------------------------------------