TSTP Solution File: SWC210+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC210+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 : 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:39:37 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 10 unt; 0 def)
% Number of atoms : 199 ( 36 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 218 ( 61 ~; 47 |; 90 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f391,plain,
$false,
inference(avatar_sat_refutation,[],[f180,f187,f188,f360,f387]) ).
fof(f387,plain,
( ~ spl9_3
| ~ spl9_4 ),
inference(avatar_contradiction_clause,[],[f386]) ).
fof(f386,plain,
( $false
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f363,f130]) ).
fof(f130,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f363,plain,
( singletonP(nil)
| ~ spl9_3
| ~ spl9_4 ),
inference(backward_demodulation,[],[f184,f222]) ).
fof(f222,plain,
( nil = sK3
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl9_4
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f184,plain,
( singletonP(sK3)
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f182,plain,
( spl9_3
<=> singletonP(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f360,plain,
( spl9_4
| spl9_1 ),
inference(avatar_split_clause,[],[f345,f173,f220]) ).
fof(f173,plain,
( spl9_1
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f345,plain,
( nil = sK3
| spl9_1 ),
inference(unit_resulting_resolution,[],[f155,f137,f175,f134]) ).
fof(f134,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f175,plain,
( ~ neq(sK3,nil)
| spl9_1 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f137,plain,
ssList(sK3),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
( ssList(sK5)
& sK5 = sK3
& ssList(sK6)
& sK4 = sK6
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(sK5) )
| ( neq(sK4,nil)
& ~ neq(sK6,nil) ) )
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f108,f121,f120,f119,f118]) ).
fof(f118,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& X1 = X3
& ( ( neq(X1,nil)
& ~ neq(X0,nil)
& singletonP(X2) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK3 = X2
& ssList(X3)
& X1 = X3
& ( ( neq(X1,nil)
& ~ neq(sK3,nil)
& singletonP(X2) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) ) ) )
& ssList(X1) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK3 = X2
& ssList(X3)
& X1 = X3
& ( ( neq(X1,nil)
& ~ neq(sK3,nil)
& singletonP(X2) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK3 = X2
& ssList(X3)
& sK4 = X3
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(X2) )
| ( neq(sK4,nil)
& ~ neq(X3,nil) ) ) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK3 = X2
& ssList(X3)
& sK4 = X3
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(X2) )
| ( neq(sK4,nil)
& ~ neq(X3,nil) ) ) ) )
=> ( ssList(sK5)
& ? [X3] :
( sK5 = sK3
& ssList(X3)
& sK4 = X3
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(sK5) )
| ( neq(sK4,nil)
& ~ neq(X3,nil) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X3] :
( sK5 = sK3
& ssList(X3)
& sK4 = X3
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(sK5) )
| ( neq(sK4,nil)
& ~ neq(X3,nil) ) ) )
=> ( sK5 = sK3
& ssList(sK6)
& sK4 = sK6
& ( ( neq(sK4,nil)
& ~ neq(sK3,nil)
& singletonP(sK5) )
| ( neq(sK4,nil)
& ~ neq(sK6,nil) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& X1 = X3
& ( ( neq(X1,nil)
& ~ neq(X0,nil)
& singletonP(X2) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ~ neq(X0,nil)
& singletonP(X2) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& 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
| ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ~ neq(X1,nil)
| ~ singletonP(X2)
| neq(X0,nil) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ~ neq(X1,nil)
| ~ singletonP(X2)
| neq(X0,nil) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f155,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f188,plain,
spl9_2,
inference(avatar_split_clause,[],[f171,f177]) ).
fof(f177,plain,
( spl9_2
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f171,plain,
neq(sK6,nil),
inference(duplicate_literal_removal,[],[f160]) ).
fof(f160,plain,
( neq(sK6,nil)
| neq(sK6,nil) ),
inference(definition_unfolding,[],[f144,f145,f145]) ).
fof(f145,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f122]) ).
fof(f144,plain,
( neq(sK4,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f122]) ).
fof(f187,plain,
( spl9_3
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f164,f177,f182]) ).
fof(f164,plain,
( ~ neq(sK6,nil)
| singletonP(sK3) ),
inference(definition_unfolding,[],[f139,f147]) ).
fof(f147,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f139,plain,
( singletonP(sK5)
| ~ neq(sK6,nil) ),
inference(cnf_transformation,[],[f122]) ).
fof(f180,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f141,f177,f173]) ).
fof(f141,plain,
( ~ neq(sK6,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC210+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.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:43:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (22093)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.19/0.49 % (22077)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.19/0.50 % (22077)First to succeed.
% 0.19/0.50 % (22085)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.19/0.50 % (22080)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.50 % (22080)Refutation not found, incomplete strategy% (22080)------------------------------
% 0.19/0.50 % (22080)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (22080)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (22080)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (22080)Memory used [KB]: 6012
% 0.19/0.50 % (22080)Time elapsed: 0.101 s
% 0.19/0.50 % (22080)Instructions burned: 3 (million)
% 0.19/0.50 % (22080)------------------------------
% 0.19/0.50 % (22080)------------------------------
% 0.19/0.51 % (22075)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.19/0.51 % (22077)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (22077)------------------------------
% 0.19/0.51 % (22077)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (22077)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22077)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (22077)Memory used [KB]: 6140
% 0.19/0.51 % (22077)Time elapsed: 0.101 s
% 0.19/0.51 % (22077)Instructions burned: 10 (million)
% 0.19/0.51 % (22077)------------------------------
% 0.19/0.51 % (22077)------------------------------
% 0.19/0.51 % (22069)Success in time 0.164 s
%------------------------------------------------------------------------------