%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL183-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:53 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 28 unt; 1 def)
% Number of atoms : 61 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 22 ~; 17 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 70 !; 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,negated_conjecture,
~ theorem(implies(implies(not(q),not(p)),implies(p,q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
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(not(q)),not(p))),or(not(p),q))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f17,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f18,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f19,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f20,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f15,f17]) ).
fof(f22,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f26,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f14,f7]) ).
fof(f28,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f19,f15]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f22,f15]) ).
fof(f35,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f26,f15]) ).
fof(f52,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f29,f26]) ).
fof(f53,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f29,f18]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f35,f15]) ).
fof(f64,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f53,f20]) ).
fof(f70,definition,
( spl0_4
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f71,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f98,plain,
spl0_4,
inference(avatar_split_clause,[],[f64,f70]) ).
fof(f108,plain,
( ! [X0] : theorem(or(X0,not(X0)))
| ~ spl0_4 ),
inference(resolution,[],[f71,f28]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f56,f19]) ).
fof(f155,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f52,f15]) ).
fof(f452,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X1),X2)),or(X2,X0)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f155,f120]) ).
fof(f2868,plain,
~ theorem(or(q,not(q))),
inference(resolution,[],[f452,f16]) ).
fof(f2886,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f2868,f108]) ).
fof(f2887,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f2886]) ).
cnf(s12,plain,
spl0_4,
inference(sat_conversion,[],[f98]) ).
cnf(s187,plain,
~ spl0_4,
inference(sat_conversion,[],[f2887]) ).
cnf(s213,plain,
$false,
inference(rat,[],[s12,s187]) ).
fof(f2888,plain,
$false,
inference(avatar_sat_refutation,[],[s213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL183-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % 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:25:16 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.15/0.51 % (2550529)Will run a generic schedule for satisfiability detection.
% 0.15/0.51 % (2550535)% WARNING: option uhcvi not known.
% 0.15/0.51 % (2550535)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4042723178:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.51 % (2550534)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=433023863_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.51 % (2550536)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3486358178:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.51 % (2550537)dis+10_1_sil=32000:sp=arity:random_seed=4121972492:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.51 % (2550538)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2244410675:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % (2550539)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2639977480:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.51 % (2550540)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=989315515:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.51 % TRYING [4]
% 0.15/0.51 % (2550537) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2550529-2550537"...
% 0.15/0.51 % (2550538)Instruction limit reached!
% 0.15/0.51 % (2550538)------------------------------
% 0.15/0.51 % (2550538)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (2550538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (2550538)CaDiCaL version: 2.1.3
% 0.15/0.51 % (2550538)Termination reason: Instruction limit
% 0.15/0.51 % (2550538)Termination phase: Saturation
% 0.15/0.51 % (2550538)Time elapsed: 0.054 s
% 0.15/0.51 % (2550538)Peak memory usage: 11 MB
% 0.15/0.51 % (2550538)Instructions burned: 116 (million)
% 0.15/0.51 % (2550537)...printing done.
% 0.15/0.51 % (2550537)Refutation found. Thanks to Tanya!
% 0.15/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.51 % (2550537)------------------------------
% 0.15/0.51 % (2550537)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (2550537)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (2550537)CaDiCaL version: 2.1.3
% 0.15/0.51 % (2550537)Termination reason: Refutation
% 0.15/0.51 % (2550537)Time elapsed: 0.054 s
% 0.15/0.51 % (2550537)Peak memory usage: 12 MB
% 0.15/0.51 % (2550537)Instructions burned: 84 (million)
% 0.15/0.51 % (2550529)Success in time 0.088 s
% 0.15/0.51 % Vampire exiting
%------------------------------------------------------------------------------