%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN347+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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 02:07:25 PM UTC 2026
% Result : Theorem 0.10s 0.28s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 5 unt; 5 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 114 ( 49 ~; 50 |; 1 &)
% ( 12 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 40 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<=> big_f(X0,X1) )
| ( big_f(X0,X4)
<=> big_f(X1,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_3) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<=> big_f(X0,X1) )
| ( big_f(X0,X4)
<=> big_f(X1,X4) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
<~> big_f(X0,X1) )
& ( big_f(X0,X4)
<~> big_f(X1,X4) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1)
| big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f5,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1)
| ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f6,plain,
! [X2,X3] :
( big_f(sK0,sK1)
| ~ big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f7,plain,
! [X2,X3] :
( big_f(sK0,sK1)
| big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f8,plain,
! [X2,X3] :
( big_f(sK1,sK2(X2,X3))
| big_f(sK0,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f9,plain,
! [X2,X3] :
( ~ big_f(sK1,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f3]) ).
fof(f11,definition,
( spl3_1
<=> ! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f12,plain,
( ! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f11]) ).
fof(f14,definition,
( spl3_2
<=> big_f(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f17,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f4,f14,f11]) ).
fof(f19,definition,
( spl3_3
<=> ! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f20,plain,
( ! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f21,plain,
( spl3_3
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f5,f14,f19]) ).
fof(f23,definition,
( spl3_4
<=> ! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f24,plain,
( ! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f25,plain,
( spl3_4
| spl3_2 ),
inference(avatar_split_clause,[],[f6,f14,f23]) ).
fof(f27,definition,
( spl3_5
<=> ! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) ) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f28,plain,
( ! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f29,plain,
( spl3_5
| spl3_2 ),
inference(avatar_split_clause,[],[f7,f14,f27]) ).
fof(f31,plain,
( ! [X0] :
( big_f(X0,sK2(X0,sK1))
| big_f(sK0,sK2(X0,sK1)) )
| ~ spl3_4 ),
inference(resolution,[],[f24,f8]) ).
fof(f33,plain,
( ! [X0] :
( ~ big_f(X0,sK2(X0,sK1))
| ~ big_f(sK0,sK2(X0,sK1)) )
| ~ spl3_5 ),
inference(resolution,[],[f28,f9]) ).
fof(f39,plain,
( big_f(sK0,sK2(sK0,sK1))
| ~ spl3_4 ),
inference(factoring,[],[f31]) ).
fof(f50,plain,
( ~ big_f(sK0,sK2(sK0,sK1))
| ~ spl3_4
| ~ spl3_5 ),
inference(resolution,[],[f33,f39]) ).
fof(f51,plain,
( $false
| ~ spl3_4
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f50,f39]) ).
fof(f52,plain,
( ~ spl3_4
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f68,plain,
( ! [X0] : big_f(X0,sK2(X0,X0))
| ~ spl3_1 ),
inference(factoring,[],[f12]) ).
fof(f75,plain,
( ! [X0] : ~ big_f(X0,sK2(X0,X0))
| ~ spl3_1
| ~ spl3_3 ),
inference(resolution,[],[f68,f20]) ).
fof(f76,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(forward_subsumption_resolution,[],[f75,f68]) ).
fof(f77,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f76]) ).
cnf(s1,plain,
( spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f17]) ).
cnf(s2,plain,
( ~ spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f21]) ).
cnf(s3,plain,
( spl3_2
| spl3_4 ),
inference(sat_conversion,[],[f25]) ).
cnf(s4,plain,
( spl3_2
| spl3_5 ),
inference(sat_conversion,[],[f29]) ).
cnf(s5,plain,
( ~ spl3_4
| ~ spl3_5 ),
inference(sat_conversion,[],[f52]) ).
cnf(s9,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(sat_conversion,[],[f77]) ).
cnf(s11,plain,
spl3_2,
inference(rat,[],[s5,s3,s4]) ).
cnf(s12,plain,
spl3_3,
inference(rat,[],[s2,s11]) ).
cnf(s13,plain,
spl3_1,
inference(rat,[],[s1,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s9,s12,s13]) ).
fof(f80,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN347+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n014.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 15:46:16 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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.10/0.28 % (1881343)Will run a generic schedule for satisfiability detection.
% 0.10/0.28 % (1881352)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3988685049:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.28 % (1881352) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1881343-1881352"...
% 0.10/0.28 % (1881352)...printing done.
% 0.10/0.28 % (1881349)% WARNING: option uhcvi not known.
% 0.10/0.28 % (1881352)Refutation found. Thanks to Tanya!
% 0.10/0.28 % SZS status Theorem for theBenchmark
% 0.10/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.28 % (1881352)------------------------------
% 0.10/0.28 % (1881352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.28 % (1881352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.28 % (1881352)CaDiCaL version: 2.1.3
% 0.10/0.28 % (1881352)Termination reason: Refutation
% 0.10/0.28 % (1881352)Time elapsed: 0.002 s
% 0.10/0.28 % (1881352)Peak memory usage: 12 MB
% 0.10/0.28 % (1881352)Instructions burned: 2 (million)
% 0.10/0.28 % (1881343)Success in time 0.039 s
% 0.10/0.28 % Vampire exiting
%------------------------------------------------------------------------------