TSTP Solution File: SWW469+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW469+1 : TPTP v8.2.0. Released v5.3.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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 06:59:52 EDT 2024
% Result : Theorem 0.52s 0.74s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 60 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 24 ~; 10 |; 16 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 11 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f30]) ).
fof(f30,plain,
sK0 != sK1,
inference(backward_demodulation,[],[f24,f28]) ).
fof(f28,plain,
sK0 = sK2,
inference(resolution,[],[f25,f19]) ).
fof(f19,plain,
! [X1] :
( ~ is_state(X1)
| sK0 = X1 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ! [X1] :
( sK0 = X1
| ~ is_state(X1) )
& is_state(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f13]) ).
fof(f13,plain,
( ? [X0] :
( ! [X1] :
( X0 = X1
| ~ is_state(X1) )
& is_state(X0) )
=> ( ! [X1] :
( sK0 = X1
| ~ is_state(X1) )
& is_state(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ! [X1] :
( X0 = X1
| ~ is_state(X1) )
& is_state(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
~ ! [X0] :
( is_state(X0)
=> ~ ! [X1] :
( is_state(X1)
=> X0 = X1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1] :
( is_state(X1)
=> ~ ! [X0] :
( is_state(X0)
=> X0 = X1 ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1] :
( is_state(X1)
=> ~ ! [X0] :
( is_state(X0)
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
fof(f25,plain,
is_state(sK2),
inference(subsumption_resolution,[],[f21,f17]) ).
fof(f17,plain,
hoare_165779456gleton,
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
hoare_165779456gleton,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f21,plain,
( is_state(sK2)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( ( sK1 != sK2
& is_state(sK2)
& is_state(sK1) )
| ~ hoare_165779456gleton ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f12,f15]) ).
fof(f15,plain,
( ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) )
=> ( sK1 != sK2
& is_state(sK2)
& is_state(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) )
| ~ hoare_165779456gleton ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
( hoare_165779456gleton
=> ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
( hoare_165779456gleton
<=> ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
fof(f24,plain,
sK1 != sK2,
inference(subsumption_resolution,[],[f22,f17]) ).
fof(f22,plain,
( sK1 != sK2
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
sK0 = sK1,
inference(resolution,[],[f26,f19]) ).
fof(f26,plain,
is_state(sK1),
inference(subsumption_resolution,[],[f20,f17]) ).
fof(f20,plain,
( is_state(sK1)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW469+1 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 19:10:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.74 % (3545)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.52/0.74 % (3545)Refutation not found, incomplete strategy% (3545)------------------------------
% 0.52/0.74 % (3545)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3545)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (3545)Memory used [KB]: 951
% 0.52/0.74 % (3545)Time elapsed: 0.001 s
% 0.52/0.74 % (3545)Instructions burned: 2 (million)
% 0.52/0.74 % (3545)------------------------------
% 0.52/0.74 % (3545)------------------------------
% 0.52/0.74 % (3538)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.74 % (3540)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.74 % (3539)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.74 % (3542)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.52/0.74 % (3543)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.74 % (3541)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.74 % (3544)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.52/0.74 % (3542)Refutation not found, incomplete strategy% (3542)------------------------------
% 0.52/0.74 % (3542)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3538)Refutation not found, incomplete strategy% (3538)------------------------------
% 0.52/0.74 % (3538)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3538)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (3538)Memory used [KB]: 969
% 0.52/0.74 % (3538)Time elapsed: 0.003 s
% 0.52/0.74 % (3538)Instructions burned: 2 (million)
% 0.52/0.74 % (3543)Refutation not found, incomplete strategy% (3543)------------------------------
% 0.52/0.74 % (3543)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3543)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (3543)Memory used [KB]: 951
% 0.52/0.74 % (3543)Time elapsed: 0.002 s
% 0.52/0.74 % (3543)Instructions burned: 2 (million)
% 0.52/0.74 % (3540)First to succeed.
% 0.52/0.74 % (3542)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (3542)Memory used [KB]: 967
% 0.52/0.74 % (3542)Time elapsed: 0.002 s
% 0.52/0.74 % (3542)Instructions burned: 2 (million)
% 0.52/0.74 % (3541)Also succeeded, but the first one will report.
% 0.52/0.74 % (3539)Refutation not found, incomplete strategy% (3539)------------------------------
% 0.52/0.74 % (3539)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3538)------------------------------
% 0.52/0.74 % (3538)------------------------------
% 0.52/0.74 % (3539)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.74
% 0.52/0.74 % (3539)Memory used [KB]: 963
% 0.52/0.74 % (3539)Time elapsed: 0.003 s
% 0.52/0.74 % (3539)Instructions burned: 2 (million)
% 0.52/0.74 % (3543)------------------------------
% 0.52/0.74 % (3543)------------------------------
% 0.52/0.74 % (3544)Also succeeded, but the first one will report.
% 0.52/0.74 % (3542)------------------------------
% 0.52/0.74 % (3542)------------------------------
% 0.52/0.74 % (3540)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3537"
% 0.52/0.74 % (3539)------------------------------
% 0.52/0.74 % (3539)------------------------------
% 0.52/0.74 % (3546)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.52/0.74 % (3540)Refutation found. Thanks to Tanya!
% 0.52/0.74 % SZS status Theorem for theBenchmark
% 0.52/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.74 % (3540)------------------------------
% 0.52/0.74 % (3540)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.74 % (3540)Termination reason: Refutation
% 0.52/0.74
% 0.52/0.74 % (3540)Memory used [KB]: 969
% 0.52/0.74 % (3540)Time elapsed: 0.004 s
% 0.52/0.74 % (3540)Instructions burned: 2 (million)
% 0.52/0.74 % (3537)Success in time 0.379 s
% 0.61/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------