TSTP Solution File: SWC375+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC375+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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 : Tue May 21 04:38:32 EDT 2024
% Result : Theorem 0.52s 0.73s
% Output : Refutation 0.52s
% 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 : 16 ( 6 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(f157,plain,
$false,
inference(subsumption_resolution,[],[f155,f156]) ).
fof(f156,plain,
~ memberP(sK3,sK4),
inference(duplicate_literal_removal,[],[f147]) ).
fof(f147,plain,
( ~ memberP(sK3,sK4)
| ~ memberP(sK3,sK4) ),
inference(definition_unfolding,[],[f131,f146,f126]) ).
fof(f126,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
( ( ~ memberP(sK0,sK4)
| ~ memberP(sK1,sK4) )
& ( memberP(sK0,sK4)
| memberP(sK1,sK4) )
& ssItem(sK4)
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f108,f107,f106,f105,f104]) ).
fof(f104,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(X0,X4)
| ~ memberP(X1,X4) )
& ( memberP(X0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(X1,X4) )
& ( memberP(sK0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(X1,X4) )
& ( memberP(sK0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
( ? [X4] :
( ( ~ memberP(sK0,X4)
| ~ memberP(sK1,X4) )
& ( memberP(sK0,X4)
| memberP(sK1,X4) )
& ssItem(X4) )
=> ( ( ~ memberP(sK0,sK4)
| ~ memberP(sK1,sK4) )
& ( memberP(sK0,sK4)
| memberP(sK1,sK4) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(X0,X4)
| ~ memberP(X1,X4) )
& ( memberP(X0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(X0,X4)
| ~ memberP(X1,X4) )
& ( memberP(X0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& 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)
=> ( ! [X4] :
( ssItem(X4)
=> ( ( memberP(X0,X4)
& memberP(X1,X4) )
| ( ~ memberP(X0,X4)
& ~ memberP(X1,X4) ) ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( ( memberP(X0,X4)
& memberP(X1,X4) )
| ( ~ memberP(X0,X4)
& ~ memberP(X1,X4) ) ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f146,plain,
sK0 = sK3,
inference(definition_unfolding,[],[f127,f128]) ).
fof(f128,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f109]) ).
fof(f127,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f109]) ).
fof(f131,plain,
( ~ memberP(sK0,sK4)
| ~ memberP(sK1,sK4) ),
inference(cnf_transformation,[],[f109]) ).
fof(f155,plain,
memberP(sK3,sK4),
inference(duplicate_literal_removal,[],[f148]) ).
fof(f148,plain,
( memberP(sK3,sK4)
| memberP(sK3,sK4) ),
inference(definition_unfolding,[],[f130,f146,f126]) ).
fof(f130,plain,
( memberP(sK0,sK4)
| memberP(sK1,sK4) ),
inference(cnf_transformation,[],[f109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC375+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n003.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:49:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.73 % (5477)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.73 % (5477)First to succeed.
% 0.52/0.73 % (5476)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73 % (5474)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.52/0.73 % (5475)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.52/0.73 % (5477)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5473"
% 0.52/0.73 % (5477)Refutation found. Thanks to Tanya!
% 0.52/0.73 % SZS status Theorem for theBenchmark
% 0.52/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.73 % (5477)------------------------------
% 0.52/0.73 % (5477)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73 % (5477)Termination reason: Refutation
% 0.52/0.73
% 0.52/0.73 % (5477)Memory used [KB]: 1130
% 0.52/0.73 % (5477)Time elapsed: 0.002 s
% 0.52/0.73 % (5477)Instructions burned: 4 (million)
% 0.52/0.73 % (5473)Success in time 0.376 s
% 0.52/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------