TSTP Solution File: SWC332+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC332+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 : n014.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:40:29 EDT 2022
% Result : Theorem 0.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 63 ( 16 unt; 0 def)
% Number of atoms : 262 ( 52 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 292 ( 93 ~; 81 |; 92 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 34 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f470,plain,
$false,
inference(avatar_sat_refutation,[],[f200,f275,f469]) ).
fof(f469,plain,
~ spl11_2,
inference(avatar_contradiction_clause,[],[f468]) ).
fof(f468,plain,
( $false
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f467,f201]) ).
fof(f201,plain,
~ equalelemsP(sK4),
inference(subsumption_resolution,[],[f165,f187]) ).
fof(f187,plain,
segmentP(sK5,sK4),
inference(backward_demodulation,[],[f186,f168]) ).
fof(f168,plain,
sK7 = sK5,
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
( ssList(sK4)
& ssList(sK6)
& sK7 = sK5
& ( singletonP(sK6)
| ~ neq(sK7,nil) )
& segmentP(sK7,sK6)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(sK7)
& sK4 = sK6
& ssList(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f104,f129,f128,f127,f126]) ).
fof(f126,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3)
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK4)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(sK4)
| ~ segmentP(X1,sK4) )
& ssList(X3)
& sK4 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(sK4)
| ~ segmentP(X1,sK4) )
& ssList(X3)
& sK4 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK5 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(X3)
& sK4 = X2 ) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK5 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(X3)
& sK4 = X2 ) )
=> ( ssList(sK6)
& ? [X3] :
( sK5 = X3
& ( singletonP(sK6)
| ~ neq(X3,nil) )
& segmentP(X3,sK6)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(X3)
& sK4 = sK6 ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X3] :
( sK5 = X3
& ( singletonP(sK6)
| ~ neq(X3,nil) )
& segmentP(X3,sK6)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(X3)
& sK4 = sK6 )
=> ( sK7 = sK5
& ( singletonP(sK6)
| ~ neq(sK7,nil) )
& segmentP(sK7,sK6)
& ( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(sK7)
& sK4 = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ( singletonP(X2)
| ~ neq(X3,nil) )
& segmentP(X3,X2)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3)
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( singletonP(X2)
| ~ neq(X3,nil) )
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X1 = X3
& X0 = X2
& segmentP(X3,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)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| ( equalelemsP(X0)
& segmentP(X1,X0) )
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| ( equalelemsP(X0)
& segmentP(X1,X0) )
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f186,plain,
segmentP(sK7,sK4),
inference(forward_demodulation,[],[f166,f163]) ).
fof(f163,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f130]) ).
fof(f166,plain,
segmentP(sK7,sK6),
inference(cnf_transformation,[],[f130]) ).
fof(f165,plain,
( ~ equalelemsP(sK4)
| ~ segmentP(sK5,sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f467,plain,
( equalelemsP(sK4)
| ~ spl11_2 ),
inference(forward_demodulation,[],[f465,f283]) ).
fof(f283,plain,
( sK4 = cons(sK10(sK4),nil)
| ~ spl11_2 ),
inference(unit_resulting_resolution,[],[f188,f199,f176]) ).
fof(f176,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK10(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ( ( ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f137,f138]) ).
fof(f138,plain,
! [X0] :
( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
=> ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X0] :
( ( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( ~ ssItem(X2)
| cons(X2,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
<=> singletonP(X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
<=> singletonP(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f199,plain,
( singletonP(sK4)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f197,plain,
( spl11_2
<=> singletonP(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f188,plain,
ssList(sK4),
inference(forward_demodulation,[],[f169,f163]) ).
fof(f169,plain,
ssList(sK6),
inference(cnf_transformation,[],[f130]) ).
fof(f465,plain,
( equalelemsP(cons(sK10(sK4),nil))
| ~ spl11_2 ),
inference(unit_resulting_resolution,[],[f282,f140]) ).
fof(f140,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,axiom,
! [X0] :
( ssItem(X0)
=> equalelemsP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax73) ).
fof(f282,plain,
( ssItem(sK10(sK4))
| ~ spl11_2 ),
inference(unit_resulting_resolution,[],[f188,f199,f177]) ).
fof(f177,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f275,plain,
spl11_1,
inference(avatar_contradiction_clause,[],[f274]) ).
fof(f274,plain,
( $false
| spl11_1 ),
inference(subsumption_resolution,[],[f256,f152]) ).
fof(f152,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f256,plain,
( ~ equalelemsP(nil)
| spl11_1 ),
inference(backward_demodulation,[],[f201,f246]) ).
fof(f246,plain,
( nil = sK4
| spl11_1 ),
inference(unit_resulting_resolution,[],[f188,f229,f150]) ).
fof(f150,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ( ( nil = X0
| ~ segmentP(nil,X0) )
& ( segmentP(nil,X0)
| nil != X0 ) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ~ ssList(X0)
| ( nil = X0
<=> segmentP(nil,X0) ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
<=> segmentP(nil,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f229,plain,
( segmentP(nil,sK4)
| spl11_1 ),
inference(backward_demodulation,[],[f187,f226]) ).
fof(f226,plain,
( nil = sK5
| spl11_1 ),
inference(unit_resulting_resolution,[],[f154,f162,f195,f145]) ).
fof(f145,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) ) ),
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(f195,plain,
( ~ neq(sK5,nil)
| spl11_1 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f193,plain,
( spl11_1
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f162,plain,
ssList(sK5),
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f200,plain,
( ~ spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f191,f197,f193]) ).
fof(f191,plain,
( singletonP(sK4)
| ~ neq(sK5,nil) ),
inference(forward_demodulation,[],[f190,f168]) ).
fof(f190,plain,
( singletonP(sK4)
| ~ neq(sK7,nil) ),
inference(forward_demodulation,[],[f167,f163]) ).
fof(f167,plain,
( singletonP(sK6)
| ~ neq(sK7,nil) ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC332+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:48:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.55 % (3607)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.21/0.55 % (3599)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.21/0.56 % (3587)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.21/0.56 % (3591)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.21/0.57 % (3599)Instruction limit reached!
% 0.21/0.57 % (3599)------------------------------
% 0.21/0.57 % (3599)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (3599)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (3599)Termination reason: Unknown
% 0.21/0.57 % (3599)Termination phase: Property scanning
% 0.21/0.57
% 0.21/0.57 % (3599)Memory used [KB]: 1791
% 0.21/0.57 % (3599)Time elapsed: 0.012 s
% 0.21/0.57 % (3599)Instructions burned: 7 (million)
% 0.21/0.57 % (3599)------------------------------
% 0.21/0.57 % (3599)------------------------------
% 0.21/0.58 % (3603)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.21/0.58 % (3585)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.58 % (3597)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.58 % (3598)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.21/0.58 % (3598)Instruction limit reached!
% 0.21/0.58 % (3598)------------------------------
% 0.21/0.58 % (3598)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58 % (3598)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (3598)Termination reason: Unknown
% 0.21/0.58 % (3598)Termination phase: Preprocessing 3
% 0.21/0.58
% 0.21/0.58 % (3598)Memory used [KB]: 1663
% 0.21/0.58 % (3598)Time elapsed: 0.004 s
% 0.21/0.58 % (3598)Instructions burned: 4 (million)
% 0.21/0.58 % (3598)------------------------------
% 0.21/0.58 % (3598)------------------------------
% 0.21/0.59 % (3595)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.21/0.59 % (3590)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.59 % (3584)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.59 % (3603)Refutation not found, incomplete strategy% (3603)------------------------------
% 0.21/0.59 % (3603)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (3603)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.59 % (3603)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.59
% 0.21/0.59 % (3603)Memory used [KB]: 6140
% 0.21/0.59 % (3603)Time elapsed: 0.145 s
% 0.21/0.59 % (3603)Instructions burned: 5 (million)
% 0.21/0.59 % (3603)------------------------------
% 0.21/0.59 % (3603)------------------------------
% 0.21/0.59 % (3587)First to succeed.
% 0.21/0.60 % (3587)Refutation found. Thanks to Tanya!
% 0.21/0.60 % SZS status Theorem for theBenchmark
% 0.21/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.60 % (3587)------------------------------
% 0.21/0.60 % (3587)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.60 % (3587)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.60 % (3587)Termination reason: Refutation
% 0.21/0.60
% 0.21/0.60 % (3587)Memory used [KB]: 6396
% 0.21/0.60 % (3587)Time elapsed: 0.147 s
% 0.21/0.60 % (3587)Instructions burned: 16 (million)
% 0.21/0.60 % (3587)------------------------------
% 0.21/0.60 % (3587)------------------------------
% 0.21/0.60 % (3583)Success in time 0.235 s
%------------------------------------------------------------------------------