TSTP Solution File: SYN352+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN352+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 : n016.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:21 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 3 unt; 0 def)
% Number of atoms : 184 ( 0 equ)
% Maximal formula atoms : 30 ( 9 avg)
% Number of connectives : 230 ( 66 ~; 84 |; 58 &)
% ( 4 <=>; 14 =>; 0 <=; 4 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 37 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(resolution,[],[f49,f42]) ).
fof(f42,plain,
! [X1] : ~ big_f(X1,X1),
inference(duplicate_literal_removal,[],[f38]) ).
fof(f38,plain,
! [X1] :
( ~ big_f(X1,X1)
| ~ big_f(X1,X1) ),
inference(resolution,[],[f36,f19]) ).
fof(f19,plain,
! [X0] :
( big_f(X0,sK2(X0,X0))
| ~ big_f(X0,X0) ),
inference(factoring,[],[f15]) ).
fof(f15,plain,
! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3))
| ~ big_f(X3,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X2,X3] :
( big_f(sK1,sK0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,sK2(X2,X3))
| ~ big_f(X3,sK2(X2,X3)) )
& ( big_f(X2,sK2(X2,X3))
| big_f(X3,sK2(X2,X3)) ) ) )
& ( big_f(sK0,sK2(X2,X3))
| big_f(X2,sK2(X2,X3))
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| big_f(sK0,sK2(X2,X3)) )
& big_f(X3,X2) )
| big_f(sK2(X2,X3),sK2(X2,X3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( big_f(X1,X0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X2,X4)
| big_f(X3,X4) ) ) )
& ( big_f(X0,X4)
| big_f(X2,X4)
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,X4)
| ~ big_f(X0,X4) )
& ( big_f(X3,X4)
| big_f(X0,X4) )
& big_f(X3,X2) )
| big_f(X4,X4) ) )
=> ! [X3,X2] :
? [X4] :
( big_f(sK1,sK0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X2,X4)
| big_f(X3,X4) ) ) )
& ( big_f(sK0,X4)
| big_f(X2,X4)
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,X4)
| ~ big_f(sK0,X4) )
& ( big_f(X3,X4)
| big_f(sK0,X4) )
& big_f(X3,X2) )
| big_f(X4,X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2,X3] :
( ? [X4] :
( big_f(sK1,sK0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X2,X4)
| big_f(X3,X4) ) ) )
& ( big_f(sK0,X4)
| big_f(X2,X4)
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,X4)
| ~ big_f(sK0,X4) )
& ( big_f(X3,X4)
| big_f(sK0,X4) )
& big_f(X3,X2) )
| big_f(X4,X4) ) )
=> ( big_f(sK1,sK0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,sK2(X2,X3))
| ~ big_f(X3,sK2(X2,X3)) )
& ( big_f(X2,sK2(X2,X3))
| big_f(X3,sK2(X2,X3)) ) ) )
& ( big_f(sK0,sK2(X2,X3))
| big_f(X2,sK2(X2,X3))
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(sK0,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| big_f(sK0,sK2(X2,X3)) )
& big_f(X3,X2) )
| big_f(sK2(X2,X3),sK2(X2,X3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( big_f(X1,X0)
& ( ~ big_f(X3,X2)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X3,X4) )
& ( big_f(X2,X4)
| big_f(X3,X4) ) ) )
& ( big_f(X0,X4)
| big_f(X2,X4)
| ~ big_f(X3,X2) )
& ( ( ( ~ big_f(X3,X4)
| ~ big_f(X0,X4) )
& ( big_f(X3,X4)
| big_f(X0,X4) )
& big_f(X3,X2) )
| big_f(X4,X4) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( big_f(X0,X1)
& ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(X1,X4)
| big_f(X3,X4)
| ~ big_f(X2,X3) )
& ( ( ( ~ big_f(X2,X4)
| ~ big_f(X1,X4) )
& ( big_f(X2,X4)
| big_f(X1,X4) )
& big_f(X2,X3) )
| big_f(X4,X4) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( big_f(X0,X1)
& ( ~ big_f(X2,X3)
| ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) ) )
& ( big_f(X1,X4)
| big_f(X3,X4)
| ~ big_f(X2,X3) )
& ( ( ( ~ big_f(X2,X4)
| ~ big_f(X1,X4) )
& ( big_f(X2,X4)
| big_f(X1,X4) )
& big_f(X2,X3) )
| big_f(X4,X4) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( big_f(X0,X1)
& ( ~ big_f(X2,X3)
| ( big_f(X2,X4)
<~> big_f(X3,X4) ) )
& ( big_f(X1,X4)
| big_f(X3,X4)
| ~ big_f(X2,X3) )
& ( ( ( big_f(X1,X4)
<~> big_f(X2,X4) )
& big_f(X2,X3) )
| big_f(X4,X4) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X2,X3)
| ( big_f(X2,X4)
<~> big_f(X3,X4) ) )
& ( ( ( big_f(X1,X4)
<~> big_f(X2,X4) )
& big_f(X2,X3) )
| big_f(X4,X4) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( ( big_f(X2,X3)
=> ( big_f(X3,X4)
| big_f(X1,X4) ) )
=> ( ( ( big_f(X2,X3)
=> ( big_f(X1,X4)
<=> big_f(X2,X4) ) )
=> big_f(X4,X4) )
=> ( big_f(X2,X3)
& ( big_f(X2,X4)
<=> big_f(X3,X4) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( ( big_f(X2,X3)
=> ( big_f(X3,X4)
| big_f(X1,X4) ) )
=> ( ( ( big_f(X2,X3)
=> ( big_f(X1,X4)
<=> big_f(X2,X4) ) )
=> big_f(X4,X4) )
=> ( big_f(X2,X3)
& ( big_f(X2,X4)
<=> big_f(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_18_4) ).
fof(f36,plain,
! [X0] :
( ~ big_f(X0,sK2(X0,X0))
| ~ big_f(X0,X0) ),
inference(duplicate_literal_removal,[],[f35]) ).
fof(f35,plain,
! [X0] :
( ~ big_f(X0,sK2(X0,X0))
| ~ big_f(X0,X0)
| ~ big_f(X0,X0) ),
inference(resolution,[],[f19,f16]) ).
fof(f16,plain,
! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3))
| ~ big_f(X3,X2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f49,plain,
! [X4,X5] : big_f(X4,X5),
inference(resolution,[],[f42,f11]) ).
fof(f11,plain,
! [X2,X3] :
( big_f(sK2(X2,X3),sK2(X2,X3))
| big_f(X3,X2) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN352+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % 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.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 22:09:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 % (26545)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.19/0.43 % (26537)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.19/0.43 % (26545)First to succeed.
% 0.19/0.44 % (26537)Also succeeded, but the first one will report.
% 0.19/0.44 % (26545)Refutation found. Thanks to Tanya!
% 0.19/0.44 % SZS status Theorem for theBenchmark
% 0.19/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.44 % (26545)------------------------------
% 0.19/0.44 % (26545)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.44 % (26545)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.44 % (26545)Termination reason: Refutation
% 0.19/0.44
% 0.19/0.44 % (26545)Memory used [KB]: 5884
% 0.19/0.44 % (26545)Time elapsed: 0.029 s
% 0.19/0.44 % (26545)Instructions burned: 2 (million)
% 0.19/0.44 % (26545)------------------------------
% 0.19/0.44 % (26545)------------------------------
% 0.19/0.44 % (26522)Success in time 0.104 s
%------------------------------------------------------------------------------