TSTP Solution File: SWV388+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV388+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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 May 1 04:03:47 EDT 2024
% Result : Theorem 0.63s 0.80s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 35 ( 17 ~; 4 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 75 ( 75 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 25 ( 15 !; 9 ?; 4 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_10,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f80,plain,
$false,
inference(subsumption_resolution,[],[f79,f65]) ).
tff(f65,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f63]) ).
tff(f63,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f59,f62]) ).
tff(f62,plain,
( ? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) )
=> ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ check_cpq(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
tff(f59,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f58]) ).
tff(f58,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
tff(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[],[f43]) ).
tff(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XGvFhndfLC/Vampire---4.8_23601',l24_co) ).
tff(f79,plain,
check_cpq(triple(sK0,sK1,sK2)),
inference(resolution,[],[f64,f66]) ).
tff(f66,plain,
check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f63]) ).
tff(f64,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f57]) ).
tff(f57,plain,
! [X0,X1,X2] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f42]) ).
tff(f42,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.XGvFhndfLC/Vampire---4.8_23601',l24_l34) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV388+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.11 % 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.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 30 18:58:03 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.31 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/tmp/tmp.XGvFhndfLC/Vampire---4.8_23601
% 0.63/0.80 % (23714)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.63/0.80 % (23713)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.63/0.80 % (23711)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 (2995ds/34Mi)
% 0.63/0.80 % (23715)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 (2995ds/34Mi)
% 0.63/0.80 % (23712)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 (2995ds/51Mi)
% 0.63/0.80 % (23717)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 (2995ds/83Mi)
% 0.63/0.80 % (23716)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.63/0.80 % (23718)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 (2995ds/56Mi)
% 0.63/0.80 % (23711)First to succeed.
% 0.63/0.80 % (23718)Also succeeded, but the first one will report.
% 0.63/0.80 % (23714)Also succeeded, but the first one will report.
% 0.63/0.80 % (23711)Refutation found. Thanks to Tanya!
% 0.63/0.80 % SZS status Theorem for Vampire---4
% 0.63/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.80 % (23711)------------------------------
% 0.63/0.80 % (23711)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.80 % (23711)Termination reason: Refutation
% 0.63/0.80
% 0.63/0.80 % (23711)Memory used [KB]: 1076
% 0.63/0.80 % (23711)Time elapsed: 0.004 s
% 0.63/0.80 % (23711)Instructions burned: 3 (million)
% 0.63/0.80 % (23711)------------------------------
% 0.63/0.80 % (23711)------------------------------
% 0.63/0.80 % (23708)Success in time 0.483 s
% 0.63/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------