TSTP Solution File: SWC375+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC375+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 : n022.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:27 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 169 ( 43 equ)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 190 ( 42 ~; 38 |; 95 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 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 : 45 ( 10 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f601,plain,
$false,
inference(resolution,[],[f598,f596]) ).
fof(f596,plain,
~ memberP(sK21,sK25),
inference(duplicate_literal_removal,[],[f595]) ).
fof(f595,plain,
( ~ memberP(sK21,sK25)
| ~ memberP(sK21,sK25) ),
inference(backward_demodulation,[],[f410,f559]) ).
fof(f559,plain,
sK22 = sK21,
inference(definition_unfolding,[],[f412,f413,f407]) ).
fof(f407,plain,
sK23 = sK21,
inference(cnf_transformation,[],[f271]) ).
fof(f271,plain,
( ssList(sK21)
& ssList(sK23)
& sK24 = sK22
& sK24 = sK23
& ssList(sK24)
& ( ~ memberP(sK22,sK25)
| ~ memberP(sK21,sK25) )
& ( memberP(sK22,sK25)
| memberP(sK21,sK25) )
& ssItem(sK25)
& sK23 = sK21
& ssList(sK22) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23,sK24,sK25])],[f116,f270,f269,f268,f267,f266]) ).
fof(f266,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(X1,X4)
| ~ memberP(X0,X4) )
& ( memberP(X1,X4)
| memberP(X0,X4) )
& ssItem(X4) )
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK21)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(X1,X4)
| ~ memberP(sK21,X4) )
& ( memberP(X1,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK21 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f267,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(X1,X4)
| ~ memberP(sK21,X4) )
& ( memberP(X1,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK21 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK22 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK21 = X2 ) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f268,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK22 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK21 = X2 ) )
=> ( ssList(sK23)
& ? [X3] :
( sK22 = X3
& sK23 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK23 = sK21 ) ) ),
introduced(choice_axiom,[]) ).
fof(f269,plain,
( ? [X3] :
( sK22 = X3
& sK23 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK23 = sK21 )
=> ( sK24 = sK22
& sK24 = sK23
& ssList(sK24)
& ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
& sK23 = sK21 ) ),
introduced(choice_axiom,[]) ).
fof(f270,plain,
( ? [X4] :
( ( ~ memberP(sK22,X4)
| ~ memberP(sK21,X4) )
& ( memberP(sK22,X4)
| memberP(sK21,X4) )
& ssItem(X4) )
=> ( ( ~ memberP(sK22,sK25)
| ~ memberP(sK21,sK25) )
& ( memberP(sK22,sK25)
| memberP(sK21,sK25) )
& ssItem(sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X2 = X3
& ssList(X3)
& ? [X4] :
( ( ~ memberP(X1,X4)
| ~ memberP(X0,X4) )
& ( memberP(X1,X4)
| memberP(X0,X4) )
& ssItem(X4) )
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f115]) ).
fof(f115,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X2 = X3
& ? [X4] :
( ( memberP(X1,X4)
| memberP(X0,X4) )
& ( ~ memberP(X1,X4)
| ~ memberP(X0,X4) )
& ssItem(X4) )
& X1 = X3
& 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)
=> ( X2 != X3
| ! [X4] :
( ssItem(X4)
=> ( ( ~ memberP(X1,X4)
& ~ memberP(X0,X4) )
| ( memberP(X1,X4)
& memberP(X0,X4) ) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X2 != X3
| ! [X4] :
( ssItem(X4)
=> ( ( ~ memberP(X1,X4)
& ~ memberP(X0,X4) )
| ( memberP(X1,X4)
& memberP(X0,X4) ) ) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f413,plain,
sK24 = sK22,
inference(cnf_transformation,[],[f271]) ).
fof(f412,plain,
sK24 = sK23,
inference(cnf_transformation,[],[f271]) ).
fof(f410,plain,
( ~ memberP(sK21,sK25)
| ~ memberP(sK22,sK25) ),
inference(cnf_transformation,[],[f271]) ).
fof(f598,plain,
memberP(sK21,sK25),
inference(duplicate_literal_removal,[],[f597]) ).
fof(f597,plain,
( memberP(sK21,sK25)
| memberP(sK21,sK25) ),
inference(forward_demodulation,[],[f409,f559]) ).
fof(f409,plain,
( memberP(sK22,sK25)
| memberP(sK21,sK25) ),
inference(cnf_transformation,[],[f271]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC375+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:52:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 % (26827)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.48 % (26841)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.18/0.49 % (26833)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.18/0.50 % (26822)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (26818)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.18/0.51 % (26827)First to succeed.
% 0.18/0.51 % (26844)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.51 % (26827)Refutation found. Thanks to Tanya!
% 0.18/0.51 % SZS status Theorem for theBenchmark
% 0.18/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51 % (26827)------------------------------
% 0.18/0.51 % (26827)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (26827)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (26827)Termination reason: Refutation
% 0.18/0.51
% 0.18/0.51 % (26827)Memory used [KB]: 1407
% 0.18/0.51 % (26827)Time elapsed: 0.126 s
% 0.18/0.51 % (26827)Instructions burned: 14 (million)
% 0.18/0.51 % (26827)------------------------------
% 0.18/0.51 % (26827)------------------------------
% 0.18/0.51 % (26817)Success in time 0.173 s
%------------------------------------------------------------------------------