TSTP Solution File: SWV405+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV405+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 : n002.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:50 EDT 2024
% Result : Theorem 0.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 59 ( 23 ~; 17 |; 12 &)
% ( 2 <=>; 4 =>; 0 <=; 1 <~>)
% 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 : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 46 ( 28 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,plain,
$false,
inference(subsumption_resolution,[],[f86,f78]) ).
fof(f78,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox2/tmp/tmp.zrGKQ8SS7b/Vampire---4.8_6989',ax36) ).
fof(f86,plain,
~ check_cpq(triple(sK0,create_slb,sK1)),
inference(subsumption_resolution,[],[f65,f74]) ).
fof(f74,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox2/tmp/tmp.zrGKQ8SS7b/Vampire---4.8_6989',ax22) ).
fof(f65,plain,
( pair_in_list(create_slb,sK2,sK3)
| ~ check_cpq(triple(sK0,create_slb,sK1)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
( ( ( ~ less_than(sK3,sK2)
& pair_in_list(create_slb,sK2,sK3) )
| ~ check_cpq(triple(sK0,create_slb,sK1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(sK0,create_slb,sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f57,f59,f58]) ).
fof(f58,plain,
( ? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(X0,create_slb,X1)) ) )
=> ( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(sK0,create_slb,sK1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(sK0,create_slb,sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
=> ( ~ less_than(sK3,sK2)
& pair_in_list(create_slb,sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X4,X5] :
( less_than(X5,X4)
| ~ pair_in_list(create_slb,X4,X5) )
| check_cpq(triple(X0,create_slb,X1)) ) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
? [X0,X1] :
( ( ? [X2,X3] :
( ~ less_than(X3,X2)
& pair_in_list(create_slb,X2,X3) )
| ~ check_cpq(triple(X0,create_slb,X1)) )
& ( ! [X2,X3] :
( less_than(X3,X2)
| ~ pair_in_list(create_slb,X2,X3) )
| check_cpq(triple(X0,create_slb,X1)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
? [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<~> ! [X2,X3] :
( less_than(X3,X2)
| ~ pair_in_list(create_slb,X2,X3) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,negated_conjecture,
~ ! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
inference(negated_conjecture,[],[f42]) ).
fof(f42,conjecture,
! [X0,X1] :
( check_cpq(triple(X0,create_slb,X1))
<=> ! [X2,X3] :
( pair_in_list(create_slb,X2,X3)
=> less_than(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zrGKQ8SS7b/Vampire---4.8_6989',l41_co) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.15 % 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.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 18:52:40 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 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.zrGKQ8SS7b/Vampire---4.8_6989
% 0.59/0.78 % (7198)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.59/0.78 % (7200)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.59/0.78 % (7198)First to succeed.
% 0.59/0.78 % (7193)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.59/0.78 % (7195)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.59/0.78 % (7196)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.59/0.78 % (7194)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.59/0.78 % (7197)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.59/0.78 % (7199)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.59/0.78 % (7200)Also succeeded, but the first one will report.
% 0.59/0.78 % (7198)Refutation found. Thanks to Tanya!
% 0.59/0.78 % SZS status Theorem for Vampire---4
% 0.59/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.78 % (7198)------------------------------
% 0.59/0.78 % (7198)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.78 % (7198)Termination reason: Refutation
% 0.59/0.78
% 0.59/0.78 % (7198)Memory used [KB]: 1071
% 0.59/0.78 % (7198)Time elapsed: 0.004 s
% 0.59/0.78 % (7198)Instructions burned: 3 (million)
% 0.59/0.78 % (7198)------------------------------
% 0.59/0.78 % (7198)------------------------------
% 0.59/0.78 % (7171)Success in time 0.409 s
% 0.59/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------