%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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 12:01:21 PM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 27 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 47 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5) ).
fof(f3,conjecture,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).
fof(f4,negated_conjecture,
~ ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(ennf_transformation,[],[f4]) ).
fof(f6,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
inference(cnf_transformation,[],[f2]) ).
fof(f9,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f8,f7]) ).
fof(f11,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(implies(X0,X3))
| ~ is_a_theorem(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f10,f7]) ).
fof(f12,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(implies(implies(sK1,sK2),implies(sK0,sK2)),X1)),implies(X2,implies(not(implies(implies(sK1,sK2),implies(sK0,sK2))),not(implies(sK0,sK1))))))
| ~ is_a_theorem(implies(implies(sK0,sK1),X2)) ),
inference(resolution,[],[f11,f9]) ).
fof(f15,plain,
! [X0] :
( ~ is_a_theorem(implies(implies(sK0,sK1),X0))
| ~ is_a_theorem(implies(X0,implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(resolution,[],[f12,f10]) ).
fof(f17,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(sK1,sK2),implies(sK0,sK2))))
| ~ is_a_theorem(implies(implies(X1,implies(X0,X2)),implies(X3,implies(not(X0),not(implies(sK0,sK1))))))
| ~ is_a_theorem(implies(implies(sK0,sK1),X3)) ),
inference(resolution,[],[f15,f11]) ).
fof(f23,plain,
! [X3,X1] :
( ~ is_a_theorem(implies(X1,implies(implies(sK1,sK2),implies(sK0,sK2))))
| ~ is_a_theorem(implies(implies(sK0,sK1),X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(resolution,[],[f17,f10]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(sK0,sK1),X3))
| ~ is_a_theorem(implies(X3,implies(implies(X0,implies(implies(sK0,sK2),X1)),implies(X2,implies(not(implies(sK0,sK2)),not(implies(sK1,sK2)))))))
| ~ is_a_theorem(implies(implies(sK1,sK2),X2)) ),
inference(resolution,[],[f23,f10]) ).
fof(f33,plain,
! [X0] :
( ~ is_a_theorem(implies(implies(sK0,sK1),implies(X0,implies(sK0,sK2))))
| ~ is_a_theorem(implies(implies(sK1,sK2),X0)) ),
inference(resolution,[],[f26,f8]) ).
fof(f36,plain,
! [X0,X1] : ~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(X0,implies(sK2,X1)),implies(sK1,implies(not(sK2),not(sK0)))))),
inference(resolution,[],[f33,f8]) ).
fof(f39,plain,
$false,
inference(resolution,[],[f36,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 % Computer : n009.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 17:10:30 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.44 Running first-order model finding
% 0.14/0.44 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.14/0.48 % (2260717)Will run a generic schedule for satisfiability detection.
% 0.14/0.48 % (2260728)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2741624016:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.14/0.48 % (2260728) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2260717-2260728"...
% 0.14/0.48 % (2260728)...printing done.
% 0.14/0.48 % (2260728)Refutation found. Thanks to Tanya!
% 0.14/0.48 % SZS status Theorem for theBenchmark
% 0.14/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.48 % (2260728)------------------------------
% 0.14/0.48 % (2260728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.48 % (2260728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.48 % (2260728)CaDiCaL version: 2.1.3
% 0.14/0.48 % (2260728)Termination reason: Refutation
% 0.14/0.48 % (2260728)Time elapsed: 0.003 s
% 0.14/0.48 % (2260728)Peak memory usage: 11 MB
% 0.14/0.48 % (2260728)Instructions burned: 4 (million)
% 0.14/0.48 % (2260717)Success in time 0.026 s
% 0.14/0.48 % Vampire exiting
%------------------------------------------------------------------------------