TSTP Solution File: SWC028+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC028+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 : n001.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:17 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 247 ( 139 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 276 ( 72 ~; 70 |; 115 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 46 ( 22 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f362,plain,
$false,
inference(subsumption_resolution,[],[f361,f177]) ).
fof(f177,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f361,plain,
~ ssList(nil),
inference(resolution,[],[f359,f217]) ).
fof(f217,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f213]) ).
fof(f213,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f170]) ).
fof(f170,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f359,plain,
neq(nil,nil),
inference(subsumption_resolution,[],[f351,f358]) ).
fof(f358,plain,
nil != sK8,
inference(trivial_inequality_removal,[],[f354]) ).
fof(f354,plain,
( nil != sK8
| nil != nil ),
inference(backward_demodulation,[],[f207,f341]) ).
fof(f341,plain,
nil = sK5,
inference(subsumption_resolution,[],[f340,f183]) ).
fof(f183,plain,
ssList(sK5),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
( ssList(sK6)
& ssList(sK7)
& ( ( neq(sK7,nil)
& rearsegP(sK8,sK7) )
| ( nil = sK8
& nil = sK7 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(sK8)
& sK6 = sK8
& sK7 = sK5
& ssList(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f125,f148,f147,f146,f145]) ).
fof(f145,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != X1
& nil = sK5 )
| ( nil != sK5
& nil = X1 ) )
& ssList(X3)
& X1 = X3
& sK5 = X2 ) ) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != X1
& nil = sK5 )
| ( nil != sK5
& nil = X1 ) )
& ssList(X3)
& X1 = X3
& sK5 = X2 ) ) )
=> ( ssList(sK6)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(X3)
& sK6 = X3
& sK5 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(X3)
& sK6 = X3
& sK5 = X2 ) )
=> ( ssList(sK7)
& ? [X3] :
( ( ( neq(sK7,nil)
& rearsegP(X3,sK7) )
| ( nil = X3
& nil = sK7 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(X3)
& sK6 = X3
& sK7 = sK5 ) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X3] :
( ( ( neq(sK7,nil)
& rearsegP(X3,sK7) )
| ( nil = X3
& nil = sK7 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(X3)
& sK6 = X3
& sK7 = sK5 )
=> ( ( ( neq(sK7,nil)
& rearsegP(sK8,sK7) )
| ( nil = sK8
& nil = sK7 ) )
& ( ( nil != sK6
& nil = sK5 )
| ( nil != sK5
& nil = sK6 ) )
& ssList(sK8)
& sK6 = sK8
& sK7 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ssList(X3)
& X1 = X3
& X0 = X2 ) ) )
& ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& 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 != X2
| nil != X3 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) )
| ( ( nil = X0
| nil != X1 )
& ( nil = X1
| 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 != X2
| nil != X3 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) )
| ( ( nil = X0
| nil != X1 )
& ( nil = X1
| nil != X0 ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f340,plain,
( nil = sK5
| ~ ssList(sK5) ),
inference(duplicate_literal_removal,[],[f334]) ).
fof(f334,plain,
( ~ ssList(sK5)
| nil = sK5
| nil = sK5 ),
inference(resolution,[],[f333,f176]) ).
fof(f176,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( ( nil = X0
| ~ rearsegP(nil,X0) )
& ( rearsegP(nil,X0)
| nil != X0 ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ( nil = X0
<=> rearsegP(nil,X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
<=> rearsegP(nil,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(f333,plain,
( rearsegP(nil,sK5)
| nil = sK5 ),
inference(duplicate_literal_removal,[],[f329]) ).
fof(f329,plain,
( nil = sK5
| rearsegP(nil,sK5)
| nil = sK5 ),
inference(superposition,[],[f206,f209]) ).
fof(f209,plain,
( nil = sK8
| nil = sK5 ),
inference(definition_unfolding,[],[f187,f185]) ).
fof(f185,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f149]) ).
fof(f187,plain,
( nil = sK5
| nil = sK6 ),
inference(cnf_transformation,[],[f149]) ).
fof(f206,plain,
( rearsegP(sK8,sK5)
| nil = sK5 ),
inference(definition_unfolding,[],[f191,f184,f184]) ).
fof(f184,plain,
sK7 = sK5,
inference(cnf_transformation,[],[f149]) ).
fof(f191,plain,
( rearsegP(sK8,sK7)
| nil = sK7 ),
inference(cnf_transformation,[],[f149]) ).
fof(f207,plain,
( nil != sK8
| nil != sK5 ),
inference(definition_unfolding,[],[f190,f185]) ).
fof(f190,plain,
( nil != sK6
| nil != sK5 ),
inference(cnf_transformation,[],[f149]) ).
fof(f351,plain,
( neq(nil,nil)
| nil = sK8 ),
inference(backward_demodulation,[],[f203,f341]) ).
fof(f203,plain,
( neq(sK5,nil)
| nil = sK8 ),
inference(definition_unfolding,[],[f194,f184]) ).
fof(f194,plain,
( neq(sK7,nil)
| nil = sK8 ),
inference(cnf_transformation,[],[f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n001.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 18:21:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % (29152)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.51 % (29158)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (29158)Instruction limit reached!
% 0.20/0.51 % (29158)------------------------------
% 0.20/0.51 % (29158)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (29158)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (29158)Termination reason: Unknown
% 0.20/0.51 % (29158)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (29158)Memory used [KB]: 6140
% 0.20/0.51 % (29158)Time elapsed: 0.093 s
% 0.20/0.51 % (29158)Instructions burned: 7 (million)
% 0.20/0.51 % (29158)------------------------------
% 0.20/0.51 % (29158)------------------------------
% 0.20/0.52 % (29166)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.52 % (29156)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.52 % (29160)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.20/0.53 % (29150)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (29149)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (29152)First to succeed.
% 0.20/0.53 % (29152)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (29152)------------------------------
% 0.20/0.53 % (29152)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (29152)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (29152)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (29152)Memory used [KB]: 1663
% 0.20/0.53 % (29152)Time elapsed: 0.111 s
% 0.20/0.53 % (29152)Instructions burned: 9 (million)
% 0.20/0.53 % (29152)------------------------------
% 0.20/0.53 % (29152)------------------------------
% 0.20/0.53 % (29146)Success in time 0.182 s
%------------------------------------------------------------------------------