TSTP Solution File: SWC044+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC044+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_uns --cores 0 -t %d %s
% Computer : n009.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:38:23 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 153 ( 64 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 166 ( 44 ~; 29 |; 77 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 44 ( 20 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f271,plain,
$false,
inference(unit_resulting_resolution,[],[f174,f225,f194]) ).
fof(f194,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,sK6) ),
inference(definition_unfolding,[],[f166,f177]) ).
fof(f177,plain,
nil = sK6,
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ssList(sK5)
& ssList(sK6)
& ssList(sK8)
& nil != sK5
& rearsegP(sK8,sK7)
& nil = sK6
& sK5 = sK7
& sK8 = sK6
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f119,f144,f143,f142,f141]) ).
fof(f141,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != X0
& rearsegP(X3,X2)
& nil = X1
& X0 = X2
& X1 = X3 )
& ssList(X2) ) ) )
=> ( ssList(sK5)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,X2)
& nil = X1
& sK5 = X2
& X1 = X3 )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,X2)
& nil = X1
& sK5 = X2
& X1 = X3 )
& ssList(X2) ) )
=> ( ssList(sK6)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,X2)
& nil = sK6
& sK5 = X2
& sK6 = X3 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,X2)
& nil = sK6
& sK5 = X2
& sK6 = X3 )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,sK7)
& nil = sK6
& sK5 = sK7
& sK6 = X3 )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X3] :
( ssList(X3)
& nil != sK5
& rearsegP(X3,sK7)
& nil = sK6
& sK5 = sK7
& sK6 = X3 )
=> ( ssList(sK8)
& nil != sK5
& rearsegP(sK8,sK7)
& nil = sK6
& sK5 = sK7
& sK8 = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& nil != X0
& rearsegP(X3,X2)
& nil = X1
& X0 = X2
& X1 = X3 )
& ssList(X2) ) ) ),
inference(flattening,[],[f118]) ).
fof(f118,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& nil = X1
& rearsegP(X3,X2)
& nil != X0
& 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)
=> ( X1 != X3
| nil != X1
| ~ rearsegP(X3,X2)
| nil = X0
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| nil != X1
| ~ rearsegP(X3,X2)
| nil = X0
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f166,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f225,plain,
~ rearsegP(sK7,sK6),
inference(subsumption_resolution,[],[f224,f201]) ).
fof(f201,plain,
sK7 != sK6,
inference(definition_unfolding,[],[f179,f177,f176]) ).
fof(f176,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f145]) ).
fof(f179,plain,
nil != sK5,
inference(cnf_transformation,[],[f145]) ).
fof(f224,plain,
( sK7 = sK6
| ~ rearsegP(sK7,sK6) ),
inference(subsumption_resolution,[],[f223,f181]) ).
fof(f181,plain,
ssList(sK6),
inference(cnf_transformation,[],[f145]) ).
fof(f223,plain,
( ~ ssList(sK6)
| ~ rearsegP(sK7,sK6)
| sK7 = sK6 ),
inference(subsumption_resolution,[],[f218,f174]) ).
fof(f218,plain,
( ~ ssList(sK7)
| ~ ssList(sK6)
| ~ rearsegP(sK7,sK6)
| sK7 = sK6 ),
inference(resolution,[],[f202,f170]) ).
fof(f170,plain,
! [X0,X1] :
( ~ rearsegP(X1,X0)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1)
| ~ rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ! [X1] :
( ~ rearsegP(X1,X0)
| X0 = X1
| ~ rearsegP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( rearsegP(X0,X1)
& rearsegP(X1,X0) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(f202,plain,
rearsegP(sK6,sK7),
inference(definition_unfolding,[],[f178,f175]) ).
fof(f175,plain,
sK8 = sK6,
inference(cnf_transformation,[],[f145]) ).
fof(f178,plain,
rearsegP(sK8,sK7),
inference(cnf_transformation,[],[f145]) ).
fof(f174,plain,
ssList(sK7),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 20:29:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.54 % (9453)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)
% 0.20/0.54 % (9463)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.54 % (9477)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.54 % (9462)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.55 % (9455)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.55 % (9463)Instruction limit reached!
% 0.20/0.55 % (9463)------------------------------
% 0.20/0.55 % (9463)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (9471)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.55 % (9472)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55 % (9470)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.55 % (9471)First to succeed.
% 0.20/0.55 % (9463)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (9463)Termination reason: Unknown
% 0.20/0.55 % (9463)Termination phase: Function definition elimination
% 0.20/0.55
% 0.20/0.55 % (9463)Memory used [KB]: 1791
% 0.20/0.55 % (9463)Time elapsed: 0.007 s
% 0.20/0.55 % (9463)Instructions burned: 8 (million)
% 0.20/0.55 % (9463)------------------------------
% 0.20/0.55 % (9463)------------------------------
% 0.20/0.55 % (9462)Instruction limit reached!
% 0.20/0.55 % (9462)------------------------------
% 0.20/0.55 % (9462)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (9462)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (9462)Termination reason: Unknown
% 0.20/0.55 % (9462)Termination phase: Preprocessing 3
% 0.20/0.55
% 0.20/0.55 % (9462)Memory used [KB]: 1535
% 0.20/0.55 % (9462)Time elapsed: 0.004 s
% 0.20/0.55 % (9462)Instructions burned: 3 (million)
% 0.20/0.55 % (9462)------------------------------
% 0.20/0.55 % (9462)------------------------------
% 0.20/0.56 % (9454)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.20/0.56 % (9471)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (9471)------------------------------
% 0.20/0.56 % (9471)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (9471)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (9471)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (9471)Memory used [KB]: 1663
% 0.20/0.56 % (9471)Time elapsed: 0.122 s
% 0.20/0.56 % (9471)Instructions burned: 6 (million)
% 0.20/0.56 % (9471)------------------------------
% 0.20/0.56 % (9471)------------------------------
% 0.20/0.56 % (9447)Success in time 0.207 s
%------------------------------------------------------------------------------