TSTP Solution File: SYN354+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN354+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_uns --cores 0 -t %d %s
% Computer : n009.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:26:22 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 3 unt; 0 def)
% Number of atoms : 202 ( 0 equ)
% Maximal formula atoms : 30 ( 7 avg)
% Number of connectives : 262 ( 87 ~; 91 |; 60 &)
% ( 8 <=>; 14 =>; 0 <=; 2 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 30 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f55,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f41,f52]) ).
fof(f52,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f48]) ).
fof(f48,plain,
( $false
| spl3_3
| ~ spl3_4 ),
inference(unit_resulting_resolution,[],[f45,f16,f33,f33,f15]) ).
fof(f15,plain,
! [X2,X3] :
( ~ big_g(sK0,sK2(X2,X3))
| ~ big_g(X3,sK2(X2,X3))
| ~ big_f(X2,X3)
| big_f(sK0,X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X3] :
( ( ~ big_f(sK0,X2)
| ~ big_f(sK1,X2)
| ~ big_f(X2,X3) )
& big_f(sK1,sK0)
& ( ~ big_f(X2,X3)
| big_f(sK0,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK0,sK2(X2,X3)) ) ) )
& ( big_g(sK0,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& big_g(sK1,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X0,X2)
| ~ big_f(X1,X2)
| ~ big_f(X2,X3) )
& big_f(X1,X0)
& ( ~ big_f(X2,X3)
| big_f(X0,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X0,X4) )
& ( big_g(X3,X4)
| big_g(X0,X4) ) ) )
& ( big_g(X0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X0,X4) )
& big_g(X1,X0) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(sK0,X2)
| ~ big_f(sK1,X2)
| ~ big_f(X2,X3) )
& big_f(sK1,sK0)
& ( ~ big_f(X2,X3)
| big_f(sK0,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK0,X4) )
& ( big_g(X3,X4)
| big_g(sK0,X4) ) ) )
& ( big_g(sK0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK0,X4) )
& big_g(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(sK0,X2)
| ~ big_f(sK1,X2)
| ~ big_f(X2,X3) )
& big_f(sK1,sK0)
& ( ~ big_f(X2,X3)
| big_f(sK0,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(sK0,X4) )
& ( big_g(X3,X4)
| big_g(sK0,X4) ) ) )
& ( big_g(sK0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK0,X4) )
& big_g(sK1,sK0) )
=> ( ( ~ big_f(sK0,X2)
| ~ big_f(sK1,X2)
| ~ big_f(X2,X3) )
& big_f(sK1,sK0)
& ( ~ big_f(X2,X3)
| big_f(sK0,X3)
| ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK0,sK2(X2,X3)) ) ) )
& ( big_g(sK0,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& big_g(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X0,X2)
| ~ big_f(X1,X2)
| ~ big_f(X2,X3) )
& big_f(X1,X0)
& ( ~ big_f(X2,X3)
| big_f(X0,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X0,X4) )
& ( big_g(X3,X4)
| big_g(X0,X4) ) ) )
& ( big_g(X0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X0,X4) )
& big_g(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
? [X1,X0] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X2)
| ~ big_f(X0,X2)
| ~ big_f(X2,X3) )
& big_f(X0,X1)
& ( ~ big_f(X2,X3)
| big_f(X1,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& big_g(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X1,X0] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X2)
| ~ big_f(X0,X2)
| ~ big_f(X2,X3) )
& big_f(X0,X1)
& ( ~ big_f(X2,X3)
| big_f(X1,X3)
| ( ( ~ big_g(X3,X4)
| ~ big_g(X1,X4) )
& ( big_g(X3,X4)
| big_g(X1,X4) ) ) )
& ( big_g(X1,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X1,X4) )
& big_g(X0,X1) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X1,X2)
| ~ big_f(X0,X2)
| ~ big_f(X2,X3) )
& big_f(X0,X1)
& ( ~ big_f(X2,X3)
| big_f(X1,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& big_g(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X1,X2)
| ~ big_f(X0,X2)
| ~ big_f(X2,X3) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X3,X4)
<=> big_g(X1,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X1,X2)
& big_f(X2,X3)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X3,X4)
<=> big_g(X1,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X1,X2)
& big_f(X2,X3)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_20_1) ).
fof(f33,plain,
( big_g(sK0,sK2(sK1,sK0))
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl3_4
<=> big_g(sK0,sK2(sK1,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f16,plain,
big_f(sK1,sK0),
inference(cnf_transformation,[],[f10]) ).
fof(f45,plain,
( ~ big_f(sK0,sK0)
| spl3_3 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_3
<=> big_f(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f41,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f35]) ).
fof(f35,plain,
( $false
| ~ spl3_3 ),
inference(unit_resulting_resolution,[],[f30,f16,f30,f17]) ).
fof(f17,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f30,plain,
( big_f(sK0,sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f34,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f27,f32,f29]) ).
fof(f27,plain,
( big_g(sK0,sK2(sK1,sK0))
| big_f(sK0,sK0) ),
inference(duplicate_literal_removal,[],[f26]) ).
fof(f26,plain,
( big_g(sK0,sK2(sK1,sK0))
| big_g(sK0,sK2(sK1,sK0))
| big_f(sK0,sK0) ),
inference(resolution,[],[f14,f16]) ).
fof(f14,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| big_g(sK0,sK2(X2,X3))
| big_g(X3,sK2(X2,X3))
| big_f(sK0,X3) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN354+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 21:44:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (13861)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.49 % (13869)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.49 % (13852)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.49 % (13853)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49 % (13869)First to succeed.
% 0.20/0.50 % (13849)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.50 % (13865)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.50 % (13853)Also succeeded, but the first one will report.
% 0.20/0.50 % (13869)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (13869)------------------------------
% 0.20/0.50 % (13869)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (13869)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (13869)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (13869)Memory used [KB]: 5884
% 0.20/0.50 % (13869)Time elapsed: 0.081 s
% 0.20/0.50 % (13869)Instructions burned: 2 (million)
% 0.20/0.50 % (13869)------------------------------
% 0.20/0.50 % (13869)------------------------------
% 0.20/0.50 % (13841)Success in time 0.148 s
%------------------------------------------------------------------------------