TSTP Solution File: LCL910+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL910+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 07:55:45 EDT 2024
% Result : Satisfiable 0.22s 0.38s
% Output : Saturation 2.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u307,axiom,
is_a_theorem(X1) ).
cnf(u6452,axiom,
( ~ is_a_theorem(not(equiv(X0,X0)))
| is_a_theorem(and(X0,not(X0))) ) ).
cnf(u2179,axiom,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(implies(X0,X1)) ) ).
cnf(u123,axiom,
is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))) ).
cnf(u2649,axiom,
( is_a_theorem(or(X2,not(equiv(X0,X1))))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u1436,axiom,
( ~ is_a_theorem(implies(X0,not(X0)))
| is_a_theorem(not(not(not(not(not(X0)))))) ) ).
cnf(u326,axiom,
( is_a_theorem(implies(or(X0,X1),not(and(not(X1),X2))))
| ~ is_a_theorem(implies(X2,not(X0))) ) ).
cnf(u1811,axiom,
( is_a_theorem(or(X1,implies(X0,X2)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u4010,axiom,
( is_a_theorem(not(and(X0,equiv(X1,X2))))
| ~ is_a_theorem(not(implies(X1,X2))) ) ).
cnf(u3551,axiom,
( is_a_theorem(not(and(not(or(X0,X1)),X2)))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u321,axiom,
( is_a_theorem(or(and(X2,implies(X0,X1)),not(equiv(X0,X1))))
| ~ is_a_theorem(implies(implies(X1,X0),X2)) ) ).
cnf(u1055,axiom,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(not(or(X0,X0)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u2154,axiom,
( ~ is_a_theorem(not(not(X2)))
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X1)) ) ).
cnf(u2231,axiom,
( is_a_theorem(not(and(X0,or(X1,X1))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u432,axiom,
( is_a_theorem(not(not(implies(X0,X1))))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u2213,axiom,
( ~ is_a_theorem(implies(X1,not(X1)))
| is_a_theorem(implies(X0,not(X1))) ) ).
cnf(u4273,axiom,
( is_a_theorem(implies(and(X0,X1),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u113,axiom,
( is_a_theorem(equiv(X0,X0))
| ~ is_a_theorem(implies(X0,X0)) ) ).
cnf(u2166,axiom,
( is_a_theorem(implies(X0,not(X1)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u176,axiom,
not(equiv(X0,X1)) = implies(implies(X0,X1),and(X1,not(X0))) ).
cnf(u166,axiom,
is_a_theorem(implies(or(X2,implies(X0,X1)),or(equiv(X0,X1),implies(implies(X1,X0),X2)))) ).
cnf(u2636,axiom,
( ~ is_a_theorem(not(and(X0,X0)))
| is_a_theorem(or(X1,not(X0))) ) ).
cnf(u1051,axiom,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u928,axiom,
( is_a_theorem(not(and(or(X0,X0),or(X1,X2))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u282,axiom,
( is_a_theorem(not(equiv(X0,X1)))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u2437,axiom,
( is_a_theorem(not(equiv(X0,not(X0))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3668,axiom,
( is_a_theorem(or(not(not(not(and(X0,X1)))),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u74,axiom,
op_equiv ).
cnf(u2096,axiom,
( is_a_theorem(or(not(not(implies(X0,X1))),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3850,axiom,
( is_a_theorem(implies(X1,not(not(or(X0,X2)))))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u304,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(or(X1,X0)) ) ).
cnf(u4072,axiom,
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(implies(X0,X1)) ) ).
cnf(u3779,axiom,
( is_a_theorem(not(and(or(X0,X0),X1)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1723,axiom,
( ~ is_a_theorem(implies(X1,not(X1)))
| is_a_theorem(or(X0,not(not(not(X1))))) ) ).
cnf(u211,axiom,
( ~ is_a_theorem(not(implies(X0,X1)))
| is_a_theorem(and(X0,not(X1))) ) ).
cnf(u1837,axiom,
( is_a_theorem(implies(or(X0,X1),implies(X2,X3)))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u1085,axiom,
( ~ is_a_theorem(or(or(X1,X1),X0))
| is_a_theorem(X0)
| ~ is_a_theorem(not(X1)) ) ).
cnf(u86,axiom,
is_a_theorem(implies(X0,and(X0,X0))) ).
cnf(u68,axiom,
kn3 ).
cnf(u279,axiom,
( ~ is_a_theorem(not(equiv(X0,X0)))
| is_a_theorem(not(implies(X0,X0))) ) ).
cnf(u290,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(not(not(X0))) ) ).
cnf(u1056,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u3549,axiom,
( is_a_theorem(not(and(not(implies(X0,X1)),X2)))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u449,axiom,
( is_a_theorem(or(or(X0,X1),X2))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u3643,axiom,
( is_a_theorem(implies(X1,not(not(not(and(X0,X2))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3778,axiom,
( is_a_theorem(not(equiv(not(X0),X0)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u297,axiom,
( ~ is_a_theorem(not(not(X0)))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u131,axiom,
( is_a_theorem(equiv(not(X0),not(X0)))
| ~ is_a_theorem(or(X0,not(X0))) ) ).
cnf(u2947,axiom,
( is_a_theorem(or(not(equiv(X0,X1)),X2))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u1409,axiom,
( is_a_theorem(not(not(not(not(or(X0,X1))))))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u462,axiom,
( is_a_theorem(implies(implies(X0,X1),not(X2)))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u171,axiom,
( is_a_theorem(implies(implies(X0,X1),or(X1,X2)))
| ~ is_a_theorem(or(X2,X0)) ) ).
cnf(u153,axiom,
( is_a_theorem(or(and(X0,X1),not(and(X1,X2))))
| ~ is_a_theorem(implies(X2,X0)) ) ).
cnf(u143,axiom,
implies(implies(X2,and(X0,not(X1))),X3) = or(and(X2,implies(X0,X1)),X3) ).
cnf(u165,axiom,
is_a_theorem(implies(implies(implies(X0,X1),X2),or(and(X2,X3),implies(X3,and(X0,not(X1)))))) ).
cnf(u1957,axiom,
( ~ is_a_theorem(implies(or(X0,X2),X1))
| is_a_theorem(X1)
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u1103,axiom,
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u1417,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(not(not(not(not(X0))))) ) ).
cnf(u771,axiom,
( ~ is_a_theorem(not(implies(implies(X0,X1),X2)))
| is_a_theorem(implies(X0,X1)) ) ).
cnf(u206,axiom,
( is_a_theorem(or(X0,not(X1)))
| ~ is_a_theorem(implies(X1,X0)) ) ).
cnf(u3209,axiom,
( is_a_theorem(implies(X1,not(implies(X0,X0))))
| ~ is_a_theorem(not(equiv(X0,X0))) ) ).
cnf(u179,axiom,
or(X3,and(X0,implies(X1,X2))) = not(and(not(X3),implies(X0,and(X1,not(X2))))) ).
cnf(u2091,axiom,
( ~ is_a_theorem(or(not(implies(X0,X2)),X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ) ).
cnf(u161,axiom,
is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))) ).
cnf(u91,axiom,
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ) ).
cnf(u73,axiom,
op_implies_and ).
cnf(u2214,axiom,
( is_a_theorem(implies(X0,not(not(not(X1)))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u3030,axiom,
( ~ is_a_theorem(implies(X0,not(X0)))
| is_a_theorem(or(not(not(not(X0))),X1)) ) ).
cnf(u8385,axiom,
X0 = X1 ).
cnf(u103,axiom,
implies(or(X0,X1),X2) = or(and(not(X0),not(X1)),X2) ).
cnf(u2614,axiom,
( is_a_theorem(not(not(not(not(not(or(X0,X0)))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u85,axiom,
equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ).
cnf(u1878,axiom,
( is_a_theorem(or(X2,or(X0,X1)))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u418,axiom,
( ~ is_a_theorem(or(X0,not(not(X0))))
| is_a_theorem(not(not(not(not(X0))))) ) ).
cnf(u254,axiom,
( ~ is_a_theorem(or(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ) ).
cnf(u1099,axiom,
( is_a_theorem(or(X0,and(not(X1),not(X1))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u1825,axiom,
( is_a_theorem(or(X1,not(not(implies(X0,X2)))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u99,axiom,
or(X0,X1) = implies(not(X0),X1) ).
cnf(u447,axiom,
( is_a_theorem(or(implies(X0,X1),X2))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u403,axiom,
( is_a_theorem(implies(implies(X3,X0),or(X0,and(X1,not(X2)))))
| ~ is_a_theorem(implies(implies(X1,X2),X3)) ) ).
cnf(u6719,axiom,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(implies(X0,not(not(X1)))) ) ).
cnf(u6017,axiom,
( is_a_theorem(implies(implies(X0,X0),X1))
| ~ is_a_theorem(not(equiv(X0,X0))) ) ).
cnf(u324,axiom,
( is_a_theorem(or(and(X3,X0),implies(X0,and(X1,not(X2)))))
| ~ is_a_theorem(implies(implies(X1,X2),X3)) ) ).
cnf(u1827,axiom,
( ~ is_a_theorem(implies(implies(X0,X2),X1))
| is_a_theorem(X1)
| ~ is_a_theorem(not(X0)) ) ).
cnf(u111,axiom,
equiv(not(X0),X1) = and(or(X0,X1),implies(X1,not(X0))) ).
cnf(u1407,axiom,
( is_a_theorem(not(not(not(not(not(X0))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u425,axiom,
( is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2217,axiom,
( is_a_theorem(implies(X0,not(or(X1,X1))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u1885,axiom,
( ~ is_a_theorem(or(and(X0,X2),X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ) ).
cnf(u1836,axiom,
( is_a_theorem(implies(implies(X0,X1),implies(X2,X3)))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u2110,axiom,
( is_a_theorem(and(implies(X0,X1),implies(X0,X1)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u6879,axiom,
( ~ is_a_theorem(not(and(X0,X0)))
| is_a_theorem(implies(X1,not(X0))) ) ).
cnf(u1797,axiom,
( is_a_theorem(or(not(and(X0,X1)),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3996,axiom,
( ~ is_a_theorem(not(and(X1,X1)))
| is_a_theorem(not(and(X0,X1))) ) ).
cnf(u156,axiom,
is_a_theorem(implies(implies(implies(X1,X0),X2),or(and(X2,implies(X0,X1)),not(equiv(X0,X1))))) ).
cnf(u903,axiom,
( is_a_theorem(implies(or(X0,X0),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2533,axiom,
( ~ is_a_theorem(not(not(X0)))
| is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X0,X2)) ) ).
cnf(u1241,axiom,
( is_a_theorem(not(or(X0,X0)))
| ~ is_a_theorem(not(and(X0,X0))) ) ).
cnf(u4299,axiom,
( is_a_theorem(implies(equiv(not(X0),X1),X2))
| ~ is_a_theorem(not(or(X0,X1))) ) ).
cnf(u5059,axiom,
( ~ is_a_theorem(or(X2,X1))
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u3881,axiom,
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) ) ).
cnf(u2219,axiom,
( is_a_theorem(implies(X0,or(X1,X2)))
| ~ is_a_theorem(not(not(X1))) ) ).
cnf(u3237,axiom,
( is_a_theorem(implies(X2,not(equiv(X0,X1))))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u164,axiom,
( is_a_theorem(or(and(X0,X1),implies(X1,X2)))
| ~ is_a_theorem(or(X2,X0)) ) ).
cnf(u284,axiom,
( is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2993,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(or(not(not(X0)),X1)) ) ).
cnf(u201,axiom,
is_a_theorem(or(not(X0),X0)) ).
cnf(u178,axiom,
implies(X3,and(X0,implies(X1,X2))) = not(and(X3,implies(X0,and(X1,not(X2))))) ).
cnf(u1480,axiom,
( is_a_theorem(not(not(not(not(not(not(not(X0))))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2906,axiom,
( is_a_theorem(or(X0,not(not(not(or(X1,X1))))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u116,axiom,
is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ).
cnf(u3684,axiom,
( is_a_theorem(or(not(not(not(or(X0,X0)))),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1956,axiom,
( is_a_theorem(not(not(not(not(or(X0,X1))))))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u72,axiom,
op_or ).
cnf(u283,axiom,
( is_a_theorem(not(equiv(not(X0),X1)))
| ~ is_a_theorem(not(or(X0,X1))) ) ).
cnf(u1191,axiom,
( ~ is_a_theorem(implies(X0,or(X1,X1)))
| ~ is_a_theorem(not(X1))
| is_a_theorem(not(X0)) ) ).
cnf(u1696,axiom,
( is_a_theorem(or(X0,not(not(or(X1,X2)))))
| ~ is_a_theorem(or(X1,X2)) ) ).
cnf(u112,axiom,
equiv(X1,not(X0)) = and(implies(X1,not(X0)),or(X0,X1)) ).
cnf(u209,axiom,
is_a_theorem(or(or(X0,X1),and(not(X0),not(X1)))) ).
cnf(u102,axiom,
or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2) ).
cnf(u1865,axiom,
( is_a_theorem(or(X1,not(not(not(and(X0,X2))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u959,axiom,
( is_a_theorem(not(or(X0,X0)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1866,axiom,
( is_a_theorem(not(not(not(not(not(and(X0,X1)))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u4013,axiom,
( is_a_theorem(not(and(X0,and(X1,X2))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u1406,axiom,
( is_a_theorem(not(not(not(not(implies(X0,X1))))))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u1955,axiom,
( is_a_theorem(or(X1,not(not(or(X0,X2)))))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u124,axiom,
( ~ is_a_theorem(equiv(not(X0),X1))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u523,axiom,
is_a_theorem(not(and(and(and(not(X0),not(X1)),X2),or(X0,X1)))) ).
cnf(u98,axiom,
or(X2,and(not(X0),not(X1))) = not(and(not(X2),or(X0,X1))) ).
cnf(u958,axiom,
( is_a_theorem(or(not(or(X0,X0)),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2925,axiom,
( is_a_theorem(or(not(implies(X0,X0)),X1))
| ~ is_a_theorem(not(equiv(X0,X0))) ) ).
cnf(u465,axiom,
( is_a_theorem(or(X2,implies(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u120,axiom,
is_a_theorem(implies(equiv(not(X0),X1),or(X0,X1))) ).
cnf(u173,axiom,
is_a_theorem(implies(or(X2,not(X0)),implies(or(X0,X1),or(X1,X2)))) ).
cnf(u2216,axiom,
( is_a_theorem(implies(X0,not(and(X1,X2))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u488,axiom,
( ~ is_a_theorem(or(X0,not(not(X0))))
| is_a_theorem(or(X1,not(not(X0)))) ) ).
cnf(u3884,axiom,
( is_a_theorem(implies(or(X0,X1),or(X1,X2)))
| ~ is_a_theorem(not(not(X2))) ) ).
cnf(u2182,axiom,
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,X2)) ) ).
cnf(u159,axiom,
is_a_theorem(implies(implies(X2,X0),implies(implies(X0,X1),not(and(not(X1),X2))))) ).
cnf(u1455,axiom,
( is_a_theorem(or(X1,not(not(not(X0)))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3039,axiom,
( is_a_theorem(or(not(not(or(X0,X1))),X2))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u1826,axiom,
( is_a_theorem(not(not(not(not(implies(X0,X1))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u463,axiom,
( is_a_theorem(implies(or(X0,X1),not(X2)))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u2689,axiom,
( is_a_theorem(implies(X2,and(X0,not(X1))))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u71,axiom,
kn1 ).
cnf(u6006,axiom,
( is_a_theorem(or(X0,and(X1,not(X1))))
| ~ is_a_theorem(not(equiv(X1,X1))) ) ).
cnf(u3714,axiom,
( is_a_theorem(implies(X1,not(not(not(or(X0,X0))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u4044,axiom,
( is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u1796,axiom,
( is_a_theorem(or(X1,not(and(X0,X2))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u222,axiom,
is_a_theorem(implies(implies(X2,not(X0)),implies(or(X0,X1),not(and(not(X1),X2))))) ).
cnf(u3883,axiom,
( is_a_theorem(implies(implies(X0,X1),or(X1,X2)))
| ~ is_a_theorem(not(not(X2))) ) ).
cnf(u1695,axiom,
( is_a_theorem(or(X0,not(not(not(not(not(X1)))))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u93,axiom,
implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))) ).
cnf(u2107,axiom,
( ~ is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(X2))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u67,axiom,
substitution_of_equivalents ).
cnf(u4069,axiom,
( is_a_theorem(not(equiv(X0,X1)))
| ~ is_a_theorem(not(implies(X1,X0))) ) ).
cnf(u786,axiom,
is_a_theorem(implies(implies(implies(X1,X0),implies(X1,X0)),or(equiv(X1,X0),not(equiv(X0,X1))))) ).
cnf(u1999,axiom,
( ~ is_a_theorem(or(X2,X0))
| is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u107,axiom,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(not(X0)) ) ).
cnf(u4249,axiom,
( is_a_theorem(not(and(and(X0,X1),X2)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u89,axiom,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ) ).
cnf(u320,axiom,
( is_a_theorem(or(equiv(X0,X1),not(and(implies(X1,X0),X2))))
| ~ is_a_theorem(implies(X2,implies(X0,X1))) ) ).
cnf(u2959,axiom,
( ~ is_a_theorem(not(and(X0,X0)))
| is_a_theorem(or(not(X0),X1)) ) ).
cnf(u1493,axiom,
( ~ is_a_theorem(or(not(not(X0)),X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ) ).
cnf(u1101,axiom,
( is_a_theorem(or(X0,and(X1,not(X2))))
| ~ is_a_theorem(not(implies(X1,X2))) ) ).
cnf(u1804,axiom,
( is_a_theorem(not(not(or(X0,X1))))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u212,axiom,
( is_a_theorem(and(not(X0),not(X1)))
| ~ is_a_theorem(not(or(X0,X1))) ) ).
cnf(u101,axiom,
implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1))) ).
cnf(u434,axiom,
( is_a_theorem(not(not(or(X0,X1))))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u2215,axiom,
( is_a_theorem(implies(X0,not(not(implies(X1,X2)))))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u115,axiom,
( ~ is_a_theorem(equiv(X0,X1))
| is_a_theorem(implies(X0,X1)) ) ).
cnf(u97,axiom,
or(X2,and(X0,not(X1))) = not(and(not(X2),implies(X0,X1))) ).
cnf(u4298,axiom,
( is_a_theorem(implies(equiv(X0,X1),X2))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u1803,axiom,
( is_a_theorem(not(not(implies(X0,X1))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u248,axiom,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(not(X0))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u2004,axiom,
( ~ is_a_theorem(implies(X1,and(X0,X2)))
| is_a_theorem(not(X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u4030,axiom,
( is_a_theorem(implies(X0,and(X1,not(X1))))
| ~ is_a_theorem(not(equiv(X1,X1))) ) ).
cnf(u331,axiom,
( ~ is_a_theorem(implies(X0,not(X0)))
| is_a_theorem(not(not(not(X0)))) ) ).
cnf(u441,axiom,
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u3512,axiom,
( is_a_theorem(not(and(not(not(X0)),X1)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u343,axiom,
( ~ is_a_theorem(implies(X1,not(X1)))
| is_a_theorem(or(X0,not(X1))) ) ).
cnf(u325,axiom,
( is_a_theorem(implies(implies(X0,X1),not(and(not(X1),X2))))
| ~ is_a_theorem(implies(X2,X0)) ) ).
cnf(u172,axiom,
is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X3),or(X3,and(X0,not(X1)))))) ).
cnf(u2104,axiom,
( is_a_theorem(equiv(X0,X0))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u84,axiom,
or(X0,X1) = not(and(not(X0),not(X1))) ).
cnf(u3169,axiom,
( is_a_theorem(implies(X1,not(not(not(not(not(X0)))))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u288,axiom,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(not(not(X0)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u924,axiom,
( is_a_theorem(not(not(not(or(X0,X0)))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u278,axiom,
( ~ is_a_theorem(not(and(X0,X0)))
| is_a_theorem(not(X0)) ) ).
cnf(u3777,axiom,
( is_a_theorem(not(implies(X1,X0)))
| ~ is_a_theorem(not(X0))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u195,axiom,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X1,X2)) ) ).
cnf(u2642,axiom,
( is_a_theorem(or(X1,not(implies(X0,X0))))
| ~ is_a_theorem(not(equiv(X0,X0))) ) ).
cnf(u70,axiom,
modus_ponens ).
cnf(u180,axiom,
or(and(X0,implies(X1,X2)),X3) = not(and(implies(X0,and(X1,not(X2))),not(X3))) ).
cnf(u4270,axiom,
( is_a_theorem(not(and(equiv(X0,X1),X2)))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u1543,axiom,
( ~ is_a_theorem(not(not(equiv(X0,X1))))
| is_a_theorem(implies(X0,X1)) ) ).
cnf(u2881,axiom,
( is_a_theorem(implies(X2,not(not(or(X0,X1)))))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u217,axiom,
implies(or(X2,and(X0,not(X1))),X3) = or(and(not(X2),implies(X0,X1)),X3) ).
cnf(u2106,axiom,
( is_a_theorem(or(and(X0,X1),not(and(X1,X2))))
| ~ is_a_theorem(not(X2)) ) ).
cnf(u1704,axiom,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(or(X0,not(not(X1)))) ) ).
cnf(u207,axiom,
( ~ is_a_theorem(not(not(X0)))
| is_a_theorem(X0) ) ).
cnf(u92,axiom,
( ~ is_a_theorem(and(X0,X1))
| is_a_theorem(X0) ) ).
cnf(u1496,axiom,
( is_a_theorem(or(not(not(or(X0,X1))),X2))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u4071,axiom,
( is_a_theorem(not(equiv(X0,not(X1))))
| ~ is_a_theorem(not(or(X1,X0))) ) ).
cnf(u923,axiom,
( is_a_theorem(or(X1,not(or(X0,X0))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u296,axiom,
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2844,axiom,
( is_a_theorem(implies(X2,not(not(implies(X0,X1)))))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u106,axiom,
is_a_theorem(or(X0,and(not(X0),not(X0)))) ).
cnf(u88,axiom,
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ) ).
cnf(u1077,axiom,
( ~ is_a_theorem(implies(X1,not(X1)))
| is_a_theorem(X0)
| ~ is_a_theorem(or(X1,X0)) ) ).
cnf(u1764,axiom,
( ~ is_a_theorem(not(and(X0,X0)))
| is_a_theorem(not(not(not(X0)))) ) ).
cnf(u2184,axiom,
( is_a_theorem(implies(X0,or(X1,X2)))
| ~ is_a_theorem(or(X1,X2)) ) ).
cnf(u118,axiom,
is_a_theorem(implies(or(X0,not(X0)),equiv(not(X0),not(X0)))) ).
cnf(u1048,axiom,
( is_a_theorem(implies(or(X0,X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u1931,axiom,
( is_a_theorem(or(or(X0,X1),X2))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u155,axiom,
is_a_theorem(implies(implies(X2,implies(X0,X1)),or(equiv(X0,X1),not(and(implies(X1,X0),X2))))) ).
cnf(u754,axiom,
( ~ is_a_theorem(not(or(X0,X1)))
| is_a_theorem(not(X0)) ) ).
cnf(u3889,axiom,
( is_a_theorem(or(and(X0,X1),implies(X1,X2)))
| ~ is_a_theorem(not(not(X2))) ) ).
cnf(u114,axiom,
is_a_theorem(implies(implies(X0,X0),equiv(X0,X0))) ).
cnf(u3064,axiom,
( is_a_theorem(or(not(not(not(not(not(X0))))),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1766,axiom,
( is_a_theorem(not(not(not(implies(X0,X0)))))
| ~ is_a_theorem(not(equiv(X0,X0))) ) ).
cnf(u1772,axiom,
( is_a_theorem(not(not(not(equiv(X0,X1)))))
| ~ is_a_theorem(not(implies(X0,X1))) ) ).
cnf(u508,axiom,
( ~ is_a_theorem(not(and(X0,or(X1,X2))))
| is_a_theorem(and(not(X1),not(X2)))
| ~ is_a_theorem(X0) ) ).
cnf(u1251,axiom,
( is_a_theorem(not(or(and(X0,X1),and(X0,X1))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1097,axiom,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X2))
| is_a_theorem(or(X0,not(X1))) ) ).
cnf(u2210,axiom,
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u1215,axiom,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X1))
| is_a_theorem(not(not(not(X0)))) ) ).
cnf(u1456,axiom,
( is_a_theorem(or(not(not(not(X0))),X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u464,axiom,
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(or(X1,X2)) ) ).
cnf(u163,axiom,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X0),or(X0,X1)))) ).
cnf(u511,axiom,
is_a_theorem(implies(equiv(X0,and(not(X1),not(X2))),not(and(X0,or(X1,X2))))) ).
cnf(u1494,axiom,
( is_a_theorem(or(not(not(implies(X0,X1))),X2))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u504,axiom,
is_a_theorem(not(and(not(X0),or(X0,X0)))) ).
cnf(u467,axiom,
( is_a_theorem(or(X2,or(X0,X1)))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u804,axiom,
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(not(not(X0)))
| ~ is_a_theorem(implies(X1,X0)) ) ).
cnf(u1774,axiom,
( is_a_theorem(not(not(not(and(X0,X1)))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u5075,axiom,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X2))
| is_a_theorem(implies(X0,not(X1))) ) ).
cnf(u2000,axiom,
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u2309,axiom,
( ~ is_a_theorem(or(X0,not(not(X0))))
| is_a_theorem(implies(X1,not(not(X0)))) ) ).
cnf(u5319,axiom,
( is_a_theorem(and(X1,not(X0)))
| ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u208,axiom,
is_a_theorem(or(implies(X0,X1),and(X0,not(X1)))) ).
cnf(u198,axiom,
( ~ is_a_theorem(implies(and(not(X1),not(X1)),X0))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u87,axiom,
is_a_theorem(implies(and(X0,X1),X0)) ).
cnf(u1671,axiom,
( ~ is_a_theorem(implies(X1,not(not(X0))))
| is_a_theorem(not(X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u69,axiom,
kn2 ).
cnf(u1692,axiom,
( is_a_theorem(or(X0,not(not(implies(X1,X2)))))
| ~ is_a_theorem(implies(X1,X2)) ) ).
cnf(u889,axiom,
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(or(not(X1),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1812,axiom,
( is_a_theorem(or(implies(X0,X1),X2))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u1211,axiom,
( ~ is_a_theorem(or(X1,X0))
| is_a_theorem(not(not(X0)))
| ~ is_a_theorem(not(X1)) ) ).
cnf(u3899,axiom,
( is_a_theorem(and(or(X0,X1),or(X0,X1)))
| ~ is_a_theorem(not(not(X0))) ) ).
cnf(u83,axiom,
implies(X0,X1) = not(and(X0,not(X1))) ).
cnf(u413,axiom,
( is_a_theorem(not(not(not(X0))))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u773,axiom,
( ~ is_a_theorem(not(implies(or(X0,X1),X2)))
| is_a_theorem(or(X0,X1)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL910+1 : TPTP v8.1.2. Released v6.4.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 13:40:48 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (1116)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (1119)WARNING: value z3 for option sas not known
% 0.22/0.37 % (1119)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38 % (1121)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.38 % (1117)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.38 % (1118)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.38 % (1123)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.38 % (1120)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 % (1122)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 Finite Model Found!
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 1120 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.38 % (1120)------------------------------
% 0.22/0.38 % (1120)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 % (1120)Termination reason: Unknown
% 0.22/0.38 % (1120)Termination phase: Finite model building constraint generation
% 0.22/0.38
% 0.22/0.38 % (1120)Memory used [KB]: 873
% 0.22/0.38 % (1120)Time elapsed: 0.004 s
% 0.22/0.38 % (1120)Instructions burned: 4 (million)
% 0.22/0.38 % (1120)------------------------------
% 0.22/0.38 % (1120)------------------------------
% 0.22/0.38 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 TRYING [1]
% 0.22/0.38 Finite Model Found!
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 1117 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.38 % (1117)------------------------------
% 0.22/0.38 % (1117)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 % (1117)Termination reason: Unknown
% 0.22/0.38 % (1117)Termination phase: Finite model building constraint generation
% 0.22/0.38
% 0.22/0.38 % (1117)Memory used [KB]: 930
% 0.22/0.38 % (1117)Time elapsed: 0.006 s
% 0.22/0.38 % (1117)Instructions burned: 9 (million)
% 0.22/0.38 % (1117)------------------------------
% 0.22/0.38 % (1117)------------------------------
% 0.22/0.38 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.38 ???
% 0.22/0.39 % (1126)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.22/0.40 TRYING [1]
% 0.22/0.40 Finite Model Found!
% 0.22/0.40 % SZS status Satisfiable for theBenchmark
% 0.22/0.40 1126 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.40 % (1126)------------------------------
% 0.22/0.40 % (1126)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.40 % (1126)Termination reason: Unknown
% 0.22/0.40 % (1126)Termination phase: Finite model building constraint generation
% 0.22/0.40
% 0.22/0.40 % (1126)Memory used [KB]: 872
% 0.22/0.40 % (1126)Time elapsed: 0.003 s
% 0.22/0.40 % (1126)Instructions burned: 4 (million)
% 0.22/0.40 % (1126)------------------------------
% 0.22/0.40 % (1126)------------------------------
% 0.22/0.40 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.40 % (1127)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.22/0.40 ???
% 0.22/0.40 ???
% 0.22/0.41 % (1134)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 2.33/0.71 % (1119)First to succeed.
% 2.33/0.71 % (1119)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1116"
% 2.33/0.71 % SZS status Satisfiable for theBenchmark
% 2.33/0.71 % (1119)# SZS output start Saturation.
% See solution above
% 2.33/0.71 % (1119)------------------------------
% 2.33/0.71 % (1119)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.33/0.71 % (1119)Termination reason: Satisfiable
% 2.33/0.71
% 2.33/0.71 % (1119)Memory used [KB]: 6876
% 2.33/0.71 % (1119)Time elapsed: 0.337 s
% 2.33/0.71 % (1119)Instructions burned: 778 (million)
% 2.33/0.71 % (1116)Success in time 0.34 s
%------------------------------------------------------------------------------