%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL126-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:43 AM UTC 2026
% Result : Unsatisfiable 0.25s 0.60s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 10 unt; 3 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 38 ~; 28 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_3) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_4) ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_2) ).
fof(f5,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f5,f1]) ).
fof(f9,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X0,equivalent(X2,X1))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f7,f2]) ).
fof(f17,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f9,f7]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X0))
| is_a_theorem(equivalent(X3,X2)) ),
inference(resolution,[],[f17,f7]) ).
fof(f28,definition,
( spl0_1
<=> ! [X2,X3] :
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X3,X2)) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f29,plain,
( ! [X2,X3] :
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X3,X2)) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f31,definition,
( spl0_2
<=> ! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f32,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f33,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f26,f31,f28]) ).
fof(f44,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))
| ~ is_a_theorem(X0) )
| ~ spl0_2 ),
inference(resolution,[],[f32,f9]) ).
fof(f47,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f44,f5]) ).
fof(f66,definition,
( spl0_3
<=> ! [X2] : ~ is_a_theorem(X2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f67,plain,
( ! [X2] : ~ is_a_theorem(X2)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f74,plain,
( $false
| ~ spl0_3 ),
inference(backward_subsumption_resolution,[],[f3,f67]) ).
fof(f86,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f74]) ).
fof(f89,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f47,f31,f66]) ).
fof(f93,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2)))
| ~ spl0_1 ),
inference(resolution,[],[f29,f3]) ).
fof(f233,plain,
( $false
| ~ spl0_1 ),
inference(backward_subsumption_resolution,[],[f4,f93]) ).
fof(f244,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f233]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f33]) ).
cnf(s4,plain,
~ spl0_3,
inference(sat_conversion,[],[f86]) ).
cnf(s5,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f89]) ).
cnf(s7,plain,
~ spl0_1,
inference(sat_conversion,[],[f244]) ).
cnf(s9,plain,
~ spl0_2,
inference(rat,[],[s5,s4]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s9,s7]) ).
fof(f245,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL126-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.48 % Computer : n016.cluster.edu
% 0.21/0.48 % Model : x86_64 x86_64
% 0.21/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48 % Memory : 8046.5625MB
% 0.21/0.48 % OS : Linux 6.8.0-71-generic
% 0.21/0.48 % CPULimit : 300
% 0.21/0.48 % WCLimit : 300
% 0.21/0.48 % DateTime : Sun Sep 27 15:28:02 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.54 Running first-order model finding
% 0.25/0.54 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.25/0.60 % (2780657)Will run a generic schedule for satisfiability detection.
% 0.25/0.60 % (2780663)% WARNING: option uhcvi not known.
% 0.25/0.60 % (2780663)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1671204451:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.25/0.60 % (2780663) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2780657-2780663"...
% 0.25/0.60 % (2780663)...printing done.
% 0.25/0.60 % (2780663)Refutation found. Thanks to Tanya!
% 0.25/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.25/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.60 % (2780663)------------------------------
% 0.25/0.60 % (2780663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.60 % (2780663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.60 % (2780663)CaDiCaL version: 2.1.3
% 0.25/0.60 % (2780663)Termination reason: Refutation
% 0.25/0.60 % (2780663)Time elapsed: 0.007 s
% 0.25/0.60 % (2780663)Peak memory usage: 12 MB
% 0.25/0.60 % (2780663)Instructions burned: 11 (million)
% 0.25/0.60 % (2780657)Success in time 0.046 s
% 0.25/0.60 % Vampire exiting
%------------------------------------------------------------------------------