TSTP Solution File: SWC411+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC411+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 : n028.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:42 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 177 ( 30 equ)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 212 ( 56 ~; 39 |; 97 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 ( 28 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f618,plain,
$false,
inference(subsumption_resolution,[],[f617,f482]) ).
fof(f482,plain,
ssItem(sK41),
inference(cnf_transformation,[],[f313]) ).
fof(f313,plain,
( ssList(sK37)
& ssList(sK39)
& ~ memberP(sK37,sK41)
& ssItem(sK41)
& memberP(sK38,sK41)
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK40,X5)
| memberP(sK39,X5) )
& ssList(sK40)
& sK40 = sK38
& sK39 = sK37
& ssList(sK38) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK37,sK38,sK39,sK40,sK41])],[f195,f312,f311,f310,f309,f308]) ).
fof(f308,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& ssItem(X4)
& memberP(X1,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK37)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(X1,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& X1 = X3
& sK37 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f309,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(X1,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& X1 = X3
& sK37 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& sK38 = X3
& sK37 = X2 ) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f310,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& sK38 = X3
& sK37 = X2 ) )
=> ( ssList(sK39)
& ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(sK39,X5) )
& ssList(X3)
& sK38 = X3
& sK39 = sK37 ) ) ),
introduced(choice_axiom,[]) ).
fof(f311,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(sK39,X5) )
& ssList(X3)
& sK38 = X3
& sK39 = sK37 )
=> ( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK40,X5)
| memberP(sK39,X5) )
& ssList(sK40)
& sK40 = sK38
& sK39 = sK37 ) ),
introduced(choice_axiom,[]) ).
fof(f312,plain,
( ? [X4] :
( ~ memberP(sK37,X4)
& ssItem(X4)
& memberP(sK38,X4) )
=> ( ~ memberP(sK37,sK41)
& ssItem(sK41)
& memberP(sK38,sK41) ) ),
introduced(choice_axiom,[]) ).
fof(f195,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& ssItem(X4)
& memberP(X1,X4) )
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f194]) ).
fof(f194,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ? [X4] :
( memberP(X1,X4)
& ~ memberP(X0,X4)
& ssItem(X4) )
& X1 = X3
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| memberP(X2,X5) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X1,X4)
| memberP(X0,X4) ) )
| X1 != X3
| ? [X5] :
( ssItem(X5)
& memberP(X3,X5)
& ~ memberP(X2,X5) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X5] :
( ssItem(X5)
=> ( memberP(X0,X5)
| ~ memberP(X1,X5) ) )
| ? [X4] :
( ~ memberP(X2,X4)
& ssItem(X4)
& memberP(X3,X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X5] :
( ssItem(X5)
=> ( memberP(X0,X5)
| ~ memberP(X1,X5) ) )
| ? [X4] :
( ~ memberP(X2,X4)
& ssItem(X4)
& memberP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f617,plain,
~ ssItem(sK41),
inference(subsumption_resolution,[],[f616,f483]) ).
fof(f483,plain,
~ memberP(sK37,sK41),
inference(cnf_transformation,[],[f313]) ).
fof(f616,plain,
( memberP(sK37,sK41)
| ~ ssItem(sK41) ),
inference(resolution,[],[f560,f481]) ).
fof(f481,plain,
memberP(sK38,sK41),
inference(cnf_transformation,[],[f313]) ).
fof(f560,plain,
! [X5] :
( ~ memberP(sK38,X5)
| memberP(sK37,X5)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f480,f478,f477]) ).
fof(f477,plain,
sK39 = sK37,
inference(cnf_transformation,[],[f313]) ).
fof(f478,plain,
sK40 = sK38,
inference(cnf_transformation,[],[f313]) ).
fof(f480,plain,
! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK40,X5)
| memberP(sK39,X5) ),
inference(cnf_transformation,[],[f313]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC411+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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.13/0.33 % Computer : n028.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 19:03:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.48 % (11493)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.48 % (11477)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49 % (11477)Instruction limit reached!
% 0.20/0.49 % (11477)------------------------------
% 0.20/0.49 % (11477)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (11477)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (11477)Termination reason: Unknown
% 0.20/0.49 % (11477)Termination phase: Property scanning
% 0.20/0.49
% 0.20/0.49 % (11477)Memory used [KB]: 1279
% 0.20/0.49 % (11477)Time elapsed: 0.007 s
% 0.20/0.49 % (11477)Instructions burned: 7 (million)
% 0.20/0.49 % (11477)------------------------------
% 0.20/0.49 % (11477)------------------------------
% 0.20/0.49 % (11485)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.50 % (11478)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (11483)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (11478)Instruction limit reached!
% 0.20/0.50 % (11478)------------------------------
% 0.20/0.50 % (11478)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (11478)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (11478)Termination reason: Unknown
% 0.20/0.50 % (11478)Termination phase: Preprocessing 3
% 0.20/0.50
% 0.20/0.50 % (11478)Memory used [KB]: 1023
% 0.20/0.50 % (11478)Time elapsed: 0.003 s
% 0.20/0.50 % (11478)Instructions burned: 3 (million)
% 0.20/0.50 % (11478)------------------------------
% 0.20/0.50 % (11478)------------------------------
% 0.20/0.51 % (11494)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.51 % (11493)First to succeed.
% 0.20/0.51 % (11485)Also succeeded, but the first one will report.
% 0.20/0.51 % (11471)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (11493)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (11493)------------------------------
% 0.20/0.51 % (11493)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (11493)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (11493)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (11493)Memory used [KB]: 5884
% 0.20/0.51 % (11493)Time elapsed: 0.118 s
% 0.20/0.51 % (11493)Instructions burned: 16 (million)
% 0.20/0.51 % (11493)------------------------------
% 0.20/0.51 % (11493)------------------------------
% 0.20/0.51 % (11469)Success in time 0.171 s
%------------------------------------------------------------------------------