%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL130-1 : TPTP v9.3.1. Released v1.0.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:44 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.51s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 10 unt; 1 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 23 ~; 17 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_4) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))
| is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))),equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(resolution,[],[f5,f4]) ).
fof(f9,definition,
( spl0_1
<=> ! [X4,X5,X3] : is_a_theorem(equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5)))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f10,plain,
( ! [X3,X4,X5] : is_a_theorem(equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f15,plain,
spl0_1,
inference(avatar_split_clause,[],[f6,f9]) ).
fof(f16,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_1 ),
inference(resolution,[],[f10,f1]) ).
fof(f18,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X1,X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f16,f1]) ).
fof(f19,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X4))
| is_a_theorem(equivalent(X0,X4)) )
| ~ spl0_1 ),
inference(resolution,[],[f18,f2]) ).
fof(f29,plain,
( ! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X0,a)) )
| ~ spl0_1 ),
inference(resolution,[],[f18,f3]) ).
fof(f35,plain,
( ! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(X0,a)) )
| ~ spl0_1 ),
inference(resolution,[],[f29,f16]) ).
fof(f37,plain,
( ! [X0] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f35,f19]) ).
fof(f41,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f37,f2]) ).
fof(f43,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f41]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f15]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f43]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f44,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL130-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41 % Computer : n005.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:23:02 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.46 Running first-order model finding
% 0.15/0.46 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.23/0.51 % (4130154)Will run a generic schedule for satisfiability detection.
% 0.23/0.51 % (4130163)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3901977337:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.51 % (4130163) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4130154-4130163"...
% 0.23/0.51 % (4130163)...printing done.
% 0.23/0.51 % (4130163)Refutation found. Thanks to Tanya!
% 0.23/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.23/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.51 % (4130163)------------------------------
% 0.23/0.51 % (4130163)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.51 % (4130163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.51 % (4130163)CaDiCaL version: 2.1.3
% 0.23/0.51 % (4130163)Termination reason: Refutation
% 0.23/0.51 % (4130163)Time elapsed: 0.002 s
% 0.23/0.51 % (4130163)Peak memory usage: 12 MB
% 0.23/0.51 % (4130163)Instructions burned: 2 (million)
% 0.23/0.51 % (4130154)Success in time 0.025 s
% 0.23/0.51 % Vampire exiting
%------------------------------------------------------------------------------