TSTP Solution File: SWV161+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV161+1 : TPTP v8.1.2. Bugfixed 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 : n008.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:02:44 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 101 ( 32 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 105 ( 29 ~; 19 |; 45 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 29 ( 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f287,plain,
$false,
inference(subsumption_resolution,[],[f281,f113]) ).
fof(f113,plain,
n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
( n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index))
& leq(sK0,pv10)
& leq(n0,sK0)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f109,f110]) ).
fof(f110,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(X0,pv10)
& leq(n0,X0) )
=> ( n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index))
& leq(sK0,pv10)
& leq(n0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(X0,pv10)
& leq(n0,X0) )
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(rectify,[],[f97]) ).
fof(f97,plain,
( ? [X1] :
( n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index))
& leq(X1,pv10)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(flattening,[],[f96]) ).
fof(f96,plain,
( ? [X1] :
( n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index))
& leq(X1,pv10)
& leq(n0,X1) )
& ! [X0] :
( n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index))
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X0) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ( ( ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> n1 = sum(n0,n4,a_select3(q,X0,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X1] :
( ( leq(X1,pv10)
& leq(n0,X1) )
=> n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X17] :
( ( leq(X17,pv10)
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ! [X13] :
( ( leq(X13,pred(pv10))
& leq(n0,X13) )
=> n1 = sum(n0,n4,a_select3(q,X13,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) )
=> ! [X17] :
( ( leq(X17,pv10)
& leq(n0,X17) )
=> n1 = sum(n0,n4,a_select3(q,X17,tptp_sum_index)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kkunpmasgy/Vampire---4.8_31463',cl5_nebula_norm_0011) ).
fof(f281,plain,
n1 != sum(n0,n4,a_select3(q,pv10,tptp_sum_index)),
inference(backward_demodulation,[],[f119,f275]) ).
fof(f275,plain,
pv10 = sK0,
inference(unit_resulting_resolution,[],[f118,f266,f125]) ).
fof(f125,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.kkunpmasgy/Vampire---4.8_31463',leq_gt2) ).
fof(f266,plain,
~ gt(pv10,sK0),
inference(unit_resulting_resolution,[],[f217,f123]) ).
fof(f123,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.kkunpmasgy/Vampire---4.8_31463',leq_gt_pred) ).
fof(f217,plain,
~ leq(sK0,pred(pv10)),
inference(unit_resulting_resolution,[],[f117,f119,f116]) ).
fof(f116,plain,
! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(X1,pred(pv10))
| ~ leq(n0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f117,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f111]) ).
fof(f118,plain,
leq(sK0,pv10),
inference(cnf_transformation,[],[f111]) ).
fof(f119,plain,
n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index)),
inference(cnf_transformation,[],[f111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.14/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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 18:40:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/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/tmp/tmp.kkunpmasgy/Vampire---4.8_31463
% 0.58/0.74 % (31664)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.58/0.74 % (31667)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.58/0.74 % (31660)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.58/0.74 % (31663)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.58/0.74 % (31662)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.58/0.74 % (31661)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.58/0.74 % (31665)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.58/0.74 % (31666)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.58/0.74 % (31663)First to succeed.
% 0.58/0.74 % (31664)Instruction limit reached!
% 0.58/0.74 % (31664)------------------------------
% 0.58/0.74 % (31664)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.74 % (31666)Also succeeded, but the first one will report.
% 0.58/0.74 % (31664)Termination reason: Unknown
% 0.58/0.74 % (31664)Termination phase: Saturation
% 0.58/0.74
% 0.58/0.74 % (31664)Memory used [KB]: 1429
% 0.58/0.74 % (31664)Time elapsed: 0.010 s
% 0.58/0.74 % (31664)Instructions burned: 34 (million)
% 0.58/0.74 % (31664)------------------------------
% 0.58/0.74 % (31664)------------------------------
% 0.58/0.75 % (31663)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (31663)------------------------------
% 0.58/0.75 % (31663)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (31663)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (31663)Memory used [KB]: 1174
% 0.58/0.75 % (31663)Time elapsed: 0.007 s
% 0.58/0.75 % (31663)Instructions burned: 9 (million)
% 0.58/0.75 % (31663)------------------------------
% 0.58/0.75 % (31663)------------------------------
% 0.58/0.75 % (31619)Success in time 0.377 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------