%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL337-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:52:01 AM UTC 2026
% Result : Unsatisfiable 5.61s 1.88s
% Output : Refutation 5.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 61 ( 24 unt; 2 def)
% Number of atoms : 107 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 94 ( 48 ~; 44 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 9 ( 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 : 82 ( 0 sgn 82 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(implies(p,implies(p,q)),implies(p,q))),
file('/export/starexec/sandbox2/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,
~ theorem(not(or(not(or(not(or(not(p),or(not(p),q))),or(not(p),q))),not(or(not(or(not(p),q)),or(not(p),or(not(p),q))))))),
inference(definition_unfolding,[],[f11,f12,f6,f6,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,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f16,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f17,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f18,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f19,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f21,plain,
! [X0,X1] :
( ~ axiom(or(not(X1),X0))
| ~ theorem(X1)
| theorem(X0) ),
inference(resolution,[],[f19,f7]) ).
fof(f23,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f21,f18]) ).
fof(f24,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f21,f16]) ).
fof(f25,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f21,f15]) ).
fof(f26,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f14,f21]) ).
fof(f30,plain,
! [X0,X1] :
( ~ theorem(or(X0,not(X1)))
| theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f24,f19]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(not(X1),X2)))
| theorem(or(X0,X2))
| ~ theorem(X1) ),
inference(resolution,[],[f25,f19]) ).
fof(f43,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f25,f23]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f26,f19]) ).
fof(f54,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f43,f7]) ).
fof(f59,plain,
! [X2,X0,X1] :
( ~ axiom(or(X0,or(not(X2),X1)))
| ~ theorem(X2)
| theorem(or(X0,X1)) ),
inference(resolution,[],[f42,f7]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X2),X1))
| ~ theorem(or(X0,X2))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f49,f7]) ).
fof(f94,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f54,f17]) ).
fof(f107,plain,
! [X0,X1] :
( theorem(or(not(or(X1,not(X0))),X1))
| ~ theorem(X0) ),
inference(resolution,[],[f59,f16]) ).
fof(f110,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X1),X2)),or(X0,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f59,f14]) ).
fof(f122,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f65,f17]) ).
fof(f123,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f65,f18]) ).
fof(f124,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f65,f16]) ).
fof(f131,plain,
! [X0,X1] :
( theorem(not(or(not(X1),not(X0))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f107,f30]) ).
fof(f415,plain,
! [X0,X1] :
( theorem(or(not(or(not(X1),X0)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f110,f123]) ).
fof(f705,definition,
( spl0_27
<=> theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))) ),
introduced(definition,[new_symbols(definition,[spl0_27])],[avatar_definition]) ).
fof(f706,plain,
( ~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q)))
| spl0_27 ),
inference(avatar_component_clause,[],[f705]) ).
fof(f1646,plain,
( ~ theorem(or(not(or(not(p),q)),or(not(p),or(not(p),q))))
| ~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))) ),
inference(resolution,[],[f131,f13]) ).
fof(f1951,plain,
( ~ theorem(or(or(not(p),q),p))
| spl0_27 ),
inference(resolution,[],[f415,f706]) ).
fof(f2190,plain,
( ~ theorem(or(p,or(not(p),q)))
| spl0_27 ),
inference(resolution,[],[f1951,f24]) ).
fof(f2223,plain,
( ~ theorem(or(p,or(q,not(p))))
| spl0_27 ),
inference(resolution,[],[f2190,f124]) ).
fof(f2440,plain,
( ~ theorem(or(p,not(p)))
| spl0_27 ),
inference(resolution,[],[f2223,f122]) ).
fof(f2516,plain,
( ~ theorem(or(not(p),p))
| spl0_27 ),
inference(resolution,[],[f2440,f24]) ).
fof(f2523,plain,
( $false
| spl0_27 ),
inference(forward_subsumption_resolution,[],[f2516,f94]) ).
fof(f2524,plain,
spl0_27,
inference(avatar_contradiction_clause,[],[f2523]) ).
fof(f2526,definition,
( spl0_85
<=> theorem(or(not(or(not(p),q)),or(not(p),or(not(p),q)))) ),
introduced(definition,[new_symbols(definition,[spl0_85])],[avatar_definition]) ).
fof(f2527,plain,
( ~ theorem(or(not(or(not(p),q)),or(not(p),or(not(p),q))))
| spl0_85 ),
inference(avatar_component_clause,[],[f2526]) ).
fof(f2528,plain,
( ~ spl0_27
| ~ spl0_85 ),
inference(avatar_split_clause,[],[f1646,f2526,f705]) ).
fof(f2588,plain,
( ~ theorem(or(not(or(not(p),q)),or(not(p),q)))
| spl0_85 ),
inference(resolution,[],[f2527,f122]) ).
fof(f2607,plain,
( $false
| spl0_85 ),
inference(forward_subsumption_resolution,[],[f2588,f94]) ).
fof(f2608,plain,
spl0_85,
inference(avatar_contradiction_clause,[],[f2607]) ).
cnf(s195,plain,
spl0_27,
inference(sat_conversion,[],[f2524]) ).
cnf(s196,plain,
( ~ spl0_27
| ~ spl0_85 ),
inference(sat_conversion,[],[f2528]) ).
cnf(s217,plain,
spl0_85,
inference(sat_conversion,[],[f2608]) ).
cnf(s222,plain,
~ spl0_27,
inference(rat,[],[s196,s217]) ).
cnf(s223,plain,
$false,
inference(rat,[],[s195,s222]) ).
fof(f2624,plain,
$false,
inference(avatar_sat_refutation,[],[s223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL337-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n011.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Sun Sep 27 15:35:00 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.47 Running first-order theorem proving
% 0.24/0.47 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.75/1.70 % (2569323)Input is clausal, will run a generic CNF schedule.
% 4.75/1.70 % (2569333)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=176666910:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.75/1.70 % (2569334)dis-21_1_sil=8000:lcm=predicate:random_seed=1593948889: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)
% 4.75/1.70 % (2569332)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3172606432:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.75/1.70 % (2569328)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=1472644438:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.75/1.70 % (2569329)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3517846789:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.75/1.70 % (2569331)lrs+10_1_sil=8000:sp=occurrence:random_seed=802819184:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.75/1.70 % (2569330)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1248315882:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.75/1.70 % (2569332)First to succeed.
% 4.75/1.70 % (2569332)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2569323"
% 4.75/1.70 % (2569334)Instruction limit reached!
% 4.75/1.70 % (2569334)------------------------------
% 4.75/1.70 % (2569334)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.70 % (2569334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.70 % (2569334)CaDiCaL version: 2.1.3
% 4.75/1.70 % (2569334)Termination reason: Instruction limit
% 4.75/1.70 % (2569334)Termination phase: Saturation
% 4.75/1.70 % (2569334)Time elapsed: 0.092 s
% 4.75/1.70 % (2569334)Peak memory usage: 87 MB
% 4.75/1.70 % (2569334)Instructions burned: 117 (million)
% 4.75/1.70 % (2569333)Instruction limit reached!
% 4.75/1.70 % (2569333)------------------------------
% 4.75/1.70 % (2569333)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.70 % (2569333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.70 % (2569333)CaDiCaL version: 2.1.3
% 4.75/1.70 % (2569333)Termination reason: Instruction limit
% 4.75/1.70 % (2569333)Termination phase: Saturation
% 4.75/1.70 % (2569333)Time elapsed: 0.099 s
% 4.75/1.70 % (2569333)Peak memory usage: 89 MB
% 4.75/1.70 % (2569333)Instructions burned: 180 (million)
% 4.75/1.70 % (2569331)Instruction limit reached!
% 4.75/1.70 % (2569331)------------------------------
% 4.75/1.70 % (2569331)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.70 % (2569331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.70 % (2569331)CaDiCaL version: 2.1.3
% 4.75/1.70 % (2569331)Termination reason: Instruction limit
% 4.75/1.70 % (2569331)Termination phase: Saturation
% 4.75/1.70 % (2569331)Time elapsed: 0.114 s
% 4.75/1.70 % (2569331)Peak memory usage: 89 MB
% 4.75/1.70 % (2569331)Instructions burned: 107 (million)
% 4.75/1.70 % (2569343)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=341909377:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 4.75/1.70 % (2569343)Refutation not found, incomplete strategy
% 4.75/1.70 % (2569343)------------------------------
% 4.75/1.70 % (2569343)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.70 % (2569343)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.75/1.70 % (2569343)CaDiCaL version: 2.1.3
% 4.75/1.70 % (2569343)Termination reason: Refutation not found, incomplete strategy
% 4.75/1.70 % (2569343)Time elapsed: 0.001 s
% 4.75/1.70 % (2569343)Peak memory usage: 87 MB
% 4.75/1.70 % (2569342)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=1959286437:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.75/1.70 % (2569342)Refutation not found, incomplete strategy
% 4.75/1.70 % (2569342)------------------------------
% 4.75/1.70 % (2569342)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.75/1.70 % (2569342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.88 % (2569342)CaDiCaL version: 2.1.3
% 5.61/1.88 % (2569342)Termination reason: Refutation not found, incomplete strategy
% 5.61/1.88 % (2569342)Time elapsed: 0.002 s
% 5.61/1.88 % (2569342)Peak memory usage: 88 MB
% 5.61/1.88 % (2569344)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2474389889:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 5.61/1.88 % (2569344)Refutation not found, incomplete strategy
% 5.61/1.88 % (2569344)------------------------------
% 5.61/1.88 % (2569344)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.88 % (2569344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.88 % (2569344)CaDiCaL version: 2.1.3
% 5.61/1.88 % (2569344)Termination reason: Refutation not found, incomplete strategy
% 5.61/1.88 % (2569344)Time elapsed: 0.001 s
% 5.61/1.88 % (2569344)Peak memory usage: 88 MB
% 5.61/1.88 % (2569332)Refutation found. Thanks to Tanya!
% 5.61/1.88 % SZS status Unsatisfiable for theBenchmark
% 5.61/1.88 % SZS output start Proof for theBenchmark
% See solution above
% 5.61/1.88 % (2569332)------------------------------
% 5.61/1.88 % (2569332)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.88 % (2569332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.88 % (2569332)CaDiCaL version: 2.1.3
% 5.61/1.88 % (2569332)Termination reason: Refutation
% 5.61/1.88 % (2569332)Time elapsed: 0.081 s
% 5.61/1.88 % (2569332)Peak memory usage: 90 MB
% 5.61/1.88 % (2569332)Instructions burned: 87 (million)
% 5.61/1.88 % (2569332)------------------------------
% 5.61/1.88 % (2569332)------------------------------
% 5.61/1.88 % (2569323)Success in time 0.698 s
% 5.61/1.88 % Vampire exiting
%------------------------------------------------------------------------------