TSTP Solution File: AGT004+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : AGT004+2 : TPTP v8.2.0. Bugfixed v3.1.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 : n011.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 : Mon May 20 17:58:33 EDT 2024
% Result : Theorem 0.64s 0.83s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 32 ( 14 ~; 9 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1284,plain,
$false,
inference(subsumption_resolution,[],[f1281,f1010]) ).
fof(f1010,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(cnf_transformation,[],[f282]) ).
fof(f282,axiom,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',deduced_13) ).
fof(f1281,plain,
accept_city(countryamedicalorganization,coastvillage),
inference(resolution,[],[f953,f1032]) ).
fof(f1032,plain,
! [X2,X3,X0,X1] :
( ~ accept_team(X0,X3,X1,X2)
| accept_city(X0,X1) ),
inference(cnf_transformation,[],[f952]) ).
fof(f952,plain,
! [X0,X1,X2,X3] :
( ( accept_team(X0,X3,X1,X2)
| ~ accept_number(X0,X2)
| ~ accept_leader(X0,X3)
| ~ accept_city(X0,X1) )
& ( ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) )
| ~ accept_team(X0,X3,X1,X2) ) ),
inference(flattening,[],[f951]) ).
fof(f951,plain,
! [X0,X1,X2,X3] :
( ( accept_team(X0,X3,X1,X2)
| ~ accept_number(X0,X2)
| ~ accept_leader(X0,X3)
| ~ accept_city(X0,X1) )
& ( ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) )
| ~ accept_team(X0,X3,X1,X2) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2,X3] :
( accept_team(X0,X3,X1,X2)
<=> ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_1) ).
fof(f953,plain,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(cnf_transformation,[],[f925]) ).
fof(f925,plain,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(flattening,[],[f924]) ).
fof(f924,negated_conjecture,
~ ~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(negated_conjecture,[],[f923]) ).
fof(f923,conjecture,
~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : AGT004+2 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.08/0.16 % 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.16/0.38 % Computer : n011.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sat May 18 18:51:23 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.39 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.64/0.82 % (6320)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.64/0.82 % (6321)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.64/0.82 % (6323)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.64/0.82 % (6325)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.64/0.82 % (6327)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.64/0.82 % (6322)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.64/0.82 % (6326)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.64/0.82 % (6323)Refutation not found, incomplete strategy% (6323)------------------------------
% 0.64/0.82 % (6323)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.82 % (6323)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (6323)Memory used [KB]: 1489
% 0.64/0.82 % (6323)Time elapsed: 0.004 s
% 0.64/0.82 % (6323)Instructions burned: 6 (million)
% 0.64/0.82 % (6323)------------------------------
% 0.64/0.82 % (6323)------------------------------
% 0.64/0.82 % (6325)First to succeed.
% 0.64/0.82 % (6324)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.64/0.82 % (6320)Also succeeded, but the first one will report.
% 0.64/0.82 % (6325)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6318"
% 0.64/0.83 % (6327)Refutation not found, incomplete strategy% (6327)------------------------------
% 0.64/0.83 % (6327)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83 % (6327)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.83
% 0.64/0.83 % (6327)Memory used [KB]: 1525
% 0.64/0.83 % (6327)Time elapsed: 0.006 s
% 0.64/0.83 % (6327)Instructions burned: 9 (million)
% 0.64/0.83 % (6325)Refutation found. Thanks to Tanya!
% 0.64/0.83 % SZS status Theorem for theBenchmark
% 0.64/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.64/0.83 % (6325)------------------------------
% 0.64/0.83 % (6325)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83 % (6325)Termination reason: Refutation
% 0.64/0.83
% 0.64/0.83 % (6325)Memory used [KB]: 1535
% 0.64/0.83 % (6325)Time elapsed: 0.006 s
% 0.64/0.83 % (6325)Instructions burned: 10 (million)
% 0.64/0.83 % (6318)Success in time 0.436 s
% 0.64/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------