TSTP Solution File: SWV413+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV413+1 : TPTP v8.2.0. 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 : n025.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 05:55:39 EDT 2024
% Result : Theorem 0.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 66 ( 25 ~; 15 |; 22 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 32 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(subsumption_resolution,[],[f80,f40]) ).
fof(f40,plain,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( ! [X4] :
( ~ less_than(sK3,X4)
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X4) )
& less_than(sK3,sK2)
& strictly_less_than(sK1,sK3)
& pair_in_list(sK0,sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f26,f31]) ).
fof(f31,plain,
( ? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ( ! [X4] :
( ~ less_than(sK3,X4)
| ~ pair_in_list(update_slb(sK0,sK3),sK1,X4) )
& less_than(sK3,sK2)
& strictly_less_than(sK1,sK3)
& pair_in_list(sK0,sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(X3,X4)
| ~ pair_in_list(update_slb(X0,X3),X1,X4) )
& less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) ) ),
inference(negated_conjecture,[],[f20]) ).
fof(f20,conjecture,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l49_co) ).
fof(f80,plain,
~ less_than(sK3,sK2),
inference(resolution,[],[f77,f38]) ).
fof(f38,plain,
pair_in_list(sK0,sK1,sK2),
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
! [X0] :
( ~ pair_in_list(sK0,sK1,X0)
| ~ less_than(sK3,X0) ),
inference(duplicate_literal_removal,[],[f76]) ).
fof(f76,plain,
! [X0] :
( ~ less_than(sK3,X0)
| ~ pair_in_list(sK0,sK1,X0)
| ~ less_than(sK3,X0) ),
inference(resolution,[],[f37,f41]) ).
fof(f41,plain,
! [X4] :
( ~ pair_in_list(update_slb(sK0,sK3),sK1,X4)
| ~ less_than(sK3,X4) ),
inference(cnf_transformation,[],[f32]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l49_li3637) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV413+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/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.12/0.35 % Computer : n025.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 09:03:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.12/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.60/0.84 % (23795)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 (2995ds/34Mi)
% 0.60/0.84 % (23796)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.84 % (23793)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.84 % (23797)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 (2995ds/83Mi)
% 0.60/0.84 % (23791)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 (2995ds/34Mi)
% 0.60/0.84 % (23792)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 (2995ds/51Mi)
% 0.60/0.84 % (23794)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.84 % (23798)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 (2995ds/56Mi)
% 0.60/0.84 % (23795)Also succeeded, but the first one will report.
% 0.60/0.84 % (23798)First to succeed.
% 0.60/0.84 % (23791)Also succeeded, but the first one will report.
% 0.60/0.84 % (23798)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23790"
% 0.60/0.84 % (23794)Also succeeded, but the first one will report.
% 0.60/0.84 % (23797)Also succeeded, but the first one will report.
% 0.60/0.84 % (23796)Also succeeded, but the first one will report.
% 0.60/0.84 % (23798)Refutation found. Thanks to Tanya!
% 0.60/0.84 % SZS status Theorem for theBenchmark
% 0.60/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.84 % (23798)------------------------------
% 0.60/0.84 % (23798)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.84 % (23798)Termination reason: Refutation
% 0.60/0.84
% 0.60/0.84 % (23798)Memory used [KB]: 1078
% 0.60/0.84 % (23798)Time elapsed: 0.003 s
% 0.60/0.84 % (23798)Instructions burned: 4 (million)
% 0.60/0.84 % (23790)Success in time 0.485 s
% 0.60/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------