TSTP Solution File: SYN075+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN075+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 : n021.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:36:49 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 6 unt; 0 def)
% Number of atoms : 158 ( 98 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 190 ( 70 ~; 75 |; 31 &)
% ( 9 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 61 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f223,plain,
$false,
inference(subsumption_resolution,[],[f222,f26]) ).
fof(f26,plain,
big_f(sK3,sK4),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2] :
( big_f(sK3,X2)
| sK4 != X2 ),
inference(equality_resolution,[],[f21]) ).
fof(f21,plain,
! [X2,X3] :
( big_f(X3,X2)
| sK3 != X3
| sK4 != X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X3] :
( ( ( sK3 = X3
& sK4 = X2 )
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| sK3 != X3
| sK4 != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f14,f15]) ).
fof(f15,plain,
( ? [X0,X1] :
! [X2,X3] :
( ( ( X0 = X3
& X1 = X2 )
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| X0 != X3
| X1 != X2 ) )
=> ! [X3,X2] :
( ( ( sK3 = X3
& sK4 = X2 )
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| sK3 != X3
| sK4 != X2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1] :
! [X2,X3] :
( ( ( X0 = X3
& X1 = X2 )
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| X0 != X3
| X1 != X2 ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1] :
! [X2,X3] :
( ( ( X0 = X3
& X1 = X2 )
| ~ big_f(X3,X2) )
& ( big_f(X3,X2)
| X0 != X3
| X1 != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
( ( X0 = X3
& X1 = X2 )
<=> big_f(X3,X2) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
? [X0,X1] :
! [X3,X2] :
( big_f(X2,X3)
<=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52_1) ).
fof(f222,plain,
~ big_f(sK3,sK4),
inference(forward_demodulation,[],[f221,f39]) ).
fof(f39,plain,
sK0(sK4) = sK4,
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X0] :
( sK4 != X0
| sK4 = sK0(X0) ),
inference(equality_factoring,[],[f30]) ).
fof(f30,plain,
! [X1] :
( sK0(X1) = X1
| sK4 = sK0(X1) ),
inference(resolution,[],[f24,f22]) ).
fof(f22,plain,
! [X2,X3] :
( ~ big_f(X3,X2)
| sK4 = X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0] :
( big_f(sK2(X0),sK0(X0))
| sK0(X0) = X0 ),
inference(equality_resolution,[],[f18]) ).
fof(f18,plain,
! [X0,X5] :
( big_f(X5,sK0(X0))
| sK2(X0) != X5
| sK0(X0) = X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0] :
( ( ! [X2] :
( ( sK1(X0,X2) != X2
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( sK1(X0,X2) = X2
| big_f(sK1(X0,X2),sK0(X0)) ) )
| sK0(X0) != X0 )
& ( ! [X5] :
( ( big_f(X5,sK0(X0))
| sK2(X0) != X5 )
& ( sK2(X0) = X5
| ~ big_f(X5,sK0(X0)) ) )
| sK0(X0) = X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( ( ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) )
| X0 != X1 )
& ( ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) )
| X0 = X1 ) )
=> ( ( ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK0(X0)) )
& ( X2 = X3
| big_f(X3,sK0(X0)) ) )
| sK0(X0) != X0 )
& ( ? [X4] :
! [X5] :
( ( big_f(X5,sK0(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK0(X0)) ) )
| sK0(X0) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK0(X0)) )
& ( X2 = X3
| big_f(X3,sK0(X0)) ) )
=> ( ( sK1(X0,X2) != X2
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( sK1(X0,X2) = X2
| big_f(sK1(X0,X2),sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(X5,sK0(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK0(X0)) ) )
=> ! [X5] :
( ( big_f(X5,sK0(X0))
| sK2(X0) != X5 )
& ( sK2(X0) = X5
| ~ big_f(X5,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0] :
? [X1] :
( ( ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) )
| X0 != X1 )
& ( ? [X4] :
! [X5] :
( ( big_f(X5,X1)
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,X1) ) )
| X0 = X1 ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
! [X0] :
? [X1] :
( ( ! [X2] :
? [X3] :
( ( X2 != X3
| ~ big_f(X3,X1) )
& ( X2 = X3
| big_f(X3,X1) ) )
| X0 != X1 )
& ( ? [X2] :
! [X3] :
( ( big_f(X3,X1)
| X2 != X3 )
& ( X2 = X3
| ~ big_f(X3,X1) ) )
| X0 = X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0] :
? [X1] :
( X0 = X1
<~> ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
~ ? [X0] :
! [X1] :
( X0 = X1
<=> ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
? [X1] :
! [X3] :
( ? [X0] :
! [X2] :
( big_f(X2,X3)
<=> X0 = X2 )
<=> X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52) ).
fof(f221,plain,
~ big_f(sK3,sK0(sK4)),
inference(subsumption_resolution,[],[f220,f39]) ).
fof(f220,plain,
( ~ big_f(sK3,sK0(sK4))
| sK0(sK4) != sK4 ),
inference(trivial_inequality_removal,[],[f219]) ).
fof(f219,plain,
( ~ big_f(sK3,sK0(sK4))
| sK0(sK4) != sK4
| sK3 != sK3 ),
inference(superposition,[],[f20,f217]) ).
fof(f217,plain,
sK1(sK4,sK3) = sK3,
inference(equality_resolution,[],[f212]) ).
fof(f212,plain,
! [X0] :
( sK3 != X0
| sK3 = sK1(sK4,X0) ),
inference(equality_factoring,[],[f204]) ).
fof(f204,plain,
! [X2] :
( sK1(sK4,X2) = X2
| sK1(sK4,X2) = sK3 ),
inference(resolution,[],[f202,f23]) ).
fof(f23,plain,
! [X2,X3] :
( ~ big_f(X3,X2)
| sK3 = X3 ),
inference(cnf_transformation,[],[f16]) ).
fof(f202,plain,
! [X0] :
( big_f(sK1(sK4,X0),sK4)
| sK1(sK4,X0) = X0 ),
inference(trivial_inequality_removal,[],[f198]) ).
fof(f198,plain,
! [X0] :
( sK1(sK4,X0) = X0
| big_f(sK1(sK4,X0),sK4)
| sK4 != sK4 ),
inference(superposition,[],[f19,f39]) ).
fof(f19,plain,
! [X2,X0] :
( sK0(X0) != X0
| big_f(sK1(X0,X2),sK0(X0))
| sK1(X0,X2) = X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
! [X2,X0] :
( sK1(X0,X2) != X2
| ~ big_f(sK1(X0,X2),sK0(X0))
| sK0(X0) != X0 ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n021.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:25:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 % (9503)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.48 % (9519)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.19/0.48 % (9503)First to succeed.
% 0.19/0.49 % (9511)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 0.19/0.49 % (9503)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (9503)------------------------------
% 0.19/0.49 % (9503)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (9503)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (9503)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (9503)Memory used [KB]: 5500
% 0.19/0.49 % (9503)Time elapsed: 0.096 s
% 0.19/0.49 % (9503)Instructions burned: 7 (million)
% 0.19/0.49 % (9503)------------------------------
% 0.19/0.49 % (9503)------------------------------
% 0.19/0.49 % (9490)Success in time 0.146 s
%------------------------------------------------------------------------------