%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL190-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 : n005.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:55 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.66s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 27 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 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 : 28 ( 28 !; 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(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,negated_conjecture,
~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
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(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(p,or(q,r))),or(p,or(r,q)))),
inference(definition_unfolding,[],[f9,f6]) ).
fof(f19,plain,
! [X0,X1] : ~ axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f21,plain,
! [X2,X0,X1] : ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f22,plain,
! [X0] :
( theorem(X0)
| axiom(X0) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f24,plain,
! [X0,X1] :
( axiom(or(not(X1),X0))
| ~ theorem(X1)
| theorem(X0) ),
inference(resolution,[],[f15,f22]) ).
fof(f140,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f21,f24]) ).
fof(f168,plain,
~ theorem(or(not(or(q,r)),or(r,q))),
inference(resolution,[],[f140,f16]) ).
fof(f173,plain,
axiom(or(not(or(q,r)),or(r,q))),
inference(resolution,[],[f168,f22]) ).
fof(f188,plain,
$false,
inference(resolution,[],[f173,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL190-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.58 % Computer : n005.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Sun Sep 27 15:25:32 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.62 Running first-order model finding
% 0.12/0.62 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.66 % (4133851)Will run a generic schedule for satisfiability detection.
% 0.15/0.66 % (4133862)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1575917522:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.66 % (4133862) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4133851-4133862"...
% 0.15/0.66 % (4133862)...printing done.
% 0.15/0.66 % (4133857)% WARNING: option uhcvi not known.
% 0.15/0.66 % (4133862)Refutation found. Thanks to Tanya!
% 0.15/0.66 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.66 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.66 % (4133862)------------------------------
% 0.15/0.66 % (4133862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.66 % (4133862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.66 % (4133862)CaDiCaL version: 2.1.3
% 0.15/0.66 % (4133862)Termination reason: Refutation
% 0.15/0.66 % (4133862)Time elapsed: 0.002 s
% 0.15/0.66 % (4133862)Peak memory usage: 11 MB
% 0.15/0.66 % (4133862)Instructions burned: 4 (million)
% 0.15/0.66 % (4133851)Success in time 0.029 s
% 0.15/0.66 % Vampire exiting
%------------------------------------------------------------------------------