%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL341-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 : 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:58:23 AM UTC 2026
% Result : Unsatisfiable 1.28s 0.71s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 26 unt; 3 def)
% Number of atoms : 100 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 84 ( 43 ~; 38 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 69 !; 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] :
( theorem(X0)
| ~ axiom(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(implies(p,equivalent(implies(p,q),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(X0)
| ~ theorem(or(not(X1),X0))
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(or(not(p),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))))),
inference(definition_unfolding,[],[f11,f6,f12,f6]) ).
fof(f20,plain,
! [X0] :
( ~ theorem(X0)
| ~ axiom(X0) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f21,plain,
! [X0,X1] :
( theorem(or(not(X1),X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f22,plain,
theorem(or(not(p),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))))),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f24,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f21,f20]) ).
fof(f25,plain,
! [X0] :
( theorem(or(X0,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f24,f13]) ).
fof(f26,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f24,f15]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f24,f16]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(or(X2,X0)),or(X2,X1)))
| theorem(or(not(X0),X1)) ),
inference(resolution,[],[f24,f17]) ).
fof(f42,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(not(X1),X2)))
| ~ theorem(or(X0,X2))
| theorem(X1) ),
inference(resolution,[],[f27,f21]) ).
fof(f43,plain,
! [X0,X1] :
( theorem(or(X0,or(or(X0,X1),X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f27,f25]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,X1))
| theorem(or(not(X0),X1))
| theorem(or(X2,X0)) ),
inference(resolution,[],[f28,f21]) ).
fof(f101,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(or(X0,X1),X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f43,f20]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ axiom(or(X0,or(not(X2),X1)))
| theorem(X2)
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f42,f20]) ).
fof(f108,plain,
! [X0] :
( theorem(or(not(X0),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q)))))))
| theorem(or(not(p),X0)) ),
inference(resolution,[],[f44,f22]) ).
fof(f116,plain,
! [X0] :
( theorem(or(not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))),not(X0)))
| theorem(or(not(p),X0)) ),
inference(resolution,[],[f108,f26]) ).
fof(f200,plain,
! [X0,X1] :
( ~ theorem(or(not(or(X1,not(X0))),X1))
| theorem(X0) ),
inference(resolution,[],[f106,f15]) ).
fof(f206,definition,
( spl0_9
<=> ! [X1] : ~ theorem(or(not(X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f207,plain,
( ! [X1] : ~ theorem(or(not(X1),X1))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f635,plain,
! [X0] : ~ theorem(or(not(X0),X0)),
inference(resolution,[],[f101,f14]) ).
fof(f636,plain,
spl0_9,
inference(avatar_split_clause,[],[f635,f206]) ).
fof(f1618,plain,
( theorem(or(not(q),or(not(p),q)))
| theorem(or(not(p),or(not(or(not(p),q)),q))) ),
inference(resolution,[],[f200,f116]) ).
fof(f1672,definition,
( spl0_45
<=> theorem(or(not(q),or(not(p),q))) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f1674,plain,
( theorem(or(not(q),or(not(p),q)))
| ~ spl0_45 ),
inference(avatar_component_clause,[],[f1672]) ).
fof(f1693,definition,
( spl0_50
<=> theorem(or(not(p),or(not(or(not(p),q)),q))) ),
introduced(definition,[new_symbols(definition,[spl0_50])],[avatar_definition]) ).
fof(f1695,plain,
( theorem(or(not(p),or(not(or(not(p),q)),q)))
| ~ spl0_50 ),
inference(avatar_component_clause,[],[f1693]) ).
fof(f1696,plain,
( spl0_50
| spl0_45 ),
inference(avatar_split_clause,[],[f1618,f1672,f1693]) ).
fof(f1902,plain,
( ~ axiom(or(not(q),or(not(p),q)))
| ~ spl0_45 ),
inference(resolution,[],[f1674,f20]) ).
fof(f1903,plain,
( $false
| ~ spl0_45 ),
inference(forward_subsumption_resolution,[],[f1902,f14]) ).
fof(f1904,plain,
~ spl0_45,
inference(avatar_contradiction_clause,[],[f1903]) ).
fof(f6740,plain,
( theorem(or(not(or(not(p),q)),or(not(p),q)))
| ~ spl0_50 ),
inference(resolution,[],[f1695,f27]) ).
fof(f6783,plain,
( $false
| ~ spl0_9
| ~ spl0_50 ),
inference(forward_subsumption_resolution,[],[f6740,f207]) ).
fof(f6784,plain,
( ~ spl0_9
| ~ spl0_50 ),
inference(avatar_contradiction_clause,[],[f6783]) ).
cnf(s47,plain,
spl0_9,
inference(sat_conversion,[],[f636]) ).
cnf(s121,plain,
( spl0_45
| spl0_50 ),
inference(sat_conversion,[],[f1696]) ).
cnf(s150,plain,
~ spl0_45,
inference(sat_conversion,[],[f1904]) ).
cnf(s247,plain,
( ~ spl0_9
| ~ spl0_50 ),
inference(sat_conversion,[],[f6784]) ).
cnf(s248,plain,
spl0_50,
inference(rat,[],[s121,s150]) ).
cnf(s249,plain,
~ spl0_9,
inference(rat,[],[s247,s248]) ).
cnf(s256,plain,
$false,
inference(rat,[],[s47,s249]) ).
fof(f6785,plain,
$false,
inference(avatar_sat_refutation,[],[s256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL341-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.12/0.39 % Computer : n020.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:36:35 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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
% 1.28/0.71 % (3551054)Will run a generic schedule for satisfiability detection.
% 1.28/0.71 % (3551060)% WARNING: option uhcvi not known.
% 1.28/0.71 % (3551060)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3828528018:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.28/0.71 % (3551061)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2499617102:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.28/0.71 % (3551062)dis+10_1_sil=32000:sp=arity:random_seed=864100342:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.28/0.71 % (3551063)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3563950930:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.28/0.71 % (3551065)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=83714394:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.28/0.71 % (3551064)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1100995346:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.28/0.71 % (3551059)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1773662679_2999 on theBenchmark for (2999ds/0Mi)
% 1.28/0.71 % TRYING [1]
% 1.28/0.71 % TRYING [2]
% 1.28/0.71 % TRYING [3]
% 1.28/0.71 % TRYING [4]
% 1.28/0.71 % (3551063)Instruction limit reached!
% 1.28/0.71 % (3551063)------------------------------
% 1.28/0.71 % (3551063)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.28/0.71 % (3551063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.28/0.71 % (3551063)CaDiCaL version: 2.1.3
% 1.28/0.71 % (3551063)Termination reason: Instruction limit
% 1.28/0.71 % (3551063)Termination phase: Saturation
% 1.28/0.71 % (3551063)Time elapsed: 0.095 s
% 1.28/0.71 % (3551063)Peak memory usage: 11 MB
% 1.28/0.71 % (3551063)Instructions burned: 116 (million)
% 1.28/0.71 % (3551062)Instruction limit reached!
% 1.28/0.71 % (3551062)------------------------------
% 1.28/0.71 % (3551062)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.28/0.71 % (3551062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.28/0.71 % (3551062)CaDiCaL version: 2.1.3
% 1.28/0.71 % (3551062)Termination reason: Instruction limit
% 1.28/0.71 % (3551062)Termination phase: Saturation
% 1.28/0.71 % (3551062)Time elapsed: 0.104 s
% 1.28/0.71 % (3551062)Peak memory usage: 12 MB
% 1.28/0.71 % (3551062)Instructions burned: 104 (million)
% 1.28/0.71 % (3551074)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=852240885:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.28/0.71 % (3551073)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=428605514:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.28/0.71 % (3551064)Instruction limit reached!
% 1.28/0.71 % (3551064)------------------------------
% 1.28/0.71 % (3551064)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.28/0.71 % (3551064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.28/0.71 % (3551064)CaDiCaL version: 2.1.3
% 1.28/0.71 % (3551064)Termination reason: Instruction limit
% 1.28/0.71 % (3551064)Termination phase: Saturation
% 1.28/0.71 % (3551064)Time elapsed: 0.131 s
% 1.28/0.71 % (3551064)Peak memory usage: 13 MB
% 1.28/0.71 % (3551064)Instructions burned: 131 (million)
% 1.28/0.71 % TRYING [1]
% 1.28/0.71 % TRYING [2]
% 1.28/0.71 % TRYING [3]
% 1.28/0.71 % (3551065)Instruction limit reached!
% 1.28/0.71 % (3551065)------------------------------
% 1.28/0.71 % (3551065)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.28/0.71 % (3551065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.28/0.71 % (3551065)CaDiCaL version: 2.1.3
% 1.28/0.71 % (3551065)Termination reason: Instruction limit
% 1.28/0.71 % (3551065)Termination phase: Saturation
% 1.28/0.71 % (3551065)Time elapsed: 0.143 s
% 1.28/0.71 % (3551065)Peak memory usage: 12 MB
% 1.28/0.71 % (3551065)Instructions burned: 159 (million)
% 1.28/0.71 % TRYING [4]
% 1.28/0.71 % (3551077)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=105240555:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.28/0.71 % (3551078)ott-21_1_sil=16000:fs=off:random_seed=356973001:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.28/0.71 % (3551060) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3551054-3551060"...
% 1.28/0.71 % (3551060)...printing done.
% 1.28/0.71 % (3551060)Refutation found. Thanks to Tanya!
% 1.28/0.71 % SZS status Unsatisfiable for theBenchmark
% 1.28/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 1.28/0.71 % (3551060)------------------------------
% 1.28/0.71 % (3551060)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.28/0.71 % (3551060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.28/0.71 % (3551060)CaDiCaL version: 2.1.3
% 1.28/0.71 % (3551060)Termination reason: Refutation
% 1.28/0.71 % (3551060)Time elapsed: 0.233 s
% 1.28/0.71 % (3551060)Peak memory usage: 15 MB
% 1.28/0.71 % (3551060)Instructions burned: 500 (million)
% 1.28/0.71 % (3551054)Success in time 0.262 s
% 1.28/0.71 % Vampire exiting
%------------------------------------------------------------------------------