%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL299-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:58:19 AM UTC 2026
% Result : Unsatisfiable 0.99s 0.62s
% Output : Refutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 31 unt; 2 def)
% Number of atoms : 90 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 65 ( 33 ~; 30 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',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/Axioms/LCL004-0.ax',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/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(not(implies(not(p),q)),and(not(p),not(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(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q)))))),not(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q))))))),
inference(definition_unfolding,[],[f11,f12,f6,f9]) ).
fof(f20,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f23,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f18,f20]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f22,f18]) ).
fof(f64,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f64,f18]) ).
fof(f72,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f68,f21]) ).
fof(f73,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f68,f22]) ).
fof(f77,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f72,f23]) ).
fof(f87,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f113,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f27,f77]) ).
fof(f138,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f73,f18]) ).
fof(f146,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f87,f18]) ).
fof(f148,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f138,f18]) ).
fof(f155,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f148,f138]) ).
fof(f265,plain,
( ~ theorem(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q))))))
| ~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q)))) ),
inference(resolution,[],[f155,f19]) ).
fof(f268,definition,
( spl0_5
<=> theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q)))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f270,plain,
( ~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q))))
| spl0_5 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f272,definition,
( spl0_6
<=> theorem(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q)))))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f274,plain,
( ~ theorem(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q))))))
| spl0_6 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f275,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f265,f272,f268]) ).
fof(f907,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f146,f18]) ).
fof(f1667,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f907,f113]) ).
fof(f1764,plain,
! [X0,X1] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1667,f27]) ).
fof(f1856,plain,
( ~ theorem(or(not(or(not(not(p)),q)),or(not(not(p)),not(not(q)))))
| spl0_5 ),
inference(resolution,[],[f1764,f270]) ).
fof(f1885,plain,
( ~ theorem(or(not(q),not(not(q))))
| spl0_5 ),
inference(resolution,[],[f1856,f146]) ).
fof(f1895,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f1885,f113]) ).
fof(f1896,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f1895]) ).
fof(f1948,plain,
( ~ theorem(or(not(or(not(not(p)),not(not(q)))),or(not(not(p)),q)))
| spl0_6 ),
inference(resolution,[],[f274,f1764]) ).
fof(f1955,plain,
( ~ theorem(or(not(not(not(q))),q))
| spl0_6 ),
inference(resolution,[],[f1948,f146]) ).
fof(f1968,plain,
( ~ theorem(or(q,not(q)))
| spl0_6 ),
inference(resolution,[],[f1955,f1764]) ).
fof(f1972,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1968,f113]) ).
fof(f1973,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f1972]) ).
cnf(s13,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f275]) ).
cnf(s14,plain,
spl0_5,
inference(sat_conversion,[],[f1896]) ).
cnf(s21,plain,
spl0_6,
inference(sat_conversion,[],[f1973]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s13,s21,s14]) ).
fof(f1974,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL299-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:33:54 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.99/0.62 % (1391586)Will run a generic schedule for satisfiability detection.
% 0.99/0.62 % (1391594)dis+10_1_sil=32000:sp=arity:random_seed=2993752550:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.99/0.62 % (1391592)% WARNING: option uhcvi not known.
% 0.99/0.62 % (1391591)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2433182696_2999 on theBenchmark for (2999ds/0Mi)
% 0.99/0.62 % (1391595)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=91549413:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.99/0.62 % (1391592)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3111557108:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.99/0.62 % (1391593)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2609381389:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.99/0.62 % TRYING [1]
% 0.99/0.62 % TRYING [2]
% 0.99/0.62 % TRYING [3]
% 0.99/0.62 % (1391597)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2202649801:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.99/0.62 % (1391596)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3923186029:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.99/0.62 % TRYING [4]
% 0.99/0.62 % (1391594)Instruction limit reached!
% 0.99/0.62 % (1391594)------------------------------
% 0.99/0.62 % (1391594)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391594)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391594)Termination reason: Instruction limit
% 0.99/0.62 % (1391594)Termination phase: Saturation
% 0.99/0.62 % (1391594)Time elapsed: 0.037 s
% 0.99/0.62 % (1391594)Peak memory usage: 12 MB
% 0.99/0.62 % (1391594)Instructions burned: 106 (million)
% 0.99/0.62 % (1391605)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=888696293:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.99/0.62 % TRYING [1]
% 0.99/0.62 % TRYING [2]
% 0.99/0.62 % TRYING [3]
% 0.99/0.62 % TRYING [4]
% 0.99/0.62 % (1391595)Instruction limit reached!
% 0.99/0.62 % (1391595)------------------------------
% 0.99/0.62 % (1391595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391595)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391595)Termination reason: Instruction limit
% 0.99/0.62 % (1391595)Termination phase: Saturation
% 0.99/0.62 % (1391595)Time elapsed: 0.057 s
% 0.99/0.62 % (1391595)Peak memory usage: 11 MB
% 0.99/0.62 % (1391595)Instructions burned: 118 (million)
% 0.99/0.62 % (1391607)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=735936692:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.99/0.62 % (1391596)Instruction limit reached!
% 0.99/0.62 % (1391596)------------------------------
% 0.99/0.62 % (1391596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391596)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391596)Termination reason: Instruction limit
% 0.99/0.62 % (1391596)Termination phase: Saturation
% 0.99/0.62 % (1391596)Time elapsed: 0.090 s
% 0.99/0.62 % (1391596)Peak memory usage: 14 MB
% 0.99/0.62 % (1391596)Instructions burned: 131 (million)
% 0.99/0.62 % (1391597)Instruction limit reached!
% 0.99/0.62 % (1391597)------------------------------
% 0.99/0.62 % (1391597)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391597)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391597)Termination reason: Instruction limit
% 0.99/0.62 % (1391597)Termination phase: Saturation
% 0.99/0.62 % (1391597)Time elapsed: 0.092 s
% 0.99/0.62 % (1391597)Peak memory usage: 13 MB
% 0.99/0.62 % (1391597)Instructions burned: 159 (million)
% 0.99/0.62 % (1391617)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3519566697:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.99/0.62 % (1391619)ott-21_1_sil=16000:fs=off:random_seed=2997637:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.99/0.62 % (1391617) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1391586-1391617"...
% 0.99/0.62 % (1391617)...printing done.
% 0.99/0.62 % (1391607)Instruction limit reached!
% 0.99/0.62 % (1391607)------------------------------
% 0.99/0.62 % (1391607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391607)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391607)Termination reason: Instruction limit
% 0.99/0.62 % (1391607)Termination phase: Saturation
% 0.99/0.62 % (1391607)Time elapsed: 0.082 s
% 0.99/0.62 % (1391607)Peak memory usage: 13 MB
% 0.99/0.62 % (1391607)Instructions burned: 131 (million)
% 0.99/0.62 % (1391617)Refutation found. Thanks to Tanya!
% 0.99/0.62 % SZS status Unsatisfiable for theBenchmark
% 0.99/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.99/0.62 % (1391617)------------------------------
% 0.99/0.62 % (1391617)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.62 % (1391617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.62 % (1391617)CaDiCaL version: 2.1.3
% 0.99/0.62 % (1391617)Termination reason: Refutation
% 0.99/0.62 % (1391617)Time elapsed: 0.031 s
% 0.99/0.62 % (1391617)Peak memory usage: 13 MB
% 0.99/0.62 % (1391617)Instructions burned: 54 (million)
% 0.99/0.62 % (1391586)Success in time 0.195 s
% 0.99/0.62 % Vampire exiting
%------------------------------------------------------------------------------