TSTP Solution File: SWV373+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV373+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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:28 EDT 2024
% Result : Theorem 0.61s 0.85s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 87 ( 27 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 78 ( 34 ~; 26 |; 7 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 65 ( 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f160,plain,
$false,
inference(avatar_sat_refutation,[],[f117,f154,f159]) ).
fof(f159,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f158]) ).
fof(f158,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f157,f111]) ).
fof(f111,plain,
( create_slb != sK1
| spl3_1 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl3_1
<=> create_slb = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f157,plain,
( create_slb = sK1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f156,f116]) ).
fof(f116,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f114]) ).
fof(f114,plain,
( spl3_2
<=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f156,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(superposition,[],[f133,f91]) ).
fof(f91,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,[],[f47]) ).
fof(f47,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/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f133,plain,
~ contains_slb(sK1,findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(resolution,[],[f78,f96]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).
fof(f78,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f53,f70]) ).
fof(f70,plain,
( ? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2))) )
=> ( ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& ~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ok(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ contains_cpq(triple(X0,X1,X2),findmin_cpq_res(triple(X0,X1,X2)))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_co) ).
fof(f154,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f153]) ).
fof(f153,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f152,f90]) ).
fof(f90,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f152,plain,
( ok(triple(sK0,create_slb,bad))
| ~ spl3_1 ),
inference(forward_demodulation,[],[f149,f97]) ).
fof(f97,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f149,plain,
( ok(findmin_cpq_eff(triple(sK0,create_slb,sK2)))
| ~ spl3_1 ),
inference(superposition,[],[f79,f112]) ).
fof(f112,plain,
( create_slb = sK1
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f79,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f71]) ).
fof(f117,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f108,f114,f110]) ).
fof(f108,plain,
( contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(subsumption_resolution,[],[f105,f90]) ).
fof(f105,plain,
( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
| contains_slb(sK1,findmin_pqp_res(sK0))
| create_slb = sK1 ),
inference(superposition,[],[f79,f94]) ).
fof(f94,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(flattening,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1 ),
inference(ennf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1 )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& create_slb != X1 )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV373+1 : TPTP v8.2.0. Released v3.3.0.
% 0.13/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 : n005.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 : Sun May 19 07:50:08 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/benchmark/theBenchmark.p
% 0.61/0.84 % (25091)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.84 % (25088)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.84 % (25090)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.84 % (25089)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.84 % (25093)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.84 % (25092)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.84 % (25094)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.84 % (25095)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.84 % (25088)Refutation not found, incomplete strategy% (25088)------------------------------
% 0.61/0.84 % (25088)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.84 % (25088)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.84
% 0.61/0.84 % (25088)Memory used [KB]: 1117
% 0.61/0.84 % (25095)Refutation not found, incomplete strategy% (25095)------------------------------
% 0.61/0.84 % (25095)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.84 % (25095)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.84
% 0.61/0.84 % (25095)Memory used [KB]: 1099
% 0.61/0.84 % (25095)Time elapsed: 0.003 s
% 0.61/0.84 % (25095)Instructions burned: 3 (million)
% 0.61/0.84 % (25088)Time elapsed: 0.005 s
% 0.61/0.84 % (25088)Instructions burned: 5 (million)
% 0.61/0.84 % (25093)First to succeed.
% 0.61/0.84 % (25095)------------------------------
% 0.61/0.84 % (25095)------------------------------
% 0.61/0.84 % (25088)------------------------------
% 0.61/0.84 % (25088)------------------------------
% 0.61/0.84 % (25094)Also succeeded, but the first one will report.
% 0.61/0.84 % (25093)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25025"
% 0.61/0.84 % (25090)Also succeeded, but the first one will report.
% 0.61/0.84 % (25089)Also succeeded, but the first one will report.
% 0.61/0.85 % (25093)Refutation found. Thanks to Tanya!
% 0.61/0.85 % SZS status Theorem for theBenchmark
% 0.61/0.85 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.85 % (25093)------------------------------
% 0.61/0.85 % (25093)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.85 % (25093)Termination reason: Refutation
% 0.61/0.85
% 0.61/0.85 % (25093)Memory used [KB]: 1124
% 0.61/0.85 % (25093)Time elapsed: 0.005 s
% 0.61/0.85 % (25093)Instructions burned: 6 (million)
% 0.61/0.85 % (25025)Success in time 0.477 s
% 0.61/0.85 % Vampire---4.8 exiting
%------------------------------------------------------------------------------