TSTP Solution File: SYN334+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN334+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 : n014.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:15 EDT 2022
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 3 unt; 0 def)
% Number of atoms : 173 ( 0 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 219 ( 76 ~; 75 |; 40 &)
% ( 13 <=>; 13 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 59 ( 47 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,plain,
$false,
inference(resolution,[],[f45,f44]) ).
fof(f44,plain,
! [X1] : ~ big_f(X1,X1),
inference(subsumption_resolution,[],[f42,f31]) ).
fof(f31,plain,
! [X0] :
( big_g(X0,sK0(X0,X0))
| ~ big_f(X0,X0) ),
inference(duplicate_literal_removal,[],[f30]) ).
fof(f30,plain,
! [X0] :
( ~ big_f(X0,X0)
| ~ big_f(X0,X0)
| big_g(X0,sK0(X0,X0)) ),
inference(resolution,[],[f28,f11]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X0,X1)
| big_g(X1,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( big_f(sK0(X0,X1),sK0(X0,X1))
& ~ big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) )
& ( ( ( big_f(X0,sK0(X0,X1))
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) ) )
| ~ big_f(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
fof(f9,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ big_f(X2,X2)
| big_g(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( big_f(X2,X2)
& ~ big_g(X2,X2) ) )
& ( ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X2,X2)
| big_g(X0,X1) )
& ( ( ( big_f(X0,X2)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ~ big_f(X0,X2) ) )
| ~ big_f(X0,X1) ) )
=> ( ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( big_f(sK0(X0,X1),sK0(X0,X1))
& ~ big_g(sK0(X0,X1),sK0(X0,X1)) ) )
& ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) )
& ( big_g(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) )
& ( ( ( big_f(X0,sK0(X0,X1))
| ~ big_g(X1,sK0(X0,X1)) )
& ( big_g(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) ) )
| ~ big_f(X0,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X2,X2)
| big_g(X2,X2)
| ~ big_f(X0,X1) )
& ( big_f(X0,X1)
| ( big_f(X2,X2)
& ~ big_g(X2,X2) ) )
& ( ~ big_g(X2,X2)
| ~ big_g(X0,X1) )
& ( big_g(X2,X2)
| big_g(X0,X1) )
& ( ( ( big_f(X0,X2)
| ~ big_g(X1,X2) )
& ( big_g(X1,X2)
| ~ big_f(X0,X2) ) )
| ~ big_f(X0,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
! [X1,X0] :
? [X2] :
( ( ~ big_f(X2,X2)
| big_g(X2,X2)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ( big_f(X2,X2)
& ~ big_g(X2,X2) ) )
& ( ~ big_g(X2,X2)
| ~ big_g(X1,X0) )
& ( big_g(X2,X2)
| big_g(X1,X0) )
& ( ( ( big_f(X1,X2)
| ~ big_g(X0,X2) )
& ( big_g(X0,X2)
| ~ big_f(X1,X2) ) )
| ~ big_f(X1,X0) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
! [X1,X0] :
? [X2] :
( ( ~ big_f(X2,X2)
| big_g(X2,X2)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ( big_f(X2,X2)
& ~ big_g(X2,X2) ) )
& ( ~ big_g(X2,X2)
| ~ big_g(X1,X0) )
& ( big_g(X2,X2)
| big_g(X1,X0) )
& ( ( ( big_f(X1,X2)
| ~ big_g(X0,X2) )
& ( big_g(X0,X2)
| ~ big_f(X1,X2) ) )
| ~ big_f(X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1,X0] :
? [X2] :
( ( ( ~ big_f(X2,X2)
| big_g(X2,X2) )
<=> big_f(X1,X0) )
& ( big_g(X1,X0)
<~> big_g(X2,X2) )
& ( ( big_f(X1,X2)
<=> big_g(X0,X2) )
| ~ big_f(X1,X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( big_g(X1,X0)
<~> big_g(X2,X2) )
& ( ( ~ big_f(X2,X2)
| big_g(X2,X2) )
<=> big_f(X1,X0) )
& ( ( big_f(X1,X2)
<=> big_g(X0,X2) )
| ~ big_f(X1,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ? [X0,X1] :
! [X2] :
( ( big_f(X1,X0)
=> ( big_f(X1,X2)
<=> big_g(X0,X2) ) )
=> ( ( big_f(X1,X0)
<=> ( big_f(X2,X2)
=> big_g(X2,X2) ) )
=> ( big_g(X2,X2)
<=> big_g(X1,X0) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X1,X0] :
! [X2] :
( ( big_f(X0,X1)
=> ( big_f(X0,X2)
<=> big_g(X1,X2) ) )
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( big_g(X0,X1)
<=> big_g(X2,X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X1,X0] :
! [X2] :
( ( big_f(X0,X1)
=> ( big_f(X0,X2)
<=> big_g(X1,X2) ) )
=> ( ( ( big_f(X2,X2)
=> big_g(X2,X2) )
<=> big_f(X0,X1) )
=> ( big_g(X0,X1)
<=> big_g(X2,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_14_6) ).
fof(f28,plain,
! [X0] :
( big_f(X0,sK0(X0,X0))
| ~ big_f(X0,X0) ),
inference(factoring,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( big_f(X1,sK0(X0,X1))
| big_f(X0,sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(resolution,[],[f12,f19]) ).
fof(f19,plain,
! [X0,X1] :
( big_g(X0,X1)
| big_f(X0,X1) ),
inference(resolution,[],[f15,f13]) ).
fof(f13,plain,
! [X0,X1] :
( big_g(sK0(X0,X1),sK0(X0,X1))
| big_g(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f15,plain,
! [X0,X1] :
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( ~ big_g(X1,sK0(X0,X1))
| big_f(X0,sK0(X0,X1))
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f42,plain,
! [X1] :
( ~ big_g(X1,sK0(X1,X1))
| ~ big_f(X1,X1) ),
inference(resolution,[],[f36,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ~ big_g(sK0(X0,X1),sK0(X0,X1))
| ~ big_g(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f36,plain,
! [X0] :
( big_g(sK0(X0,sK0(X0,X0)),sK0(X0,sK0(X0,X0)))
| ~ big_f(X0,X0) ),
inference(subsumption_resolution,[],[f35,f24]) ).
fof(f35,plain,
! [X0] :
( ~ big_f(X0,sK0(X0,X0))
| ~ big_f(X0,X0)
| big_g(sK0(X0,sK0(X0,X0)),sK0(X0,sK0(X0,X0))) ),
inference(resolution,[],[f33,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X0,X1)
| big_g(sK0(X0,X1),sK0(X0,X1)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f33,plain,
! [X1] :
( big_f(sK0(X1,sK0(X1,X1)),sK0(X1,sK0(X1,X1)))
| ~ big_f(X1,X1) ),
inference(resolution,[],[f31,f21]) ).
fof(f21,plain,
! [X2,X3] :
( ~ big_g(X2,X3)
| big_f(sK0(X2,X3),sK0(X2,X3)) ),
inference(resolution,[],[f19,f14]) ).
fof(f45,plain,
! [X0,X1] : big_f(X0,X1),
inference(resolution,[],[f44,f16]) ).
fof(f16,plain,
! [X0,X1] :
( big_f(sK0(X0,X1),sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 21:45:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 % (4390)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.18/0.46 % (4406)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.46 % (4390)First to succeed.
% 0.18/0.47 % (4390)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (4390)------------------------------
% 0.18/0.47 % (4390)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.47 % (4390)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.47 % (4390)Termination reason: Refutation
% 0.18/0.47
% 0.18/0.47 % (4390)Memory used [KB]: 5884
% 0.18/0.47 % (4390)Time elapsed: 0.067 s
% 0.18/0.47 % (4390)Instructions burned: 2 (million)
% 0.18/0.47 % (4390)------------------------------
% 0.18/0.47 % (4390)------------------------------
% 0.18/0.47 % (4379)Success in time 0.124 s
%------------------------------------------------------------------------------