TSTP Solution File: SYN345+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN345+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n023.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 : Wed Aug 31 19:37:37 EDT 2022
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 4 unt; 0 def)
% Number of atoms : 221 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 276 ( 93 ~; 88 |; 55 &)
% ( 9 <=>; 29 =>; 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 : 72 ( 49 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,plain,
$false,
inference(avatar_sat_refutation,[],[f33,f34,f38,f42,f46,f48,f53,f56]) ).
fof(f56,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f55]) ).
fof(f55,plain,
( $false
| ~ spl3_5
| ~ spl3_7 ),
inference(resolution,[],[f45,f37]) ).
fof(f37,plain,
( ! [X2,X3] : big_f(sK1,X2,X3)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl3_5
<=> ! [X2,X3] : big_f(sK1,X2,X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f45,plain,
( ! [X2,X3] : ~ big_f(X2,sK2(X2,X3),sK2(X2,X3))
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl3_7
<=> ! [X2,X3] : ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
fof(f53,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f51,plain,
( $false
| ~ spl3_6 ),
inference(resolution,[],[f41,f17]) ).
fof(f17,plain,
! [X2,X3] : big_f(X2,X3,sK2(X2,X3)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X3] :
( big_f(X2,X3,sK2(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(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( big_f(sK1,X2,X3)
& ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ) )
& ( ( big_f(sK0,sK1,X2)
& ~ big_f(X3,X2,sK2(X2,X3)) )
| big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( big_f(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(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( big_f(X1,X2,X3)
& ~ big_f(X2,X4,X4) ) )
& ( ( big_f(X0,X1,X2)
& ~ big_f(X3,X2,X4) )
| big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1) ) )
=> ! [X3,X2] :
? [X4] :
( big_f(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(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( big_f(sK1,X2,X3)
& ~ big_f(X2,X4,X4) ) )
& ( ( big_f(sK0,sK1,X2)
& ~ big_f(X3,X2,X4) )
| big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2,X3] :
( ? [X4] :
( big_f(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(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( big_f(sK1,X2,X3)
& ~ big_f(X2,X4,X4) ) )
& ( ( big_f(sK0,sK1,X2)
& ~ big_f(X3,X2,X4) )
| big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ) )
=> ( big_f(X2,X3,sK2(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(sK0,sK0,sK1)
| ~ big_f(sK0,sK1,sK1)
| ( big_f(sK1,X2,X3)
& ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ) )
& ( ( big_f(sK0,sK1,X2)
& ~ big_f(X3,X2,sK2(X2,X3)) )
| big_f(sK0,sK1,sK1)
| ~ big_f(sK0,sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( big_f(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(X0,X0,X1)
| ~ big_f(X0,X1,X1)
| ( big_f(X1,X2,X3)
& ~ big_f(X2,X4,X4) ) )
& ( ( big_f(X0,X1,X2)
& ~ big_f(X3,X2,X4) )
| big_f(X0,X1,X1)
| ~ big_f(X0,X0,X1) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( big_f(X3,X2,X4)
& ( ( ( ~ big_f(X1,X0,X0)
| ~ big_f(X1,X1,X0) )
& ( big_f(X1,X0,X0)
| big_f(X1,X1,X0) ) )
| ~ big_f(X0,X0,X3) )
& ( big_f(X1,X1,X0)
| ~ big_f(X1,X0,X0)
| ( big_f(X0,X3,X2)
& ~ big_f(X3,X4,X4) ) )
& ( ( big_f(X1,X0,X3)
& ~ big_f(X2,X3,X4) )
| big_f(X1,X0,X0)
| ~ big_f(X1,X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( big_f(X3,X2,X4)
& ( ( big_f(X1,X1,X0)
<~> big_f(X1,X0,X0) )
| ~ big_f(X0,X0,X3) )
& ( big_f(X1,X1,X0)
| ~ big_f(X1,X0,X0)
| ( big_f(X0,X3,X2)
& ~ big_f(X3,X4,X4) ) )
& ( ( big_f(X1,X0,X3)
& ~ big_f(X2,X3,X4) )
| big_f(X1,X0,X0)
| ~ big_f(X1,X1,X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X1,X1,X0)
<~> big_f(X1,X0,X0) )
| ~ big_f(X0,X0,X3) )
& big_f(X3,X2,X4)
& ( big_f(X1,X1,X0)
| ~ big_f(X1,X0,X0)
| ( big_f(X0,X3,X2)
& ~ big_f(X3,X4,X4) ) )
& ( big_f(X1,X0,X0)
| ~ big_f(X1,X1,X0)
| ( big_f(X1,X0,X3)
& ~ big_f(X2,X3,X4) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X1,X0] :
? [X2,X3] :
! [X4] :
( ( ( big_f(X1,X0,X3)
=> big_f(X2,X3,X4) )
=> ( big_f(X1,X1,X0)
=> big_f(X1,X0,X0) ) )
=> ( ( ( big_f(X0,X3,X2)
=> big_f(X3,X4,X4) )
=> ( big_f(X1,X0,X0)
=> big_f(X1,X1,X0) ) )
=> ( big_f(X3,X2,X4)
=> ( ( big_f(X1,X1,X0)
<=> big_f(X1,X0,X0) )
& big_f(X0,X0,X3) ) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X1,X0] :
? [X3,X2] :
! [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(X1,X1,X2)
& ( big_f(X0,X1,X1)
<=> big_f(X0,X0,X1) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X1,X0] :
? [X3,X2] :
! [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(X1,X1,X2)
& ( big_f(X0,X1,X1)
<=> big_f(X0,X0,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_4) ).
fof(f41,plain,
( ! [X2,X3] : ~ big_f(X3,X2,sK2(X2,X3))
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl3_6
<=> ! [X2,X3] : ~ big_f(X3,X2,sK2(X2,X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f48,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f47]) ).
fof(f47,plain,
( $false
| ~ spl3_4 ),
inference(resolution,[],[f32,f17]) ).
fof(f32,plain,
( ! [X2] : ~ big_f(sK1,sK1,X2)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl3_4
<=> ! [X2] : ~ big_f(sK1,sK1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f46,plain,
( spl3_7
| spl3_2
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f13,f26,f22,f44]) ).
fof(f22,plain,
( spl3_2
<=> big_f(sK0,sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f26,plain,
( spl3_3
<=> big_f(sK0,sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f13,plain,
! [X2,X3] :
( ~ big_f(sK0,sK1,sK1)
| big_f(sK0,sK0,sK1)
| ~ big_f(X2,sK2(X2,X3),sK2(X2,X3)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f42,plain,
( spl3_6
| spl3_3
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f11,f22,f26,f40]) ).
fof(f11,plain,
! [X2,X3] :
( ~ big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| ~ big_f(X3,X2,sK2(X2,X3)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f38,plain,
( ~ spl3_3
| spl3_5
| spl3_2 ),
inference(avatar_split_clause,[],[f14,f22,f36,f26]) ).
fof(f14,plain,
! [X2,X3] :
( big_f(sK0,sK0,sK1)
| big_f(sK1,X2,X3)
| ~ big_f(sK0,sK1,sK1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f34,plain,
( spl3_4
| spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f15,f22,f26,f31]) ).
fof(f15,plain,
! [X2] :
( big_f(sK0,sK0,sK1)
| big_f(sK0,sK1,sK1)
| ~ big_f(sK1,sK1,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f33,plain,
( ~ spl3_3
| spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f16,f22,f31,f26]) ).
fof(f16,plain,
! [X2] :
( ~ big_f(sK0,sK0,sK1)
| ~ big_f(sK1,sK1,X2)
| ~ big_f(sK0,sK1,sK1) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN345+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Aug 30 22:07:34 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.16/0.47 % (24025)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.16/0.47 % (24041)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.16/0.47 % (24040)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.16/0.47 % (24018)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.16/0.47 % (24034)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.16/0.47 % (24041)First to succeed.
% 0.16/0.47 % (24020)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.16/0.48 % (24028)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.16/0.48 % (24024)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.48 % (24041)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (24041)------------------------------
% 0.16/0.48 % (24041)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48 % (24041)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48 % (24041)Termination reason: Refutation
% 0.16/0.48
% 0.16/0.48 % (24041)Memory used [KB]: 5373
% 0.16/0.48 % (24041)Time elapsed: 0.054 s
% 0.16/0.48 % (24041)Instructions burned: 2 (million)
% 0.16/0.48 % (24041)------------------------------
% 0.16/0.48 % (24041)------------------------------
% 0.16/0.48 % (24017)Success in time 0.157 s
%------------------------------------------------------------------------------