%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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 0.06s 0.41s
% Output : Refutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 52 ( 1 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 67 ( 38 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( theorem(X0)
| ~ axiom(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))),
file('/export/starexec/sandbox2/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(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(X0)
| ~ theorem(or(not(X1),X0))
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
inference(definition_unfolding,[],[f9,f6,f6,f6]) ).
fof(f17,plain,
! [X0] :
( ~ theorem(X0)
| ~ axiom(X0) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f18,plain,
! [X0,X1] :
( theorem(or(not(X1),X0))
| ~ theorem(X0)
| theorem(X1) ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f19,plain,
theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X1),X0)) ),
inference(resolution,[],[f18,f17]) ).
fof(f22,plain,
! [X0,X1] :
( ~ theorem(X0)
| ~ axiom(or(not(X1),X0))
| ~ axiom(X1) ),
inference(resolution,[],[f21,f17]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ theorem(X2)
| ~ axiom(X0)
| ~ axiom(or(not(X0),X1))
| ~ axiom(or(not(X1),X2)) ),
inference(resolution,[],[f22,f21]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( theorem(X2)
| ~ axiom(or(not(X0),X1))
| ~ axiom(or(not(X1),or(not(X2),X3)))
| ~ theorem(X3)
| ~ axiom(X0) ),
inference(resolution,[],[f25,f18]) ).
fof(f104,plain,
! [X2,X3,X0,X1] :
( ~ theorem(X3)
| ~ axiom(or(not(X1),or(not(X2),X3)))
| ~ axiom(or(not(X0),X1))
| ~ axiom(X0)
| ~ axiom(X2) ),
inference(resolution,[],[f33,f17]) ).
fof(f375,plain,
! [X2,X0,X1] :
( ~ axiom(or(not(X2),X0))
| ~ axiom(or(not(X0),or(not(X1),or(not(or(not(q),r)),or(not(or(p,q)),or(r,p))))))
| ~ axiom(X2)
| ~ axiom(X1) ),
inference(resolution,[],[f104,f19]) ).
fof(f601,plain,
! [X0,X1] :
( ~ axiom(or(not(or(not(q),r)),X0))
| ~ axiom(or(not(X1),or(not(X0),or(not(or(p,q)),or(r,p)))))
| ~ axiom(X1) ),
inference(resolution,[],[f375,f14]) ).
fof(f625,plain,
! [X0] :
( ~ axiom(or(not(or(not(q),r)),or(not(or(p,q)),X0)))
| ~ axiom(or(not(X0),or(r,p))) ),
inference(resolution,[],[f601,f14]) ).
fof(f632,plain,
~ axiom(or(not(or(p,r)),or(r,p))),
inference(resolution,[],[f625,f14]) ).
fof(f647,plain,
$false,
inference(resolution,[],[f632,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.34 % Computer : n012.cluster.edu
% 0.06/0.34 % Model : x86_64 x86_64
% 0.06/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.34 % Memory : 8046.5625MB
% 0.06/0.34 % OS : Linux 6.8.0-71-generic
% 0.06/0.34 % CPULimit : 300
% 0.06/0.34 % WCLimit : 300
% 0.06/0.34 % DateTime : Sun Sep 27 15:25:50 UTC 2026
% 0.06/0.34 % CPUTime :
% 0.06/0.34 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.37 Running first-order model finding
% 0.06/0.37 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.41 % (2511543)Will run a generic schedule for satisfiability detection.
% 0.06/0.41 % (2511554)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1746451414:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.06/0.41 % (2511549)% WARNING: option uhcvi not known.
% 0.06/0.41 % (2511550)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2484113797:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.06/0.41 % (2511549)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=351848839:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.06/0.41 % (2511551)dis+10_1_sil=32000:sp=arity:random_seed=2460024457:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.06/0.41 % (2511552)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=162112719:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.06/0.41 % (2511548)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2249684383_3000 on theBenchmark for (3000ds/0Mi)
% 0.06/0.41 % (2511553)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4088471599:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.06/0.41 % TRYING [1]
% 0.06/0.41 % TRYING [2]
% 0.06/0.41 % TRYING [3]
% 0.06/0.41 % (2511554) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2511543-2511554"...
% 0.06/0.41 % (2511554)...printing done.
% 0.06/0.41 % (2511554)Refutation found. Thanks to Tanya!
% 0.06/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.06/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.41 % (2511554)------------------------------
% 0.06/0.41 % (2511554)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.41 % (2511554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.41 % (2511554)CaDiCaL version: 2.1.3
% 0.06/0.41 % (2511554)Termination reason: Refutation
% 0.06/0.41 % (2511554)Time elapsed: 0.018 s
% 0.06/0.41 % (2511554)Peak memory usage: 12 MB
% 0.06/0.41 % (2511554)Instructions burned: 52 (million)
% 0.06/0.41 % (2511543)Success in time 0.032 s
% 0.06/0.41 % Vampire exiting
%------------------------------------------------------------------------------