TSTP Solution File: SWV408+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV408+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 : n029.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:38 EDT 2024
% Result : Theorem 0.61s 0.83s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 94 ( 11 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 99 ( 41 ~; 37 |; 14 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 54 ( 41 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f237,plain,
$false,
inference(avatar_sat_refutation,[],[f124,f197,f235]) ).
fof(f235,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f234]) ).
fof(f234,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f225,f87]) ).
fof(f87,plain,
! [X0] : ~ contains_slb(create_slb,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] : ~ contains_slb(create_slb,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f225,plain,
( contains_slb(create_slb,sK4)
| ~ spl5_1 ),
inference(superposition,[],[f72,f119]) ).
fof(f119,plain,
( create_slb = sK2
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f117,plain,
( spl5_1
<=> create_slb = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f72,plain,
contains_slb(sK2,sK4),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l44_co) ).
fof(f197,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f196]) ).
fof(f196,plain,
( $false
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f195,f186]) ).
fof(f186,plain,
( less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1)))
| ~ spl5_2 ),
inference(unit_resulting_resolution,[],[f72,f123,f74,f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( less_than(X2,sK0(X0,X1,X2))
| ~ strictly_less_than(X1,X2)
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(flattening,[],[f49]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ strictly_less_than(X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( strictly_less_than(X1,X2)
& contains_slb(X0,X1) )
=> ( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l44_l45) ).
fof(f74,plain,
~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)),
inference(cnf_transformation,[],[f52]) ).
fof(f123,plain,
( strictly_less_than(sK4,findmin_pqp_res(sK1))
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f121,plain,
( spl5_2
<=> strictly_less_than(sK4,findmin_pqp_res(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f195,plain,
( ~ less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1)))
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f194,f72]) ).
fof(f194,plain,
( ~ contains_slb(sK2,sK4)
| ~ less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1)))
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f193,f74]) ).
fof(f193,plain,
( pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
| ~ contains_slb(sK2,sK4)
| ~ less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1)))
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f191,f123]) ).
fof(f191,plain,
( ~ strictly_less_than(sK4,findmin_pqp_res(sK1))
| pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
| ~ contains_slb(sK2,sK4)
| ~ less_than(findmin_pqp_res(sK1),sK0(sK2,sK4,findmin_pqp_res(sK1))) ),
inference(resolution,[],[f69,f71]) ).
fof(f71,plain,
! [X4] :
( ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4)
| ~ less_than(findmin_pqp_res(sK1),X4) ),
inference(cnf_transformation,[],[f52]) ).
fof(f69,plain,
! [X2,X0,X1] :
( pair_in_list(update_slb(X0,X2),X1,sK0(X0,X1,X2))
| ~ strictly_less_than(X1,X2)
| pair_in_list(update_slb(X0,X2),X1,X2)
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
fof(f124,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f115,f121,f117]) ).
fof(f115,plain,
( strictly_less_than(sK4,findmin_pqp_res(sK1))
| create_slb = sK2 ),
inference(superposition,[],[f73,f94]) ).
fof(f94,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(rectify,[],[f39]) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( create_slb != X1
=> findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f73,plain,
strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3))),
inference(cnf_transformation,[],[f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWV408+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.13 % 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.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 08:52:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 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.61/0.82 % (11429)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.61/0.82 % (11431)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.82 % (11432)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.61/0.82 % (11430)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.61/0.82 % (11433)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.61/0.82 % (11435)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.61/0.82 % (11434)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.61/0.82 % (11436)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.61/0.82 % (11435)First to succeed.
% 0.61/0.82 % (11435)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11428"
% 0.61/0.83 % (11435)Refutation found. Thanks to Tanya!
% 0.61/0.83 % SZS status Theorem for theBenchmark
% 0.61/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.83 % (11435)------------------------------
% 0.61/0.83 % (11435)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (11435)Termination reason: Refutation
% 0.61/0.83
% 0.61/0.83 % (11435)Memory used [KB]: 1138
% 0.61/0.83 % (11435)Time elapsed: 0.007 s
% 0.61/0.83 % (11435)Instructions burned: 9 (million)
% 0.61/0.83 % (11428)Success in time 0.482 s
% 0.61/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------