TSTP Solution File: SYN345+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN345+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 12:09:47 EDT 2024
% Result : Theorem 0.12s 0.33s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 3 unt; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 245 ( 83 ~; 84 |; 48 &)
% ( 8 <=>; 20 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 41 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,plain,
$false,
inference(avatar_sat_refutation,[],[f27,f31,f35,f39,f40,f43,f46,f48]) ).
fof(f48,plain,
( ~ spl3_4
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f47]) ).
fof(f47,plain,
( $false
| ~ spl3_4
| ~ spl3_6 ),
inference(resolution,[],[f38,f30]) ).
fof(f30,plain,
( ! [X2,X3] : big_f(sK1,X2,X3)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_4
<=> ! [X2,X3] : big_f(sK1,X2,X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f38,plain,
( ! [X2,X3] : ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl3_6
<=> ! [X2,X3] : ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f46,plain,
( ~ spl3_1
| spl3_3 ),
inference(avatar_contradiction_clause,[],[f45]) ).
fof(f45,plain,
( $false
| ~ spl3_1
| spl3_3 ),
inference(resolution,[],[f25,f18]) ).
fof(f18,plain,
( ! [X2] : big_f(sK0,sK1,X2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl3_1
<=> ! [X2] : big_f(sK0,sK1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f25,plain,
( ~ big_f(sK0,sK1,sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl3_3
<=> big_f(sK0,sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f43,plain,
~ spl3_5,
inference(avatar_contradiction_clause,[],[f42]) ).
fof(f42,plain,
( $false
| ~ spl3_5 ),
inference(resolution,[],[f34,f13]) ).
fof(f13,plain,
! [X2,X3] : big_f(X2,X3,sK2(X2,X3)),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X2,X3] :
( ( ( ( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) )
& ( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ) )
| ~ big_f(sK1,sK1,X2) )
& big_f(X2,X3,sK2(X2,X3))
& ( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
& big_f(sK1,X2,X3) ) )
& ( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ( ~ big_f(X3,X2,sK2(X2,X3))
& big_f(sK0,sK1,X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f6,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( ( ~ big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1) )
& ( big_f(X0,X1,X1)
| big_f(X0,X0,X1) ) )
| ~ big_f(X1,X1,X2) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) )
=> ! [X3,X2] :
? [X4] :
( ( ( ( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) )
& ( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ) )
| ~ big_f(sK1,sK1,X2) )
& big_f(X2,X3,X4)
& ( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( ~ big_f(X2,X4,X4)
& big_f(sK1,X2,X3) ) )
& ( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ( ~ big_f(X3,X2,X4)
& big_f(sK0,sK1,X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X2,X3] :
( ? [X4] :
( ( ( ( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) )
& ( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ) )
| ~ big_f(sK1,sK1,X2) )
& big_f(X2,X3,X4)
& ( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( ~ big_f(X2,X4,X4)
& big_f(sK1,X2,X3) ) )
& ( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ( ~ big_f(X3,X2,X4)
& big_f(sK0,sK1,X2) ) ) )
=> ( ( ( ( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) )
& ( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1) ) )
| ~ big_f(sK1,sK1,X2) )
& big_f(X2,X3,sK2(X2,X3))
& ( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
& big_f(sK1,X2,X3) ) )
& ( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ( ~ big_f(X3,X2,sK2(X2,X3))
& big_f(sK0,sK1,X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( ( ~ big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1) )
& ( big_f(X0,X1,X1)
| big_f(X0,X0,X1) ) )
| ~ big_f(X1,X1,X2) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) )
| ~ big_f(X1,X1,X2) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X0,X0,X1)
<~> big_f(X0,X1,X1) )
| ~ big_f(X1,X1,X2) )
& big_f(X2,X3,X4)
& ( big_f(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( ~ big_f(X2,X4,X4)
& big_f(X1,X2,X3) ) )
& ( big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1)
| ( ~ big_f(X3,X2,X4)
& big_f(X0,X1,X2) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) )
& big_f(X1,X1,X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X0,X1,X2)
=> big_f(X3,X2,X4) )
=> ( big_f(X0,X0,X1)
=> big_f(X0,X1,X1) ) )
=> ( ( ( big_f(X1,X2,X3)
=> big_f(X2,X4,X4) )
=> ( big_f(X0,X1,X1)
=> big_f(X0,X0,X1) ) )
=> ( big_f(X2,X3,X4)
=> ( ( big_f(X0,X0,X1)
<=> big_f(X0,X1,X1) )
& big_f(X1,X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_16_4) ).
fof(f34,plain,
( ! [X2] : ~ big_f(sK1,sK1,X2)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl3_5
<=> ! [X2] : ~ big_f(sK1,sK1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f40,plain,
( spl3_5
| ~ spl3_2
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f15,f24,f20,f33]) ).
fof(f20,plain,
( spl3_2
<=> big_f(sK0,sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f15,plain,
! [X2] :
( ~ big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f39,plain,
( spl3_6
| ~ spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f12,f20,f24,f37]) ).
fof(f12,plain,
! [X2,X3] :
( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f35,plain,
( spl3_5
| spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f14,f24,f20,f33]) ).
fof(f14,plain,
! [X2] :
( big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f31,plain,
( spl3_4
| ~ spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f11,f20,f24,f29]) ).
fof(f11,plain,
! [X2,X3] :
( big_f(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| big_f(sK1,X2,X3) ),
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
( spl3_1
| ~ spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f9,f24,f20,f17]) ).
fof(f9,plain,
! [X2] :
( big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,X2) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SYN345+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.31 % Computer : n003.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Fri May 3 17:18:38 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 % (22727)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.33 % (22730)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.12/0.33 % (22731)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.33 % (22730)First to succeed.
% 0.12/0.33 % (22730)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22727"
% 0.12/0.33 TRYING [1]
% 0.12/0.33 TRYING [2]
% 0.12/0.33 % (22730)Refutation found. Thanks to Tanya!
% 0.12/0.33 % SZS status Theorem for theBenchmark
% 0.12/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.33 % (22730)------------------------------
% 0.12/0.33 % (22730)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.33 % (22730)Termination reason: Refutation
% 0.12/0.33
% 0.12/0.33 % (22730)Memory used [KB]: 755
% 0.12/0.33 % (22730)Time elapsed: 0.003 s
% 0.12/0.33 % (22730)Instructions burned: 4 (million)
% 0.12/0.33 % (22727)Success in time 0.011 s
%------------------------------------------------------------------------------