%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL349-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:03 AM UTC 2026
% Result : Unsatisfiable 17.27s 3.79s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 30
% Syntax : Number of formulae : 148 ( 88 unt; 19 def)
% Number of atoms : 232 ( 34 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 168 ( 84 ~; 80 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 17 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 109 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(or(p,q),or(p,and(not(p),q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(p,q)),or(p,not(or(not(not(p)),not(q)))))),not(or(not(or(p,not(or(not(not(p)),not(q))))),or(p,q)))))),
inference(definition_unfolding,[],[f11,f12,f9]) ).
fof(f20,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(p),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(p) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = not(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
not(sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(q),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(q) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF3,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF3,sF4) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = or(p,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
or(p,sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = or(sF1,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
or(sF1,sF7) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = not(sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
not(sF8) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = not(sF7),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF7) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF10,sF0),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF10,sF0) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = not(sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
not(sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF13 = or(sF9,sF12),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f47,plain,
or(sF9,sF12) = sF13,
inference(reorient_equations,[],[f46]) ).
fof(f48,definition,
sF14 = not(sF13),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f49,plain,
not(sF13) = sF14,
inference(reorient_equations,[],[f48]) ).
fof(f50,plain,
~ theorem(sF14),
inference(definition_folding,[],[f19,f49,f47,f45,f43,f21,f41,f35,f33,f31,f29,f27,f25,f39,f37,f35,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f52,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f17]) ).
fof(f54,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f55,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f76,plain,
! [X0] : theorem(or(not(or(not(q),X0)),or(not(sF0),or(p,X0)))),
inference(superposition,[],[f52,f21]) ).
fof(f81,plain,
! [X0] : theorem(or(not(or(not(q),X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f76,f23]) ).
fof(f84,plain,
! [X0] : theorem(or(not(or(sF4,X0)),or(sF1,or(p,X0)))),
inference(forward_demodulation,[],[f81,f29]) ).
fof(f99,plain,
theorem(or(not(sF7),or(sF6,p))),
inference(superposition,[],[f55,f35]) ).
fof(f100,plain,
theorem(or(sF10,or(sF6,p))),
inference(forward_demodulation,[],[f99,f41]) ).
fof(f104,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f18,f52]) ).
fof(f105,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f18,f55]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f18,f54]) ).
fof(f113,plain,
! [X0] :
( ~ theorem(or(sF9,X0))
| theorem(X0)
| ~ theorem(sF8) ),
inference(superposition,[],[f18,f39]) ).
fof(f124,definition,
( spl15_3
<=> theorem(sF8) ),
introduced(definition,[new_symbols(definition,[spl15_3])],[avatar_definition]) ).
fof(f126,plain,
( ~ theorem(sF8)
| spl15_3 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f128,definition,
( spl15_4
<=> ! [X0] :
( ~ theorem(or(sF9,X0))
| theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl15_4])],[avatar_definition]) ).
fof(f129,plain,
( ! [X0] :
( ~ theorem(or(sF9,X0))
| theorem(X0) )
| ~ spl15_4 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f130,plain,
( ~ spl15_3
| spl15_4 ),
inference(avatar_split_clause,[],[f113,f128,f124]) ).
fof(f195,plain,
theorem(or(not(sF13),or(sF12,sF9))),
inference(superposition,[],[f55,f47]) ).
fof(f197,plain,
theorem(or(sF14,or(sF12,sF9))),
inference(forward_demodulation,[],[f195,f49]) ).
fof(f212,plain,
theorem(or(not(sF5),or(sF4,sF3))),
inference(superposition,[],[f55,f31]) ).
fof(f214,plain,
theorem(or(sF6,or(sF4,sF3))),
inference(forward_demodulation,[],[f212,f33]) ).
fof(f267,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f286,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f308,plain,
theorem(or(not(q),sF0)),
inference(superposition,[],[f267,f21]) ).
fof(f311,plain,
theorem(or(not(sF4),sF5)),
inference(superposition,[],[f267,f31]) ).
fof(f313,plain,
theorem(or(not(sF0),sF11)),
inference(superposition,[],[f267,f43]) ).
fof(f314,plain,
theorem(or(sF1,sF11)),
inference(forward_demodulation,[],[f313,f23]) ).
fof(f316,plain,
theorem(or(sF4,sF0)),
inference(forward_demodulation,[],[f308,f29]) ).
fof(f317,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f286,f18]) ).
fof(f320,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f104,f18]) ).
fof(f345,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f320,f55]) ).
fof(f346,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f320,f104]) ).
fof(f352,plain,
! [X0,X1] :
( ~ theorem(or(sF1,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF0)) ),
inference(superposition,[],[f320,f23]) ).
fof(f353,plain,
! [X0,X1] :
( ~ theorem(or(sF3,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF2)) ),
inference(superposition,[],[f320,f27]) ).
fof(f354,plain,
! [X0,X1] :
( ~ theorem(or(sF6,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF5)) ),
inference(superposition,[],[f320,f33]) ).
fof(f357,plain,
! [X0,X1] :
( ~ theorem(or(sF12,X0))
| theorem(or(X1,X0))
| ~ theorem(or(X1,sF11)) ),
inference(superposition,[],[f320,f45]) ).
fof(f368,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f345,f267]) ).
fof(f404,plain,
theorem(or(sF12,or(sF14,sF9))),
inference(resolution,[],[f197,f106]) ).
fof(f422,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ),
inference(resolution,[],[f346,f54]) ).
fof(f438,plain,
theorem(or(sF12,or(sF9,sF14))),
inference(resolution,[],[f404,f345]) ).
fof(f443,plain,
theorem(or(sF9,or(sF12,sF14))),
inference(resolution,[],[f438,f106]) ).
fof(f453,plain,
theorem(or(not(or(sF4,sF6)),or(sF1,sF7))),
inference(superposition,[],[f84,f35]) ).
fof(f454,plain,
theorem(or(not(or(sF4,sF6)),sF8)),
inference(forward_demodulation,[],[f453,f37]) ).
fof(f456,plain,
! [X0] :
( theorem(or(sF10,or(sF6,X0)))
| ~ theorem(or(not(p),X0)) ),
inference(resolution,[],[f100,f346]) ).
fof(f461,plain,
! [X0] :
( theorem(or(sF10,or(sF6,X0)))
| ~ theorem(or(sF2,X0)) ),
inference(forward_demodulation,[],[f456,f25]) ).
fof(f509,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f422,f18]) ).
fof(f629,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f509,f286]) ).
fof(f638,plain,
! [X0,X1] :
( ~ theorem(or(not(sF11),X0))
| theorem(or(X1,X0))
| ~ theorem(or(sF10,or(X1,sF0))) ),
inference(superposition,[],[f509,f43]) ).
fof(f639,plain,
! [X0,X1] :
( ~ theorem(or(sF10,or(X1,sF0)))
| theorem(or(X1,X0))
| ~ theorem(or(sF12,X0)) ),
inference(forward_demodulation,[],[f638,f45]) ).
fof(f672,plain,
theorem(or(sF4,or(sF6,sF3))),
inference(resolution,[],[f214,f106]) ).
fof(f692,plain,
theorem(or(not(p),sF0)),
inference(superposition,[],[f368,f21]) ).
fof(f693,plain,
theorem(or(not(p),sF7)),
inference(superposition,[],[f368,f35]) ).
fof(f698,plain,
theorem(or(sF2,sF7)),
inference(forward_demodulation,[],[f693,f25]) ).
fof(f699,plain,
theorem(or(sF2,sF0)),
inference(forward_demodulation,[],[f692,f25]) ).
fof(f707,plain,
! [X0] :
( theorem(or(X0,or(sF9,sF14)))
| ~ theorem(or(X0,sF11)) ),
inference(resolution,[],[f357,f438]) ).
fof(f730,plain,
! [X0] :
( theorem(or(sF9,or(X0,sF14)))
| ~ theorem(or(X0,sF11)) ),
inference(resolution,[],[f707,f106]) ).
fof(f921,plain,
theorem(or(sF4,or(sF3,sF6))),
inference(resolution,[],[f672,f345]) ).
fof(f1156,plain,
theorem(or(sF7,sF2)),
inference(resolution,[],[f698,f105]) ).
fof(f1441,plain,
! [X0] :
( ~ theorem(or(sF4,or(X0,sF6)))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f454,f509]) ).
fof(f1495,plain,
theorem(or(sF3,sF8)),
inference(resolution,[],[f1441,f921]) ).
fof(f1510,plain,
! [X0] :
( ~ theorem(or(X0,sF2))
| theorem(or(X0,sF8)) ),
inference(resolution,[],[f1495,f353]) ).
fof(f1776,plain,
( ~ theorem(or(sF7,sF8))
| theorem(sF8) ),
inference(superposition,[],[f629,f37]) ).
fof(f1782,plain,
( ~ theorem(or(sF7,sF8))
| spl15_3 ),
inference(forward_subsumption_resolution,[],[f1776,f126]) ).
fof(f1989,definition,
( spl15_105
<=> theorem(or(sF12,sF14)) ),
introduced(definition,[new_symbols(definition,[spl15_105])],[avatar_definition]) ).
fof(f1991,plain,
( theorem(or(sF12,sF14))
| ~ spl15_105 ),
inference(avatar_component_clause,[],[f1989]) ).
fof(f2003,definition,
( spl15_108
<=> ! [X0] :
( theorem(or(X0,sF14))
| ~ theorem(or(X0,sF11)) ) ),
introduced(definition,[new_symbols(definition,[spl15_108])],[avatar_definition]) ).
fof(f2004,plain,
( ! [X0] :
( ~ theorem(or(X0,sF11))
| theorem(or(X0,sF14)) )
| ~ spl15_108 ),
inference(avatar_component_clause,[],[f2003]) ).
fof(f2323,plain,
theorem(or(sF7,sF8)),
inference(resolution,[],[f1156,f1510]) ).
fof(f2325,plain,
( $false
| spl15_3 ),
inference(forward_subsumption_resolution,[],[f2323,f1782]) ).
fof(f2326,plain,
spl15_3,
inference(avatar_contradiction_clause,[],[f2325]) ).
fof(f2335,plain,
( ! [X0] :
( theorem(or(X0,sF14))
| ~ theorem(or(X0,sF11)) )
| ~ spl15_4 ),
inference(resolution,[],[f129,f730]) ).
fof(f2338,plain,
( theorem(or(sF12,sF14))
| ~ spl15_4 ),
inference(resolution,[],[f129,f443]) ).
fof(f2352,plain,
( spl15_105
| ~ spl15_4 ),
inference(avatar_split_clause,[],[f2338,f128,f1989]) ).
fof(f2353,plain,
( spl15_108
| ~ spl15_4 ),
inference(avatar_split_clause,[],[f2335,f128,f2003]) ).
fof(f2366,plain,
( theorem(or(sF1,sF14))
| ~ spl15_108 ),
inference(resolution,[],[f2004,f314]) ).
fof(f2370,plain,
( ! [X0] :
( ~ theorem(or(X0,sF0))
| theorem(or(X0,sF14)) )
| ~ spl15_108 ),
inference(resolution,[],[f2366,f352]) ).
fof(f2380,plain,
( theorem(or(sF4,sF14))
| ~ spl15_108 ),
inference(resolution,[],[f2370,f316]) ).
fof(f2386,plain,
( theorem(or(sF14,sF4))
| ~ spl15_108 ),
inference(resolution,[],[f2380,f105]) ).
fof(f3467,plain,
! [X0] :
( ~ theorem(or(sF2,sF0))
| theorem(or(sF6,X0))
| ~ theorem(or(sF12,X0)) ),
inference(resolution,[],[f461,f639]) ).
fof(f3490,plain,
! [X0] :
( ~ theorem(or(sF12,X0))
| theorem(or(sF6,X0)) ),
inference(forward_subsumption_resolution,[],[f3467,f699]) ).
fof(f3497,plain,
( theorem(or(sF6,sF14))
| ~ spl15_105 ),
inference(resolution,[],[f3490,f1991]) ).
fof(f3522,plain,
( ! [X0] :
( ~ theorem(or(X0,sF5))
| theorem(or(X0,sF14)) )
| ~ spl15_105 ),
inference(resolution,[],[f3497,f354]) ).
fof(f3545,plain,
( theorem(or(not(sF4),sF14))
| ~ spl15_105 ),
inference(resolution,[],[f3522,f311]) ).
fof(f3575,plain,
( ! [X0] :
( ~ theorem(or(X0,sF4))
| theorem(or(X0,sF14)) )
| ~ spl15_105 ),
inference(resolution,[],[f3545,f320]) ).
fof(f3591,plain,
( theorem(or(sF14,sF14))
| ~ spl15_105
| ~ spl15_108 ),
inference(resolution,[],[f3575,f2386]) ).
fof(f3595,plain,
( theorem(sF14)
| ~ spl15_105
| ~ spl15_108 ),
inference(resolution,[],[f3591,f317]) ).
fof(f3597,plain,
( $false
| ~ spl15_105
| ~ spl15_108 ),
inference(forward_subsumption_resolution,[],[f3595,f50]) ).
fof(f3598,plain,
( ~ spl15_105
| ~ spl15_108 ),
inference(avatar_contradiction_clause,[],[f3597]) ).
cnf(s2,plain,
( ~ spl15_3
| spl15_4 ),
inference(sat_conversion,[],[f130]) ).
cnf(s81,plain,
spl15_3,
inference(sat_conversion,[],[f2326]) ).
cnf(s84,plain,
( ~ spl15_4
| spl15_105 ),
inference(sat_conversion,[],[f2352]) ).
cnf(s85,plain,
( ~ spl15_4
| spl15_108 ),
inference(sat_conversion,[],[f2353]) ).
cnf(s132,plain,
( ~ spl15_105
| ~ spl15_108 ),
inference(sat_conversion,[],[f3598]) ).
cnf(s136,plain,
spl15_4,
inference(rat,[],[s2,s81]) ).
cnf(s138,plain,
spl15_108,
inference(rat,[],[s85,s136]) ).
cnf(s139,plain,
spl15_105,
inference(rat,[],[s84,s136]) ).
cnf(s140,plain,
$false,
inference(rat,[],[s132,s138,s139]) ).
fof(f3599,plain,
$false,
inference(avatar_sat_refutation,[],[s140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL349-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n018.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 27 15:38:08 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.27/3.79 % (2524688)Input is clausal, will run a generic CNF schedule.
% 17.27/3.79 % (2524707)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1161719663:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 17.27/3.79 % (2524702)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=2438960555:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 17.27/3.79 % (2524703)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=936746429:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 17.27/3.79 % (2524704)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2326838729:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 17.27/3.79 % (2524706)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4199230043:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 17.27/3.79 % (2524708)dis-21_1_sil=8000:lcm=predicate:random_seed=2458473752: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)
% 17.27/3.79 % (2524705)lrs+10_1_sil=8000:sp=occurrence:random_seed=2657271274:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 17.27/3.79 % (2524707)Instruction limit reached!
% 17.27/3.79 % (2524707)------------------------------
% 17.27/3.79 % (2524707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524707)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524707)Termination reason: Instruction limit
% 17.27/3.79 % (2524707)Termination phase: Saturation
% 17.27/3.79 % (2524707)Time elapsed: 0.093 s
% 17.27/3.79 % (2524707)Peak memory usage: 89 MB
% 17.27/3.79 % (2524707)Instructions burned: 180 (million)
% 17.27/3.79 % (2524708)Instruction limit reached!
% 17.27/3.79 % (2524708)------------------------------
% 17.27/3.79 % (2524708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524708)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524708)Termination reason: Instruction limit
% 17.27/3.79 % (2524708)Termination phase: Saturation
% 17.27/3.79 % (2524708)Time elapsed: 0.090 s
% 17.27/3.79 % (2524708)Peak memory usage: 87 MB
% 17.27/3.79 % (2524708)Instructions burned: 117 (million)
% 17.27/3.79 % (2524706)Instruction limit reached!
% 17.27/3.79 % (2524706)------------------------------
% 17.27/3.79 % (2524706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524706)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524706)Termination reason: Instruction limit
% 17.27/3.79 % (2524706)Termination phase: Saturation
% 17.27/3.79 % (2524706)Time elapsed: 0.113 s
% 17.27/3.79 % (2524706)Peak memory usage: 88 MB
% 17.27/3.79 % (2524706)Instructions burned: 114 (million)
% 17.27/3.79 % (2524705)Instruction limit reached!
% 17.27/3.79 % (2524705)------------------------------
% 17.27/3.79 % (2524705)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524705)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524705)Termination reason: Instruction limit
% 17.27/3.79 % (2524705)Termination phase: Saturation
% 17.27/3.79 % (2524705)Time elapsed: 0.113 s
% 17.27/3.79 % (2524705)Peak memory usage: 89 MB
% 17.27/3.79 % (2524705)Instructions burned: 107 (million)
% 17.27/3.79 % (2524716)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=1810624277:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 17.27/3.79 % (2524716)Refutation not found, incomplete strategy
% 17.27/3.79 % (2524716)------------------------------
% 17.27/3.79 % (2524716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524716)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524716)Termination reason: Refutation not found, incomplete strategy
% 17.27/3.79 % (2524716)Time elapsed: 0.001 s
% 17.27/3.79 % (2524716)Peak memory usage: 88 MB
% 17.27/3.79 % (2524718)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=900627136:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 17.27/3.79 % (2524717)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2951935680:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 17.27/3.79 % (2524717)Refutation not found, incomplete strategy
% 17.27/3.79 % (2524717)------------------------------
% 17.27/3.79 % (2524717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524717)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524717)Termination reason: Refutation not found, incomplete strategy
% 17.27/3.79 % (2524717)Time elapsed: 0.002 s
% 17.27/3.79 % (2524717)Peak memory usage: 87 MB
% 17.27/3.79 % (2524718)Refutation not found, incomplete strategy
% 17.27/3.79 % (2524718)------------------------------
% 17.27/3.79 % (2524718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524718)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524718)Termination reason: Refutation not found, incomplete strategy
% 17.27/3.79 % (2524718)Time elapsed: 0.002 s
% 17.27/3.79 % (2524718)Peak memory usage: 88 MB
% 17.27/3.79 % (2524718)Instructions burned: 1 (million)
% 17.27/3.79 % (2524719)lrs+10_64_to=lpo:sil=8000:random_seed=3400538887:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 17.27/3.79 % (2524716)------------------------------
% 17.27/3.79 % (2524716)------------------------------
% 17.27/3.79 % (2524719)Instruction limit reached!
% 17.27/3.79 % (2524719)------------------------------
% 17.27/3.79 % (2524719)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524719)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524719)Termination reason: Instruction limit
% 17.27/3.79 % (2524719)Termination phase: Saturation
% 17.27/3.79 % (2524719)Time elapsed: 0.121 s
% 17.27/3.79 % (2524719)Peak memory usage: 89 MB
% 17.27/3.79 % (2524719)Instructions burned: 126 (million)
% 17.27/3.79 % (2524732)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=294138044:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 17.27/3.79 % (2524718)------------------------------
% 17.27/3.79 % (2524718)------------------------------
% 17.27/3.79 % (2524717)------------------------------
% 17.27/3.79 % (2524717)------------------------------
% 17.27/3.79 % (2524733)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=729973849:i=157:gtg=all_2991 on theBenchmark for (2991ds/157Mi)
% 17.27/3.79 % (2524732)Instruction limit reached!
% 17.27/3.79 % (2524732)------------------------------
% 17.27/3.79 % (2524732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524732)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524732)Termination reason: Instruction limit
% 17.27/3.79 % (2524732)Termination phase: Saturation
% 17.27/3.79 % (2524732)Time elapsed: 0.146 s
% 17.27/3.79 % (2524732)Peak memory usage: 90 MB
% 17.27/3.79 % (2524732)Instructions burned: 194 (million)
% 17.27/3.79 % (2524733)Instruction limit reached!
% 17.27/3.79 % (2524733)------------------------------
% 17.27/3.79 % (2524733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524733)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524733)Termination reason: Instruction limit
% 17.27/3.79 % (2524733)Termination phase: Saturation
% 17.27/3.79 % (2524733)Time elapsed: 0.170 s
% 17.27/3.79 % (2524733)Peak memory usage: 91 MB
% 17.27/3.79 % (2524733)Instructions burned: 157 (million)
% 17.27/3.79 % (2524735)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=317751917:i=3394:sd=4:ss=included:sgt=64_2989 on theBenchmark for (2989ds/3394Mi)
% 17.27/3.79 % (2524737)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=2914001259:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2988 on theBenchmark for (2988ds/106Mi)
% 17.27/3.79 % (2524738)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=1826847400:i=107_2988 on theBenchmark for (2988ds/107Mi)
% 17.27/3.79 % (2524738)Refutation not found, incomplete strategy
% 17.27/3.79 % (2524738)------------------------------
% 17.27/3.79 % (2524738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524738)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524738)Termination reason: Refutation not found, incomplete strategy
% 17.27/3.79 % (2524738)Time elapsed: 0.002 s
% 17.27/3.79 % (2524738)Peak memory usage: 87 MB
% 17.27/3.79 % (2524737)Instruction limit reached!
% 17.27/3.79 % (2524737)------------------------------
% 17.27/3.79 % (2524737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524737)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524737)Termination reason: Instruction limit
% 17.27/3.79 % (2524737)Termination phase: Saturation
% 17.27/3.79 % (2524737)Time elapsed: 0.094 s
% 17.27/3.79 % (2524737)Peak memory usage: 88 MB
% 17.27/3.79 % (2524737)Instructions burned: 106 (million)
% 17.27/3.79 % (2524739)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=2846711098:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2986 on theBenchmark for (2986ds/242Mi)
% 17.27/3.79 % (2524738)------------------------------
% 17.27/3.79 % (2524738)------------------------------
% 17.27/3.79 % (2524743)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=373318556:cond=fast:i=5208:av=off_2984 on theBenchmark for (2984ds/5208Mi)
% 17.27/3.79 % (2524739)Instruction limit reached!
% 17.27/3.79 % (2524739)------------------------------
% 17.27/3.79 % (2524739)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524739)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524739)Termination reason: Instruction limit
% 17.27/3.79 % (2524739)Termination phase: Saturation
% 17.27/3.79 % (2524739)Time elapsed: 0.254 s
% 17.27/3.79 % (2524739)Peak memory usage: 91 MB
% 17.27/3.79 % (2524739)Instructions burned: 242 (million)
% 17.27/3.79 % (2524746)lrs+1011_16_sil=32000:erd=off:bce=on:random_seed=3895840774:i=134:sd=2:doe=on:ss=axioms:sgt=14_2982 on theBenchmark for (2982ds/134Mi)
% 17.27/3.79 % (2524702)First to succeed.
% 17.27/3.79 % (2524702)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2524688"
% 17.27/3.79 % (2524747)ott+10_5:4_to=lpo:sil=8000:prc=on:fde=unused:sp=unary_frequency:spb=goal:urr=on:random_seed=3999417223:i=499:bd=all_2981 on theBenchmark for (2981ds/499Mi)
% 17.27/3.79 % (2524746)Instruction limit reached!
% 17.27/3.79 % (2524746)------------------------------
% 17.27/3.79 % (2524746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.27/3.79 % (2524746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.27/3.79 % (2524746)CaDiCaL version: 2.1.3
% 17.27/3.79 % (2524746)Termination reason: Instruction limit
% 17.27/3.79 % (2524746)Termination phase: Saturation
% 17.27/3.79 % (2524746)Time elapsed: 0.132 s
% 17.27/3.79 % (2524746)Peak memory usage: 90 MB
% 17.27/3.79 % (2524746)Instructions burned: 134 (million)
% 17.27/3.79 % (2524750)lrs+10_64_to=lpo:sil=8000:prc=on:sp=reverse_frequency:nwc=5:alpa=false:flr=on:random_seed=1999420387:i=191:fgj=on:bd=all_2977 on theBenchmark for (2977ds/191Mi)
% 17.27/3.79 % (2524702)Refutation found. Thanks to Tanya!
% 17.27/3.79 % SZS status Unsatisfiable for theBenchmark
% 17.27/3.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/4.16 % (2524702)------------------------------
% 0.27/4.16 % (2524702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.27/4.16 % (2524702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/4.16 % (2524702)CaDiCaL version: 2.1.3
% 0.27/4.16 % (2524702)Termination reason: Refutation
% 0.27/4.16 % (2524702)Time elapsed: 1.841 s
% 0.27/4.16 % (2524702)Peak memory usage: 135 MB
% 0.27/4.16 % (2524702)Instructions burned: 1699 (million)
% 0.27/4.16 % (2524702)------------------------------
% 0.27/4.16 % (2524702)------------------------------
% 0.27/4.16 % (2524688)Success in time 2.546 s
% 0.27/4.16 % Vampire exiting
%------------------------------------------------------------------------------