TSTP Solution File: SWC405+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC405+1 : TPTP v8.1.0. Released v2.4.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 : n013.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 18:43:40 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 206 ( 30 equ)
% Maximal formula atoms : 28 ( 9 avg)
% Number of connectives : 252 ( 68 ~; 51 |; 118 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 66 ( 24 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f660,plain,
$false,
inference(subsumption_resolution,[],[f659,f457]) ).
fof(f457,plain,
ssItem(sK30),
inference(cnf_transformation,[],[f289]) ).
fof(f289,plain,
( ssList(sK26)
& ssList(sK27)
& ssList(sK28)
& sK29 = sK27
& ssList(sK29)
& ssItem(sK30)
& memberP(sK26,sK30)
& ~ memberP(sK27,sK30)
& ! [X5] :
( ( ( ~ memberP(sK28,X5)
| memberP(sK29,X5) )
& ( ~ memberP(sK29,X5)
| memberP(sK28,X5) ) )
| ~ ssItem(X5) )
& sK26 = sK28 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28,sK29,sK30])],[f283,f288,f287,f286,f285,f284]) ).
fof(f284,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(X0,X4)
& ~ memberP(X1,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& X0 = X2 ) ) ) )
=> ( ssList(sK26)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(X1,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& sK26 = X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f285,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(X1,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& sK26 = X2 ) ) )
=> ( ssList(sK27)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK27 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& sK26 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK27 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& sK26 = X2 ) )
=> ( ssList(sK28)
& ? [X3] :
( sK27 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
& ! [X5] :
( ( ( ~ memberP(sK28,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(sK28,X5) ) )
| ~ ssItem(X5) )
& sK26 = sK28 ) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X3] :
( sK27 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
& ! [X5] :
( ( ( ~ memberP(sK28,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(sK28,X5) ) )
| ~ ssItem(X5) )
& sK26 = sK28 )
=> ( sK29 = sK27
& ssList(sK29)
& ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
& ! [X5] :
( ( ( ~ memberP(sK28,X5)
| memberP(sK29,X5) )
& ( ~ memberP(sK29,X5)
| memberP(sK28,X5) ) )
| ~ ssItem(X5) )
& sK26 = sK28 ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
( ? [X4] :
( ssItem(X4)
& memberP(sK26,X4)
& ~ memberP(sK27,X4) )
=> ( ssItem(sK30)
& memberP(sK26,sK30)
& ~ memberP(sK27,sK30) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ? [X4] :
( ssItem(X4)
& memberP(X0,X4)
& ~ memberP(X1,X4) )
& ! [X5] :
( ( ( ~ memberP(X2,X5)
| memberP(X3,X5) )
& ( ~ memberP(X3,X5)
| memberP(X2,X5) ) )
| ~ ssItem(X5) )
& X0 = X2 ) ) ) ),
inference(rectify,[],[f178]) ).
fof(f178,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ? [X5] :
( ssItem(X5)
& memberP(X0,X5)
& ~ memberP(X1,X5) )
& ! [X4] :
( ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X0 = X2 ) ) ) ),
inference(flattening,[],[f177]) ).
fof(f177,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| memberP(X3,X4) )
& ( ~ memberP(X3,X4)
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& X1 = X3
& ? [X5] :
( memberP(X0,X5)
& ~ memberP(X1,X5)
& ssItem(X5) )
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( ~ memberP(X3,X4)
& memberP(X2,X4) ) ) )
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| memberP(X1,X5) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( ~ memberP(X3,X4)
& memberP(X2,X4) ) ) )
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| memberP(X1,X5) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f659,plain,
~ ssItem(sK30),
inference(subsumption_resolution,[],[f658,f455]) ).
fof(f455,plain,
~ memberP(sK27,sK30),
inference(cnf_transformation,[],[f289]) ).
fof(f658,plain,
( memberP(sK27,sK30)
| ~ ssItem(sK30) ),
inference(resolution,[],[f563,f562]) ).
fof(f562,plain,
memberP(sK28,sK30),
inference(definition_unfolding,[],[f456,f452]) ).
fof(f452,plain,
sK26 = sK28,
inference(cnf_transformation,[],[f289]) ).
fof(f456,plain,
memberP(sK26,sK30),
inference(cnf_transformation,[],[f289]) ).
fof(f563,plain,
! [X5] :
( ~ memberP(sK28,X5)
| memberP(sK27,X5)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f454,f459]) ).
fof(f459,plain,
sK29 = sK27,
inference(cnf_transformation,[],[f289]) ).
fof(f454,plain,
! [X5] :
( ~ memberP(sK28,X5)
| memberP(sK29,X5)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC405+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 18:50:17 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 % (10191)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.21/0.50 % (10200)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.52 % (10190)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.53 % (10188)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53 % (10200)First to succeed.
% 0.21/0.53 % (10200)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (10200)------------------------------
% 0.21/0.53 % (10200)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (10200)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (10200)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (10200)Memory used [KB]: 6012
% 0.21/0.53 % (10200)Time elapsed: 0.095 s
% 0.21/0.53 % (10200)Instructions burned: 19 (million)
% 0.21/0.53 % (10200)------------------------------
% 0.21/0.53 % (10200)------------------------------
% 0.21/0.53 % (10178)Success in time 0.165 s
%------------------------------------------------------------------------------