TSTP Solution File: SYN082+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN082+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 : n012.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:25:30 EDT 2022
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 1 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 164 ( 66 ~; 63 |; 22 &)
% ( 7 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 44 ( 27 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f26,f30,f34,f37,f44]) ).
fof(f44,plain,
( ~ spl3_1
| ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f43,plain,
( $false
| ~ spl3_1
| ~ spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f41,f16]) ).
fof(f16,plain,
( big_f(sK0,f(sK0))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl3_1
<=> big_f(sK0,f(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f41,plain,
( ~ big_f(sK0,f(sK0))
| ~ spl3_1
| ~ spl3_2
| ~ spl3_4 ),
inference(resolution,[],[f29,f39]) ).
fof(f39,plain,
( big_f(sK1(f(sK0)),f(sK0))
| ~ spl3_1
| ~ spl3_2 ),
inference(resolution,[],[f20,f16]) ).
fof(f20,plain,
( ! [X1] :
( ~ big_f(sK0,X1)
| big_f(sK1(X1),X1) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl3_2
<=> ! [X1] :
( big_f(sK1(X1),X1)
| ~ big_f(sK0,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f29,plain,
( ! [X1] :
( ~ big_f(sK1(X1),f(sK0))
| ~ big_f(sK0,X1) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl3_4
<=> ! [X1] :
( ~ big_f(sK1(X1),f(sK0))
| ~ big_f(sK0,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f37,plain,
( spl3_1
| ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f36,plain,
( $false
| spl3_1
| ~ spl3_3
| ~ spl3_5 ),
inference(subsumption_resolution,[],[f35,f25]) ).
fof(f25,plain,
( big_f(sK0,sK2)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl3_3
<=> big_f(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f35,plain,
( ~ big_f(sK0,sK2)
| spl3_1
| ~ spl3_5 ),
inference(resolution,[],[f33,f17]) ).
fof(f17,plain,
( ~ big_f(sK0,f(sK0))
| spl3_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f33,plain,
( ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,sK2) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl3_5
<=> ! [X4] :
( big_f(X4,f(sK0))
| ~ big_f(X4,sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f34,plain,
( spl3_5
| spl3_1 ),
inference(avatar_split_clause,[],[f11,f15,f32]) ).
fof(f11,plain,
! [X4] :
( big_f(sK0,f(sK0))
| big_f(X4,f(sK0))
| ~ big_f(X4,sK2) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ( ~ big_f(sK0,f(sK0))
| ! [X1] :
( ( big_f(sK1(X1),X1)
& ~ big_f(sK1(X1),f(sK0)) )
| ~ big_f(sK0,X1) ) )
& ( big_f(sK0,f(sK0))
| ( ! [X4] :
( ~ big_f(X4,sK2)
| big_f(X4,f(sK0)) )
& big_f(sK0,sK2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f8,f7,f6]) ).
fof(f6,plain,
( ? [X0] :
( ( ~ big_f(X0,f(X0))
| ! [X1] :
( ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(X0)) )
| ~ big_f(X0,X1) ) )
& ( big_f(X0,f(X0))
| ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| big_f(X4,f(X0)) )
& big_f(X0,X3) ) ) )
=> ( ( ~ big_f(sK0,f(sK0))
| ! [X1] :
( ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(sK0)) )
| ~ big_f(sK0,X1) ) )
& ( big_f(sK0,f(sK0))
| ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| big_f(X4,f(sK0)) )
& big_f(sK0,X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X1] :
( ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(sK0)) )
=> ( big_f(sK1(X1),X1)
& ~ big_f(sK1(X1),f(sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| big_f(X4,f(sK0)) )
& big_f(sK0,X3) )
=> ( ! [X4] :
( ~ big_f(X4,sK2)
| big_f(X4,f(sK0)) )
& big_f(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0] :
( ( ~ big_f(X0,f(X0))
| ! [X1] :
( ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(X0)) )
| ~ big_f(X0,X1) ) )
& ( big_f(X0,f(X0))
| ? [X3] :
( ! [X4] :
( ~ big_f(X4,X3)
| big_f(X4,f(X0)) )
& big_f(X0,X3) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
? [X0] :
( ( ~ big_f(X0,f(X0))
| ! [X1] :
( ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(X0)) )
| ~ big_f(X0,X1) ) )
& ( big_f(X0,f(X0))
| ? [X1] :
( ! [X2] :
( ~ big_f(X2,X1)
| big_f(X2,f(X0)) )
& big_f(X0,X1) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
? [X0] :
( ? [X1] :
( ! [X2] :
( ~ big_f(X2,X1)
| big_f(X2,f(X0)) )
& big_f(X0,X1) )
<~> big_f(X0,f(X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) )
<=> big_f(X0,f(X0)) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0] :
( ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) )
<=> big_f(X0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).
fof(f30,plain,
( ~ spl3_1
| spl3_4 ),
inference(avatar_split_clause,[],[f12,f28,f15]) ).
fof(f12,plain,
! [X1] :
( ~ big_f(sK1(X1),f(sK0))
| ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f26,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f10,f23,f15]) ).
fof(f10,plain,
( big_f(sK0,sK2)
| big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f13,f19,f15]) ).
fof(f13,plain,
! [X1] :
( big_f(sK1(X1),X1)
| ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X1) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN082+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.30 % Computer : n012.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Aug 30 21:28:35 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.46 % (8772)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.15/0.46 % (8762)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.46 % (8763)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.46 % (8762)First to succeed.
% 0.15/0.47 % (8755)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.15/0.47 % (8771)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.15/0.47 % (8772)Also succeeded, but the first one will report.
% 0.15/0.47 % (8754)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.15/0.47 % (8763)Also succeeded, but the first one will report.
% 0.15/0.47 % (8762)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (8762)------------------------------
% 0.15/0.47 % (8762)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.47 % (8762)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.47 % (8762)Termination reason: Refutation
% 0.15/0.47
% 0.15/0.47 % (8762)Memory used [KB]: 5884
% 0.15/0.47 % (8762)Time elapsed: 0.093 s
% 0.15/0.47 % (8762)Instructions burned: 2 (million)
% 0.15/0.47 % (8762)------------------------------
% 0.15/0.47 % (8762)------------------------------
% 0.15/0.47 % (8747)Success in time 0.164 s
%------------------------------------------------------------------------------