TSTP Solution File: SWV389+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV389+1 : TPTP v8.1.2. Released v3.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 : n007.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 : Sun May 5 10:29:26 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 47 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 23 ~; 11 |; 11 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 32 ( 23 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f108,plain,
$false,
inference(subsumption_resolution,[],[f107,f97]) ).
fof(f97,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f73,f81]) ).
fof(f81,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox/tmp/tmp.c99Qec4M1V/Vampire---4.8_30710',ax52) ).
fof(f73,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
( ok(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f54,f68]) ).
fof(f68,plain,
( ? [X0,X1,X2] :
( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) )
=> ( ok(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/tmp/tmp.c99Qec4M1V/Vampire---4.8_30710',l25_co) ).
fof(f107,plain,
~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))),
inference(subsumption_resolution,[],[f106,f72]) ).
fof(f72,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f69]) ).
fof(f106,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))) ),
inference(resolution,[],[f95,f96]) ).
fof(f96,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),findmin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f74,f81]) ).
fof(f74,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f69]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))))
| check_cpq(triple(X0,X1,X2))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))) ),
inference(definition_unfolding,[],[f71,f81,f81]) ).
fof(f71,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.c99Qec4M1V/Vampire---4.8_30710',l25_l40) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV389+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.15 % 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.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 21:08:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/tmp/tmp.c99Qec4M1V/Vampire---4.8_30710
% 0.59/0.75 % (31074)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.76 % (31066)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.76 % (31069)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.76 % (31068)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 Vampire---4 for (2996ds/51Mi)
% 0.59/0.76 % (31074)First to succeed.
% 0.59/0.76 % (31071)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 Vampire---4 for (2996ds/34Mi)
% 0.59/0.76 % (31070)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.76 % (31072)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.76 % (31073)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 Vampire---4 for (2996ds/83Mi)
% 0.59/0.76 % (31074)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30962"
% 0.59/0.76 % (31074)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (31074)------------------------------
% 0.59/0.76 % (31074)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (31074)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (31074)Memory used [KB]: 1069
% 0.59/0.76 % (31074)Time elapsed: 0.002 s
% 0.59/0.76 % (31074)Instructions burned: 4 (million)
% 0.59/0.76 % (30962)Success in time 0.384 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------