%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL413-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 : n020.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 3.24s 1.61s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u30,axiom,
theorem(X1) ).
cnf(u344,axiom,
( theorem(or(or(X0,not(or(not(X1),X2))),X2))
| ~ theorem(X1) ) ).
cnf(u295,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X2,X0)))
| ~ theorem(X1) ) ).
cnf(u580,axiom,
( ~ theorem(not(not(or(X0,X0))))
| theorem(X0) ) ).
cnf(u367,axiom,
theorem(or(X0,or(X1,or(X2,not(X2))))) ).
cnf(u476,axiom,
( theorem(or(X0,or(not(or(X1,or(X0,X2))),X3)))
| ~ theorem(or(not(or(X1,X2)),X3)) ) ).
cnf(u411,axiom,
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X2,or(X1,X0))) ) ).
cnf(u75,axiom,
theorem(or(X0,or(not(or(X1,X0)),X1))) ).
cnf(u474,axiom,
( theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u524,axiom,
( theorem(or(X0,not(or(not(X1),not(X2)))))
| ~ theorem(or(X2,X0))
| ~ theorem(X1) ) ).
cnf(u135,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u578,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(not(not(or(not(X1),X2)))) ) ).
cnf(u22,axiom,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ) ).
cnf(u521,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u549,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X2,X1)) ) ).
cnf(u138,axiom,
( theorem(or(not(or(X1,or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u257,axiom,
theorem(or(or(not(or(or(X0,X1),or(X0,X1))),X1),X0)) ).
cnf(u49,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ) ).
cnf(u502,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u81,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(X1) ) ).
cnf(u109,axiom,
( theorem(or(X1,or(not(or(or(X1,X2),not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u153,axiom,
( theorem(or(not(or(not(X0),X1)),X1))
| ~ theorem(X0) ) ).
cnf(u40,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ) ).
cnf(u213,axiom,
( theorem(or(not(or(X0,or(not(X1),not(X2)))),X0))
| ~ theorem(X2)
| ~ theorem(X1) ) ).
cnf(u288,axiom,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X2,or(X0,X1))) ) ).
cnf(u236,axiom,
( theorem(or(or(not(or(X2,not(X1))),X2),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u216,axiom,
( theorem(or(not(or(not(X0),not(X1))),X2))
| ~ theorem(X1)
| ~ theorem(or(X2,X0)) ) ).
cnf(u392,axiom,
( theorem(or(or(not(or(X0,not(X1))),X2),X0))
| ~ theorem(X1) ) ).
cnf(u343,axiom,
( theorem(or(or(X0,not(or(X1,not(X2)))),X1))
| ~ theorem(X2) ) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(u179,axiom,
( theorem(or(X1,or(not(or(X2,or(not(X0),X3))),or(X2,X3))))
| ~ theorem(X0) ) ).
cnf(u519,axiom,
( ~ theorem(or(X2,X0))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u531,axiom,
( theorem(or(X0,or(not(or(X1,or(not(X2),X3))),or(X1,X3))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u582,axiom,
( ~ theorem(not(not(X0)))
| theorem(X0) ) ).
cnf(u441,axiom,
( theorem(or(not(or(not(X2),not(X1))),X0))
| ~ theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u559,axiom,
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(not(not(X0)),X1)) ) ).
cnf(u70,axiom,
theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X0,X1))) ).
cnf(u142,axiom,
( theorem(or(or(X1,X2),not(or(X1,or(not(X0),X2)))))
| ~ theorem(X0) ) ).
cnf(u361,axiom,
theorem(or(X0,or(or(X1,not(X1)),X2))) ).
cnf(u25,axiom,
( theorem(or(X0,X1))
| ~ theorem(X0) ) ).
cnf(u490,axiom,
( theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u44,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(X0,or(not(X2),X3))) ) ).
cnf(u45,axiom,
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u548,axiom,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(or(X2,not(not(X0)))) ) ).
cnf(u259,axiom,
theorem(or(or(not(or(X0,or(X1,X1))),X0),X1)) ).
cnf(u51,axiom,
theorem(or(X0,not(or(X0,X0)))) ).
cnf(u496,axiom,
( theorem(or(not(or(X0,X2)),or(X1,X2)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u111,axiom,
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u554,axiom,
( ~ theorem(or(not(X0),X2))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u391,axiom,
theorem(or(X0,or(or(not(or(X0,X1)),X2),X1))) ).
cnf(u513,axiom,
( theorem(or(X0,or(not(or(X1,X2)),or(X1,X3))))
| ~ theorem(or(or(not(X2),X3),X0)) ) ).
cnf(u579,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(not(not(or(X2,X0)))) ) ).
cnf(u14,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u186,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(X0) ) ).
cnf(u293,axiom,
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u174,axiom,
( theorem(or(X1,not(not(X0))))
| ~ theorem(X0) ) ).
cnf(u212,axiom,
( ~ theorem(or(not(X1),not(X2)))
| ~ theorem(X2)
| theorem(or(not(or(X0,X1)),X0)) ) ).
cnf(u409,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u73,axiom,
theorem(or(or(X0,or(X1,X2)),not(or(X1,or(X0,X2))))) ).
cnf(u596,axiom,
( theorem(or(not(or(or(X0,X1),or(X0,X1))),X1))
| ~ theorem(not(X0)) ) ).
cnf(u205,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u193,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(X0) ) ).
cnf(u268,axiom,
( theorem(or(X1,or(or(X2,X0),X3)))
| ~ theorem(X0) ) ).
cnf(u572,axiom,
( ~ theorem(not(not(X1)))
| theorem(or(X0,X1)) ) ).
cnf(u136,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u555,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X0))
| theorem(or(X2,X1)) ) ).
cnf(u616,axiom,
( ~ theorem(not(or(X2,X1)))
| theorem(not(or(not(X0),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u588,axiom,
( theorem(not(or(X0,not(X1))))
| ~ theorem(not(X0))
| ~ theorem(X1) ) ).
cnf(u99,axiom,
theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))) ).
cnf(u495,axiom,
( ~ theorem(or(not(X1),X3))
| theorem(or(not(or(X0,X2)),or(X2,X3)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u159,axiom,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(or(X0,X1)) ) ).
cnf(u203,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(X0) ) ).
cnf(u231,axiom,
( theorem(or(X0,not(or(not(X2),not(X1)))))
| ~ theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u573,axiom,
( ~ theorem(not(not(or(X1,X0))))
| theorem(or(X0,X1)) ) ).
cnf(u589,axiom,
( theorem(not(or(X0,X0)))
| ~ theorem(not(X0)) ) ).
cnf(u617,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(X0)) ) ).
cnf(u309,axiom,
theorem(or(X0,or(X1,not(or(or(X0,X1),or(X0,X1)))))) ).
cnf(u234,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(not(or(X3,not(X1))),X3)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u341,axiom,
theorem(or(or(X0,not(or(X1,X2))),or(X2,X1))) ).
cnf(u353,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u413,axiom,
( ~ theorem(or(X0,not(X1)))
| ~ theorem(X1)
| theorem(or(X2,or(X3,X0))) ) ).
cnf(u77,axiom,
theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))) ).
cnf(u466,axiom,
( theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u457,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u80,axiom,
theorem(or(X0,or(not(or(X0,X1)),X1))) ).
cnf(u307,axiom,
theorem(or(X0,or(X1,not(or(X1,X0))))) ).
cnf(u140,axiom,
( ~ theorem(or(X1,or(X2,or(not(X0),X3))))
| theorem(or(X1,or(X2,X3)))
| ~ theorem(X0) ) ).
cnf(u444,axiom,
( ~ theorem(or(X2,or(X3,not(X1))))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u620,axiom,
( ~ theorem(not(or(not(or(X2,X0)),or(X2,X1))))
| theorem(not(or(not(X0),X1))) ) ).
cnf(u43,axiom,
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u488,axiom,
( theorem(or(or(not(or(X0,X1)),X2),or(X0,X3)))
| ~ theorem(or(not(X1),X3)) ) ).
cnf(u439,axiom,
( theorem(or(not(or(X2,not(X1))),or(X2,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u546,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(not(not(X0))) ) ).
cnf(u483,axiom,
( ~ theorem(or(not(not(X0)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u511,axiom,
( ~ theorem(or(or(not(X3),X2),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X3)) ) ).
cnf(u615,axiom,
( ~ theorem(not(or(X0,X2)))
| theorem(not(or(X0,X1)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u62,axiom,
theorem(or(X0,not(X0))) ).
cnf(u106,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ) ).
cnf(u561,axiom,
( theorem(or(not(not(X0)),or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u166,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X3,X0)) ) ).
cnf(u342,axiom,
theorem(or(X0,or(or(X1,not(or(X0,X2))),X2))) ).
cnf(u522,axiom,
( theorem(or(X0,not(or(not(X1),not(X2)))))
| ~ theorem(or(X1,X0))
| ~ theorem(X2) ) ).
cnf(u329,axiom,
theorem(or(or(X0,not(X0)),X1)) ).
cnf(u389,axiom,
theorem(or(or(not(or(X0,X0)),X1),X0)) ).
cnf(u461,axiom,
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ) ).
cnf(u541,axiom,
( ~ theorem(or(X2,not(X0)))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u574,axiom,
( ~ theorem(not(not(or(X1,or(X0,X2)))))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u12,axiom,
axiom(or(not(or(X0,X0)),X0)) ).
cnf(u311,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u355,axiom,
theorem(or(or(not(X0),X1),X0)) ).
cnf(u19,axiom,
theorem(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(u464,axiom,
( theorem(or(not(or(X0,not(X1))),or(X2,X3)))
| ~ theorem(or(not(X0),X3))
| ~ theorem(or(X2,X1)) ) ).
cnf(u79,axiom,
theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))) ).
cnf(u91,axiom,
theorem(or(or(not(or(X0,X1)),X0),X1)) ).
cnf(u550,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(not(not(X0)))
| ~ theorem(X1) ) ).
cnf(u151,axiom,
( theorem(or(not(or(or(not(X0),X1),or(not(X0),X1))),X1))
| ~ theorem(X0) ) ).
cnf(u594,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(not(X1)) ) ).
cnf(u38,axiom,
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u110,axiom,
( theorem(not(or(not(X0),not(X0))))
| ~ theorem(X0) ) ).
cnf(u446,axiom,
( theorem(or(or(X0,X2),not(or(X2,not(X1)))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u261,axiom,
( theorem(or(or(not(or(X0,or(X1,not(X2)))),X0),X1))
| ~ theorem(X2) ) ).
cnf(u390,axiom,
theorem(or(or(not(or(X0,X1)),X2),or(X1,X0))) ).
cnf(u97,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(X0,or(X3,X1))) ) ).
cnf(u125,axiom,
( theorem(or(or(X0,X1),X2))
| ~ theorem(X0) ) ).
cnf(u505,axiom,
( ~ theorem(or(or(X1,or(not(X3),X2)),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(X3) ) ).
cnf(u56,axiom,
( theorem(or(not(or(X0,X1)),X0))
| ~ theorem(or(not(X1),X0)) ) ).
cnf(u229,axiom,
( ~ theorem(or(X2,not(X1)))
| theorem(or(X0,X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u512,axiom,
( ~ theorem(or(or(X2,not(X3)),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X1,X3)) ) ).
cnf(u529,axiom,
( theorem(or(X0,or(not(or(or(not(X1),X2),or(not(X1),X2))),X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u458,axiom,
( theorem(or(not(or(X0,or(not(X1),X2))),or(X0,X3)))
| ~ theorem(or(not(X2),X3))
| ~ theorem(X1) ) ).
cnf(u299,axiom,
( theorem(or(not(or(not(X0),X1)),or(X1,X2)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u232,axiom,
( ~ theorem(or(or(not(or(X0,not(X1))),X0),X1))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u23,axiom,
theorem(or(or(X0,X1),not(X1))) ).
cnf(u468,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X0,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(X2) ) ).
cnf(u290,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(X3,X1))) ) ).
cnf(u547,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,not(not(X0))))
| ~ theorem(or(X1,X2)) ) ).
cnf(u255,axiom,
( theorem(or(X0,or(not(or(or(not(X1),X2),or(not(X1),X2))),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u139,axiom,
( theorem(or(X1,or(not(or(X1,or(not(X0),X2))),X2)))
| ~ theorem(X0) ) ).
cnf(u598,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X0,X2)))
| ~ theorem(not(X1)) ) ).
cnf(u318,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),X0),or(X2,X1))) ).
cnf(u416,axiom,
( theorem(or(or(X2,X0),X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u86,axiom,
theorem(or(or(not(X0),X0),X1)) ).
cnf(u336,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u562,axiom,
( theorem(or(X1,or(not(not(X0)),X2)))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u608,axiom,
( ~ theorem(not(or(not(X0),X1)))
| theorem(X0) ) ).
cnf(u41,axiom,
( theorem(or(or(X2,X1),not(or(X2,X0))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u494,axiom,
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u101,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u509,axiom,
( ~ theorem(or(or(X2,or(X1,X3)),X0))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u145,axiom,
( theorem(or(not(or(not(X0),X1)),X2))
| ~ theorem(X0)
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u217,axiom,
( theorem(or(not(or(or(X0,not(X1)),or(X0,not(X1)))),X0))
| ~ theorem(X1) ) ).
cnf(u514,axiom,
( theorem(or(X0,or(not(or(not(X1),X2)),or(X3,X2))))
| ~ theorem(or(or(X3,X1),X0)) ) ).
cnf(u104,axiom,
( theorem(or(or(X0,X2),not(or(not(X1),X2))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u340,axiom,
theorem(or(or(X0,not(or(X1,X1))),X1)) ).
cnf(u164,axiom,
( theorem(or(X2,or(X1,X0)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u176,axiom,
( theorem(or(X1,not(or(not(X0),not(X0)))))
| ~ theorem(X0) ) ).
cnf(u516,axiom,
( ~ theorem(or(or(X1,not(X2)),X0))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u303,axiom,
( theorem(or(not(or(or(X0,X1),not(X2))),or(X1,X0)))
| ~ theorem(X2) ) ).
cnf(u384,axiom,
theorem(or(or(X0,X1),not(X0))) ).
cnf(u412,axiom,
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X1,X0)) ) ).
cnf(u127,axiom,
( theorem(or(X1,not(or(not(X2),not(X0)))))
| ~ theorem(X0)
| ~ theorem(or(X1,X2)) ) ).
cnf(u570,axiom,
( ~ theorem(not(not(or(X0,or(not(X2),X1)))))
| theorem(or(X0,X1))
| ~ theorem(X2) ) ).
cnf(u407,axiom,
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u71,axiom,
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ) ).
cnf(u523,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X1,X0)) ) ).
cnf(u583,axiom,
( ~ theorem(not(not(not(X1))))
| theorem(X0)
| ~ theorem(or(X1,X0)) ) ).
cnf(u595,axiom,
( ~ theorem(or(X2,X1))
| ~ theorem(not(X2))
| theorem(or(not(or(X0,not(X1))),X0)) ) ).
cnf(u306,axiom,
theorem(or(X0,or(X1,not(X1)))) ).
cnf(u463,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X2,X0)) ) ).
cnf(u74,axiom,
theorem(or(X0,or(not(X1),X1))) ).
cnf(u619,axiom,
( ~ theorem(not(or(X1,or(X0,X2))))
| theorem(not(or(X0,or(X1,X2)))) ) ).
cnf(u438,axiom,
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u17,axiom,
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u335,axiom,
( theorem(or(X1,or(X2,not(not(X0)))))
| ~ theorem(X0) ) ).
cnf(u482,axiom,
( ~ theorem(or(not(not(X1)),X2))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u89,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u48,axiom,
theorem(or(not(or(X0,X0)),X0)) ).
cnf(u338,axiom,
theorem(or(or(X0,not(X1)),X1)) ).
cnf(u108,axiom,
( theorem(or(not(or(or(X1,X1),not(X0))),X1))
| ~ theorem(X0) ) ).
cnf(u560,axiom,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(not(not(X0)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u152,axiom,
( theorem(or(not(or(or(not(X0),X1),not(X2))),X1))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u591,axiom,
( ~ theorem(or(X0,X1))
| ~ theorem(not(X1))
| theorem(not(not(X0))) ) ).
cnf(u308,axiom,
( theorem(or(X0,or(X1,not(or(X1,not(X2))))))
| ~ theorem(or(X0,X2)) ) ).
cnf(u590,axiom,
( theorem(not(or(not(X0),X1)))
| ~ theorem(not(X1))
| ~ theorem(X0) ) ).
cnf(u162,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(X3,or(X0,X2)))
| ~ theorem(X1) ) ).
cnf(u175,axiom,
( theorem(or(X1,not(or(not(X0),not(X2)))))
| ~ theorem(X0)
| ~ theorem(X2) ) ).
cnf(u618,axiom,
( ~ theorem(not(or(X0,X1)))
| theorem(not(X0)) ) ).
cnf(u527,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u310,axiom,
theorem(or(X0,or(or(X1,X2),not(or(X1,or(X0,X2)))))) ).
cnf(u178,axiom,
( theorem(or(X1,or(not(or(X2,not(X0))),X2)))
| ~ theorem(X0) ) ).
cnf(u78,axiom,
( theorem(or(X0,or(not(or(X0,X1)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u414,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,or(X3,X0)))
| ~ theorem(or(X2,X1)) ) ).
cnf(u577,axiom,
( ~ theorem(not(not(or(X1,not(X2)))))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u65,axiom,
( theorem(not(not(X0)))
| ~ theorem(X0) ) ).
cnf(u473,axiom,
( theorem(or(X0,or(not(or(X1,not(X2))),X3)))
| ~ theorem(or(not(X1),X3))
| ~ theorem(or(X0,X2)) ) ).
cnf(u137,axiom,
theorem(or(or(not(or(X0,or(X1,X2))),or(X0,X2)),X1)) ).
cnf(u24,axiom,
theorem(or(or(X0,X1),not(or(X1,X0)))) ).
cnf(u294,axiom,
( theorem(or(not(or(X0,X1)),or(X2,X0)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u260,axiom,
theorem(or(X0,or(or(not(or(X1,or(X0,X2))),X1),X2))) ).
cnf(u564,axiom,
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(not(not(X0)),X2))
| ~ theorem(X1) ) ).
cnf(u332,axiom,
theorem(or(X0,or(not(X0),X1))) ).
cnf(u551,axiom,
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ) ).
cnf(u59,axiom,
( ~ theorem(or(X1,X1))
| theorem(or(X0,X1)) ) ).
cnf(u504,axiom,
( ~ theorem(or(or(X1,X3),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u515,axiom,
( ~ theorem(or(or(X1,X1),X0))
| theorem(or(X0,X1)) ) ).
cnf(u571,axiom,
( ~ theorem(not(not(X0)))
| theorem(or(X0,X1)) ) ).
cnf(u499,axiom,
( theorem(or(not(or(X0,not(X2))),X1))
| ~ theorem(or(not(X0),X1))
| ~ theorem(X2) ) ).
cnf(u163,axiom,
( theorem(or(X1,or(X2,X0)))
| ~ theorem(X0) ) ).
cnf(u50,axiom,
( ~ theorem(or(X0,X0))
| theorem(X0) ) ).
cnf(u235,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,not(X1))),X2))
| ~ theorem(X0) ) ).
cnf(u298,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(or(X0,X2),X1))) ).
cnf(u538,axiom,
( theorem(or(X0,or(X1,not(not(X2)))))
| ~ theorem(or(X2,X0)) ) ).
cnf(u301,axiom,
theorem(or(not(or(X0,X1)),or(or(X0,X2),not(or(not(X1),X2))))) ).
cnf(u254,axiom,
( theorem(or(X1,or(not(or(or(not(X0),X2),or(not(X0),X2))),X2)))
| ~ theorem(X0) ) ).
cnf(u581,axiom,
( ~ theorem(not(not(or(X0,not(X1)))))
| theorem(X0)
| ~ theorem(X1) ) ).
cnf(u462,axiom,
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ) ).
cnf(u405,axiom,
theorem(or(or(or(not(X0),X0),X1),X2)) ).
cnf(u69,axiom,
theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u611,axiom,
( ~ theorem(not(or(X1,not(X0))))
| theorem(X0) ) ).
cnf(u477,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X3,X0)) ) ).
cnf(u141,axiom,
( ~ theorem(or(X1,or(not(X0),X2)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u563,axiom,
( ~ theorem(or(X0,or(X1,not(X2))))
| theorem(or(not(not(X0)),X1))
| ~ theorem(X2) ) ).
cnf(u72,axiom,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u100,axiom,
( theorem(or(not(or(not(X1),X0)),X0))
| ~ theorem(or(X0,X1)) ) ).
cnf(u508,axiom,
( ~ theorem(or(or(X2,X1),X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u95,axiom,
theorem(or(X0,or(or(not(X1),X1),X2))) ).
cnf(u107,axiom,
( theorem(or(X1,not(or(X1,not(X0)))))
| ~ theorem(X0) ) ).
cnf(u575,axiom,
( ~ theorem(not(not(or(X2,X0))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u503,axiom,
( theorem(or(or(X2,X1),not(or(X0,X2))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u167,axiom,
( theorem(or(X2,or(not(or(X3,X0)),or(X3,X1))))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u610,axiom,
( ~ theorem(not(or(not(or(X1,X0)),X1)))
| theorem(X0) ) ).
cnf(u54,axiom,
theorem(or(not(X0),X0)) ).
cnf(u211,axiom,
( theorem(or(or(X1,X0),X2))
| ~ theorem(or(X0,X1)) ) ).
cnf(u98,axiom,
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u170,axiom,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X2,X0))
| ~ theorem(X1) ) ).
cnf(u289,axiom,
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ) ).
cnf(u230,axiom,
( theorem(or(not(or(X2,not(X1))),or(X0,X2)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u13,axiom,
axiom(or(not(X0),or(X1,X0))) ).
cnf(u393,axiom,
( theorem(or(or(not(or(not(X0),X1)),X2),X1))
| ~ theorem(X0) ) ).
cnf(u465,axiom,
( theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3)))
| ~ theorem(or(not(or(X2,X1)),X3)) ) ).
cnf(u532,axiom,
( ~ theorem(or(X2,not(X3)))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(X1,X2))) ) ).
cnf(u16,axiom,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u76,axiom,
theorem(or(X0,or(not(or(X1,or(X0,X2))),or(X1,X2)))) ).
cnf(u528,axiom,
( ~ theorem(or(not(X3),X2))
| ~ theorem(or(X3,X0))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u375,axiom,
theorem(or(or(or(X0,not(X0)),X1),X2)) ).
cnf(u39,axiom,
theorem(or(or(not(or(X0,X1)),or(X0,X2)),not(or(not(X1),X2)))) ).
cnf(u542,axiom,
( ~ theorem(or(X0,X1))
| theorem(X1)
| ~ theorem(not(X0)) ) ).
cnf(u479,axiom,
( ~ theorem(or(not(X3),X2))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X3,X1)) ) ).
cnf(u491,axiom,
( theorem(or(or(X0,not(or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ) ).
cnf(u614,axiom,
( ~ theorem(not(or(X1,X0)))
| theorem(not(or(X0,X1))) ) ).
cnf(u42,axiom,
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ) ).
cnf(u253,axiom,
( theorem(or(X0,not(or(or(X0,not(X1)),or(X0,not(X1))))))
| ~ theorem(X1) ) ).
cnf(u20,axiom,
( theorem(or(X0,X1))
| ~ theorem(X1) ) ).
cnf(u102,axiom,
( ~ theorem(or(X2,or(not(X1),X3)))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ) ).
cnf(u278,axiom,
( ~ theorem(or(or(not(or(X1,not(X2))),X1),X2))
| theorem(or(X0,or(not(or(X1,not(X2))),X1))) ) ).
cnf(u569,axiom,
( ~ theorem(not(not(or(X0,X2))))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ) ).
cnf(u146,axiom,
( theorem(or(not(or(not(X0),or(not(X1),X2))),X2))
| ~ theorem(X0)
| ~ theorem(X1) ) ).
cnf(u322,axiom,
theorem(or(X0,or(X1,not(X0)))) ).
cnf(u510,axiom,
( ~ theorem(or(or(X3,X1),X0))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ) ).
cnf(u57,axiom,
theorem(or(not(or(or(X0,X0),or(X0,X0))),X0)) ).
cnf(u218,axiom,
( theorem(or(not(or(or(X0,not(X1)),not(X2))),X0))
| ~ theorem(X1)
| ~ theorem(X2) ) ).
cnf(u397,axiom,
theorem(or(X0,or(X1,or(not(X2),X2)))) ).
cnf(u189,axiom,
( ~ theorem(or(X1,not(X0)))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u233,axiom,
( ~ theorem(or(not(X0),X1))
| ~ theorem(X0)
| theorem(or(X2,or(not(or(X3,not(X1))),X3))) ) ).
cnf(u443,axiom,
( ~ theorem(or(X2,not(X1)))
| ~ theorem(or(X0,X1))
| theorem(or(X3,or(X0,X2))) ) ).
cnf(u296,axiom,
theorem(or(not(X0),or(X0,X1))) ).
cnf(u302,axiom,
theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X1,X0))) ).
cnf(u64,axiom,
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u291,axiom,
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(X2,X0)) ) ).
cnf(u576,axiom,
( ~ theorem(not(not(or(not(X2),X1))))
| theorem(or(X0,X1))
| ~ theorem(or(X0,X2)) ) ).
cnf(u15,axiom,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(u472,axiom,
( theorem(or(X0,or(not(or(X1,X0)),X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u530,axiom,
( theorem(or(X0,or(not(not(X1)),X2)))
| ~ theorem(or(X1,X0)) ) ).
cnf(u467,axiom,
( theorem(or(not(or(or(X0,X1),or(X0,X1))),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ) ).
cnf(u131,axiom,
( theorem(or(X0,not(or(not(X1),not(X1)))))
| ~ theorem(or(X0,X1)) ) ).
cnf(u599,axiom,
( ~ theorem(or(X1,X2))
| ~ theorem(not(X2))
| theorem(or(X0,X1)) ) ).
cnf(u18,axiom,
theorem(or(not(X0),or(X1,X0))) ).
cnf(u46,axiom,
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ) ).
cnf(u90,axiom,
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ) ).
cnf(u545,axiom,
( ~ theorem(or(X0,not(not(X0))))
| theorem(or(X1,not(not(X0)))) ) ).
cnf(u150,axiom,
( ~ theorem(or(not(X2),X0))
| ~ theorem(X2)
| theorem(or(not(or(not(X0),X1)),X1)) ) ).
cnf(u222,axiom,
( theorem(or(X0,not(or(not(X1),X0))))
| ~ theorem(X1) ) ).
cnf(u37,axiom,
theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(u105,axiom,
( ~ theorem(or(X1,or(X2,not(X0))))
| theorem(or(X1,X2))
| ~ theorem(X0) ) ).
cnf(u501,axiom,
( ~ theorem(or(X2,or(X0,X3)))
| theorem(or(X2,or(X3,X1)))
| ~ theorem(or(not(X0),X1)) ) ).
cnf(u165,axiom,
( theorem(or(X3,or(X1,or(X0,X2))))
| ~ theorem(or(X0,or(X1,X2))) ) ).
cnf(u262,axiom,
( theorem(or(or(not(or(X0,or(not(X1),X2))),X0),X2))
| ~ theorem(X1) ) ).
cnf(u498,axiom,
( ~ theorem(or(not(X0),not(X1)))
| theorem(or(not(or(X0,X2)),X2))
| ~ theorem(X1) ) ).
cnf(u300,axiom,
theorem(or(not(or(not(X0),X1)),or(or(X2,X1),not(or(X2,X0))))) ).
cnf(u168,axiom,
( theorem(or(X2,or(not(or(not(X1),X3)),or(X0,X3))))
| ~ theorem(or(X0,X1)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL413-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.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:41:34 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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
% 3.24/1.61 % (3557662)Input is clausal, will run a generic CNF schedule.
% 3.24/1.61 % (3557780)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=2125953203:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.24/1.61 % (3557785)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3436922696:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.24/1.61 % (3557786)dis-21_1_sil=8000:lcm=predicate:random_seed=2146541042: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)
% 3.24/1.61 % (3557783)lrs+10_1_sil=8000:sp=occurrence:random_seed=362137831:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.24/1.61 % (3557781)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1739402857:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.24/1.61 % (3557782)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2174778757:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.24/1.61 % (3557784)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=715579655:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.24/1.61 % (3557784)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557784)------------------------------
% 3.24/1.61 % (3557784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557783)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557783)------------------------------
% 3.24/1.61 % (3557783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557786)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557786)------------------------------
% 3.24/1.61 % (3557786)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557786)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557783)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557786)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557784)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557786)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557786)Time elapsed: 0.001 s
% 3.24/1.61 % (3557783)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557783)Time elapsed: 0.001 s
% 3.24/1.61 % (3557784)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557784)Time elapsed: 0.001 s
% 3.24/1.61 % (3557786)Peak memory usage: 85 MB
% 3.24/1.61 % (3557783)Peak memory usage: 85 MB
% 3.24/1.61 % (3557784)Peak memory usage: 86 MB
% 3.24/1.61 % (3557785)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557785)------------------------------
% 3.24/1.61 % (3557785)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557785)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557785)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557785)Time elapsed: 0.002 s
% 3.24/1.61 % (3557785)Peak memory usage: 88 MB
% 3.24/1.61 % (3557785)Instructions burned: 2 (million)
% 3.24/1.61 % (3557785)------------------------------
% 3.24/1.61 % (3557785)------------------------------
% 3.24/1.61 % (3557784)------------------------------
% 3.24/1.61 % (3557784)------------------------------
% 3.24/1.61 % (3557783)------------------------------
% 3.24/1.61 % (3557783)------------------------------
% 3.24/1.61 % (3557786)------------------------------
% 3.24/1.61 % (3557786)------------------------------
% 3.24/1.61 % (3557780)First to succeed.
% 3.24/1.61 % (3557780)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3557662"
% 3.24/1.61 % (3557796)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=254098216:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 3.24/1.61 % (3557795)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=610904658:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 3.24/1.61 % (3557797)lrs+10_64_to=lpo:sil=8000:random_seed=3317197122:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 3.24/1.61 % (3557794)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=3780003931:i=143:sd=2:aac=none:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/143Mi)
% 3.24/1.61 % (3557796)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557796)------------------------------
% 3.24/1.61 % (3557796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557794)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557794)------------------------------
% 3.24/1.61 % (3557794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557795)Refutation not found, incomplete strategy
% 3.24/1.61 % (3557795)------------------------------
% 3.24/1.61 % (3557795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557796)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557796)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557796)Time elapsed: 0.0000 s
% 3.24/1.61 % (3557796)Peak memory usage: 86 MB
% 3.24/1.61 % (3557795)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557794)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557795)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557795)Time elapsed: 0.001 s
% 3.24/1.61 % (3557794)Termination reason: Refutation not found, incomplete strategy
% 3.24/1.61 % (3557794)Time elapsed: 0.001 s
% 3.24/1.61 % (3557795)Peak memory usage: 86 MB
% 3.24/1.61 % (3557794)Peak memory usage: 86 MB
% 3.24/1.61 % (3557797)Instruction limit reached!
% 3.24/1.61 % (3557797)------------------------------
% 3.24/1.61 % (3557797)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.24/1.61 % (3557797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.24/1.61 % (3557797)CaDiCaL version: 2.1.3
% 3.24/1.61 % (3557797)Termination reason: Instruction limit
% 3.24/1.61 % (3557797)Termination phase: Saturation
% 3.24/1.61 % (3557797)Time elapsed: 0.073 s
% 3.24/1.61 % (3557797)Peak memory usage: 88 MB
% 3.24/1.61 % (3557797)Instructions burned: 126 (million)
% 3.24/1.61 % SZS status Satisfiable for theBenchmark
% 3.24/1.61 % SZS output start Saturation.
% See solution above
% 0.18/1.81 % SZS output start Definitions and Model Updates.
% 0.18/1.81 for all inputs,
% 0.18/1.81 define equivalent(X0,X1) := not(or(not(or(not(X0),X1)),not(or(not(X1),X0))))
% 0.18/1.81 for all inputs,
% 0.18/1.81 define and(X0,X1) := not(or(not(X0),not(X1)))
% 0.18/1.81 for all inputs,
% 0.18/1.81 define implies(X0,X1) := or(not(X0),X1)
% 0.18/1.81 % SZS output end Definitions and Model Updates.
% 0.18/1.81 % (3557780)------------------------------
% 0.18/1.81 % (3557780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.81 % (3557780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.81 % (3557780)CaDiCaL version: 2.1.3
% 0.18/1.81 % (3557780)Termination reason: Satisfiable
% 0.18/1.81 % (3557780)Time elapsed: 0.459 s
% 0.18/1.81 % (3557780)Peak memory usage: 131 MB
% 0.18/1.81 % (3557780)Instructions burned: 1220 (million)
% 0.18/1.81 % (3557780)------------------------------
% 0.18/1.81 % (3557780)------------------------------
% 0.18/1.81 % (3557662)Success in time 0.751 s
% 0.18/1.81 % Vampire exiting
%------------------------------------------------------------------------------