TSTP Solution File: SYN075+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n020.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:27 EDT 2022
% Result : Theorem 1.37s 0.54s
% Output : Refutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 6 unt; 0 def)
% Number of atoms : 164 ( 102 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 198 ( 73 ~; 78 |; 33 &)
% ( 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 : 96 ( 63 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f149,plain,
$false,
inference(subsumption_resolution,[],[f148,f26]) ).
fof(f26,plain,
big_f(sK0,sK1),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2] :
( big_f(X2,sK1)
| sK0 != X2 ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X2,X3] :
( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X2,X3] :
( ( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 )
& ( ( sK1 = X3
& sK0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
fof(f10,plain,
( ? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) )
=> ! [X3,X2] :
( ( big_f(X2,X3)
| sK1 != X3
| sK0 != X2 )
& ( ( sK1 = X3
& sK0 = X2 )
| ~ big_f(X2,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1] :
! [X2,X3] :
( ( big_f(X2,X3)
| X1 != X3
| X0 != X2 )
& ( ( X1 = X3
& X0 = X2 )
| ~ big_f(X2,X3) ) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
? [X0,X1] :
! [X3,X2] :
( ( big_f(X3,X2)
| X1 != X2
| X0 != X3 )
& ( ( X1 = X2
& X0 = X3 )
| ~ big_f(X3,X2) ) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
? [X0,X1] :
! [X3,X2] :
( ( big_f(X3,X2)
| X1 != X2
| X0 != X3 )
& ( ( X1 = X2
& X0 = X3 )
| ~ big_f(X3,X2) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
? [X0,X1] :
! [X3,X2] :
( big_f(X3,X2)
<=> ( X1 = X2
& X0 = X3 ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
? [X0,X1] :
! [X3,X2] :
( ( X1 = X3
& X0 = X2 )
<=> big_f(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52_1) ).
fof(f148,plain,
~ big_f(sK0,sK1),
inference(forward_demodulation,[],[f147,f111]) ).
fof(f111,plain,
sK1 = sK2(sK1),
inference(equality_resolution,[],[f108]) ).
fof(f108,plain,
! [X0] :
( sK1 != X0
| sK1 = sK2(X0) ),
inference(equality_factoring,[],[f95]) ).
fof(f95,plain,
! [X0] :
( sK2(X0) = X0
| sK1 = sK2(X0) ),
inference(resolution,[],[f19,f27]) ).
fof(f27,plain,
! [X0] :
( big_f(sK4(X0),sK2(X0))
| sK2(X0) = X0 ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X0,X5] :
( big_f(X5,sK2(X0))
| sK4(X0) != X5
| sK2(X0) = X0 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ( ! [X2] :
( ( sK3(X0,X2) != X2
| ~ big_f(sK3(X0,X2),sK2(X0)) )
& ( sK3(X0,X2) = X2
| big_f(sK3(X0,X2),sK2(X0)) ) )
| sK2(X0) != X0 )
& ( ! [X5] :
( ( big_f(X5,sK2(X0))
| sK4(X0) != X5 )
& ( sK4(X0) = X5
| ~ big_f(X5,sK2(X0)) ) )
| sK2(X0) = X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f13,f16,f15,f14]) ).
fof(f14,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,sK2(X0)) )
& ( X2 = X3
| big_f(X3,sK2(X0)) ) )
| sK2(X0) != X0 )
& ( ? [X4] :
! [X5] :
( ( big_f(X5,sK2(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK2(X0)) ) )
| sK2(X0) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X2] :
( ? [X3] :
( ( X2 != X3
| ~ big_f(X3,sK2(X0)) )
& ( X2 = X3
| big_f(X3,sK2(X0)) ) )
=> ( ( sK3(X0,X2) != X2
| ~ big_f(sK3(X0,X2),sK2(X0)) )
& ( sK3(X0,X2) = X2
| big_f(sK3(X0,X2),sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( big_f(X5,sK2(X0))
| X4 != X5 )
& ( X4 = X5
| ~ big_f(X5,sK2(X0)) ) )
=> ! [X5] :
( ( big_f(X5,sK2(X0))
| sK4(X0) != X5 )
& ( sK4(X0) = X5
| ~ big_f(X5,sK2(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,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,[],[f12]) ).
fof(f12,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,[],[f4]) ).
fof(f4,plain,
~ ? [X0] :
! [X1] :
( X0 = X1
<=> ? [X2] :
! [X3] :
( big_f(X3,X1)
<=> X2 = X3 ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ? [X1] :
! [X3] :
( X1 = X3
<=> ? [X0] :
! [X2] :
( X0 = X2
<=> big_f(X2,X3) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
? [X1] :
! [X3] :
( X1 = X3
<=> ? [X0] :
! [X2] :
( X0 = X2
<=> big_f(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel52) ).
fof(f19,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK1 = X3 ),
inference(cnf_transformation,[],[f11]) ).
fof(f147,plain,
~ big_f(sK0,sK2(sK1)),
inference(subsumption_resolution,[],[f146,f111]) ).
fof(f146,plain,
( sK1 != sK2(sK1)
| ~ big_f(sK0,sK2(sK1)) ),
inference(trivial_inequality_removal,[],[f145]) ).
fof(f145,plain,
( sK0 != sK0
| sK1 != sK2(sK1)
| ~ big_f(sK0,sK2(sK1)) ),
inference(superposition,[],[f24,f142]) ).
fof(f142,plain,
sK3(sK1,sK0) = sK0,
inference(equality_resolution,[],[f138]) ).
fof(f138,plain,
! [X0] :
( sK0 != X0
| sK0 = sK3(sK1,X0) ),
inference(equality_factoring,[],[f129]) ).
fof(f129,plain,
! [X1] :
( sK3(sK1,X1) = X1
| sK0 = sK3(sK1,X1) ),
inference(resolution,[],[f120,f18]) ).
fof(f18,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| sK0 = X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f120,plain,
! [X1] :
( big_f(sK3(sK1,X1),sK1)
| sK3(sK1,X1) = X1 ),
inference(trivial_inequality_removal,[],[f113]) ).
fof(f113,plain,
! [X1] :
( sK1 != sK1
| sK3(sK1,X1) = X1
| big_f(sK3(sK1,X1),sK1) ),
inference(superposition,[],[f23,f111]) ).
fof(f23,plain,
! [X2,X0] :
( sK2(X0) != X0
| big_f(sK3(X0,X2),sK2(X0))
| sK3(X0,X2) = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f24,plain,
! [X2,X0] :
( sK3(X0,X2) != X2
| sK2(X0) != X0
| ~ big_f(sK3(X0,X2),sK2(X0)) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 21:30:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.52 % (16569)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.21/0.53 % (16569)First to succeed.
% 0.21/0.53 % (16586)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.54 % (16577)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.54 % (16577)Refutation not found, incomplete strategy% (16577)------------------------------
% 0.21/0.54 % (16577)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (16568)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.37/0.54 % (16569)Refutation found. Thanks to Tanya!
% 1.37/0.54 % SZS status Theorem for theBenchmark
% 1.37/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.37/0.54 % (16569)------------------------------
% 1.37/0.54 % (16569)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.37/0.54 % (16569)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.37/0.54 % (16569)Termination reason: Refutation
% 1.37/0.54
% 1.37/0.54 % (16569)Memory used [KB]: 6012
% 1.37/0.54 % (16569)Time elapsed: 0.109 s
% 1.37/0.54 % (16569)Instructions burned: 6 (million)
% 1.37/0.54 % (16569)------------------------------
% 1.37/0.54 % (16569)------------------------------
% 1.37/0.54 % (16554)Success in time 0.18 s
%------------------------------------------------------------------------------