%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL194-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 : n011.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:57:56 AM UTC 2026
% Result : Unsatisfiable 2.57s 0.93s
% Output : Refutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 51 ( 42 unt; 8 def)
% Number of atoms : 63 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 40 ( 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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,negated_conjecture,
~ theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,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(f15,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(p,r)))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f17,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f18,plain,
not(q) = sF0,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = or(q,p),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
or(q,p) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF5 = or(p,r),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f28,plain,
or(p,r) = sF5,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF6 = or(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f30,plain,
or(sF4,sF5) = sF6,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF7 = or(sF2,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f32,plain,
or(sF2,sF6) = sF7,
inference(reorient_equations,[],[f31]) ).
fof(f33,plain,
~ theorem(sF7),
inference(definition_folding,[],[f16,f32,f30,f28,f26,f24,f22,f20,f18]) ).
fof(f46,plain,
axiom(or(not(sF3),or(p,q))),
inference(superposition,[],[f12,f24]) ).
fof(f57,plain,
axiom(or(sF4,or(p,q))),
inference(forward_demodulation,[],[f46,f26]) ).
fof(f86,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f107,plain,
! [X0] : axiom(or(not(or(not(X0),r)),or(not(or(p,X0)),sF5))),
inference(superposition,[],[f14,f28]) ).
fof(f109,plain,
! [X0] : axiom(or(not(or(not(X0),sF6)),or(not(or(sF2,X0)),sF7))),
inference(superposition,[],[f14,f32]) ).
fof(f110,plain,
! [X0] : axiom(or(not(or(not(X0),sF5)),or(not(or(sF4,X0)),sF6))),
inference(superposition,[],[f14,f30]) ).
fof(f133,plain,
theorem(or(sF4,or(p,q))),
inference(resolution,[],[f57,f7]) ).
fof(f224,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f86,f15]) ).
fof(f280,plain,
axiom(or(not(or(sF0,r)),or(not(or(p,q)),sF5))),
inference(superposition,[],[f107,f18]) ).
fof(f284,plain,
axiom(or(not(sF1),or(not(or(p,q)),sF5))),
inference(forward_demodulation,[],[f280,f20]) ).
fof(f285,plain,
axiom(or(sF2,or(not(or(p,q)),sF5))),
inference(forward_demodulation,[],[f284,f22]) ).
fof(f295,plain,
! [X0] : theorem(or(not(or(not(X0),sF6)),or(not(or(sF2,X0)),sF7))),
inference(resolution,[],[f109,f7]) ).
fof(f302,plain,
! [X0] : theorem(or(not(or(not(X0),sF5)),or(not(or(sF4,X0)),sF6))),
inference(resolution,[],[f110,f7]) ).
fof(f440,plain,
theorem(or(sF2,or(not(or(p,q)),sF5))),
inference(resolution,[],[f285,f7]) ).
fof(f720,plain,
! [X0] :
( theorem(or(not(or(sF2,X0)),sF7))
| ~ theorem(or(not(X0),sF6)) ),
inference(resolution,[],[f295,f15]) ).
fof(f734,plain,
! [X0] : theorem(or(not(or(sF4,X0)),or(not(or(not(X0),sF5)),sF6))),
inference(resolution,[],[f302,f224]) ).
fof(f1379,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| theorem(sF7)
| ~ theorem(or(sF2,X0)) ),
inference(resolution,[],[f720,f15]) ).
fof(f1383,plain,
! [X0] :
( ~ theorem(or(not(X0),sF6))
| ~ theorem(or(sF2,X0)) ),
inference(forward_subsumption_resolution,[],[f1379,f33]) ).
fof(f1578,plain,
! [X0] :
( theorem(or(not(or(not(X0),sF5)),sF6))
| ~ theorem(or(sF4,X0)) ),
inference(resolution,[],[f734,f15]) ).
fof(f6061,plain,
! [X0] :
( ~ theorem(or(sF2,or(not(X0),sF5)))
| ~ theorem(or(sF4,X0)) ),
inference(resolution,[],[f1578,f1383]) ).
fof(f6443,plain,
~ theorem(or(sF4,or(p,q))),
inference(resolution,[],[f6061,f440]) ).
fof(f6459,plain,
$false,
inference(forward_subsumption_resolution,[],[f6443,f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL194-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n011.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 15:26:16 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.45 Running first-order model finding
% 0.13/0.45 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
% 2.57/0.93 % (2552733)Will run a generic schedule for satisfiability detection.
% 2.57/0.93 % (2552744)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2393271813:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 2.57/0.93 % (2552743)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=714183062:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 2.57/0.93 % (2552739)% WARNING: option uhcvi not known.
% 2.57/0.93 % (2552741)dis+10_1_sil=32000:sp=arity:random_seed=1314972648:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 2.57/0.93 % (2552738)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2106262639_3000 on theBenchmark for (3000ds/0Mi)
% 2.57/0.93 % TRYING [1]
% 2.57/0.93 % TRYING [2]
% 2.57/0.93 % (2552739)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2711900873:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 2.57/0.93 % (2552742)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1473042751:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 2.57/0.93 % TRYING [3]
% 2.57/0.93 % (2552740)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1978850648:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 2.57/0.93 % TRYING [4]
% 2.57/0.93 % (2552744)Instruction limit reached!
% 2.57/0.93 % (2552744)------------------------------
% 2.57/0.93 % (2552744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552744)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552744)Termination reason: Instruction limit
% 2.57/0.93 % (2552744)Termination phase: Saturation
% 2.57/0.93 % (2552744)Time elapsed: 0.076 s
% 2.57/0.93 % (2552744)Peak memory usage: 13 MB
% 2.57/0.93 % (2552744)Instructions burned: 159 (million)
% 2.57/0.93 % (2552741)Instruction limit reached!
% 2.57/0.93 % (2552741)------------------------------
% 2.57/0.93 % (2552741)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552741)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552741)Termination reason: Instruction limit
% 2.57/0.93 % (2552741)Termination phase: Saturation
% 2.57/0.93 % (2552741)Time elapsed: 0.087 s
% 2.57/0.93 % (2552741)Peak memory usage: 12 MB
% 2.57/0.93 % (2552741)Instructions burned: 103 (million)
% 2.57/0.93 % (2552753)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3263307959:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.57/0.93 % TRYING [1]
% 2.57/0.93 % TRYING [2]
% 2.57/0.93 % TRYING [3]
% 2.57/0.93 % (2552743)Instruction limit reached!
% 2.57/0.93 % (2552743)------------------------------
% 2.57/0.93 % (2552743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552743)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552743)Termination reason: Instruction limit
% 2.57/0.93 % (2552743)Termination phase: Saturation
% 2.57/0.93 % (2552743)Time elapsed: 0.098 s
% 2.57/0.93 % (2552743)Peak memory usage: 14 MB
% 2.57/0.93 % (2552743)Instructions burned: 132 (million)
% 2.57/0.93 % (2552742)Instruction limit reached!
% 2.57/0.93 % (2552742)------------------------------
% 2.57/0.93 % (2552742)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552742)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552742)Termination reason: Instruction limit
% 2.57/0.93 % (2552742)Termination phase: Saturation
% 2.57/0.93 % (2552742)Time elapsed: 0.096 s
% 2.57/0.93 % (2552742)Peak memory usage: 11 MB
% 2.57/0.93 % (2552742)Instructions burned: 119 (million)
% 2.57/0.93 % TRYING [4]
% 2.57/0.93 % (2552755)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3315242361:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.57/0.93 % (2552756)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=1319262580:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.57/0.93 % (2552757)ott-21_1_sil=16000:fs=off:random_seed=4251081235:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.57/0.93 % (2552755)Instruction limit reached!
% 2.57/0.93 % (2552755)------------------------------
% 2.57/0.93 % (2552755)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552755)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552755)Termination reason: Instruction limit
% 2.57/0.93 % (2552755)Termination phase: Saturation
% 2.57/0.93 % (2552755)Time elapsed: 0.127 s
% 2.57/0.93 % (2552755)Peak memory usage: 13 MB
% 2.57/0.93 % (2552755)Instructions burned: 131 (million)
% 2.57/0.93 % (2552763)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1398752089:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.57/0.93 % (2552757)Instruction limit reached!
% 2.57/0.93 % (2552757)------------------------------
% 2.57/0.93 % (2552757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552757)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552757)Termination reason: Instruction limit
% 2.57/0.93 % (2552757)Termination phase: Saturation
% 2.57/0.93 % (2552757)Time elapsed: 0.140 s
% 2.57/0.93 % (2552757)Peak memory usage: 13 MB
% 2.57/0.93 % (2552757)Instructions burned: 181 (million)
% 2.57/0.93 % (2552765)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1410847153:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 2.57/0.93 % TRYING [1]
% 2.57/0.93 % TRYING [2]
% 2.57/0.93 % TRYING [3]
% 2.57/0.93 % TRYING [4]
% 2.57/0.93 % (2552753)Instruction limit reached!
% 2.57/0.93 % (2552753)------------------------------
% 2.57/0.93 % (2552753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552753)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552753)Termination reason: Instruction limit
% 2.57/0.93 % (2552753)Termination phase: Finite model building SAT solving
% 2.57/0.93 % (2552753)Time elapsed: 0.267 s
% 2.57/0.93 % (2552753)Peak memory usage: 13 MB
% 2.57/0.93 % (2552753)Instructions burned: 716 (million)
% 2.57/0.93 % (2552767)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2967601757:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.57/0.93 % TRYING [5]
% 2.57/0.93 % TRYING [5]
% 2.57/0.93 % (2552767) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2552733-2552767"...
% 2.57/0.93 % (2552767)...printing done.
% 2.57/0.93 % (2552767)Refutation found. Thanks to Tanya!
% 2.57/0.93 % SZS status Unsatisfiable for theBenchmark
% 2.57/0.93 % SZS output start Proof for theBenchmark
% See solution above
% 2.57/0.93 % (2552767)------------------------------
% 2.57/0.93 % (2552767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.57/0.93 % (2552767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/0.93 % (2552767)CaDiCaL version: 2.1.3
% 2.57/0.93 % (2552767)Termination reason: Refutation
% 2.57/0.93 % (2552767)Time elapsed: 0.070 s
% 2.57/0.93 % (2552767)Peak memory usage: 14 MB
% 2.57/0.93 % (2552767)Instructions burned: 213 (million)
% 2.57/0.93 % (2552733)Success in time 0.469 s
% 2.57/0.93 % Vampire exiting
%------------------------------------------------------------------------------