TSTP Solution File: COM003-2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM003-2 : TPTP v8.2.0. Released v1.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 19:09:54 EDT 2024
% Result : Unsatisfiable 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 38 ( 3 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 80 ( 41 ~; 34 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 6 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f178,plain,
$false,
inference(avatar_sat_refutation,[],[f101,f117,f131,f150,f167,f177]) ).
fof(f177,plain,
( ~ spl4_15
| ~ spl4_17 ),
inference(avatar_contradiction_clause,[],[f176]) ).
fof(f176,plain,
( $false
| ~ spl4_15
| ~ spl4_17 ),
inference(subsumption_resolution,[],[f173,f134]) ).
fof(f134,plain,
( ! [X0,X1] : halts2(X0,X1)
| ~ spl4_15 ),
inference(unit_resulting_resolution,[],[f127,f11]) ).
fof(f11,axiom,
! [X0,X1] :
( halts2(X0,X1)
| ~ program_halts2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts3a) ).
fof(f127,plain,
( ! [X2,X1] : program_halts2(X1,X2)
| ~ spl4_15 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f126,plain,
( spl4_15
<=> ! [X2,X1] : program_halts2(X1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_15])]) ).
fof(f173,plain,
( ! [X0,X1] : ~ halts2(X0,X1)
| ~ spl4_17 ),
inference(resolution,[],[f149,f17]) ).
fof(f17,axiom,
! [X0,X1] :
( ~ program_not_halts2(X0,X1)
| ~ halts2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts3a) ).
fof(f149,plain,
( ! [X2,X1] : program_not_halts2(X1,X2)
| ~ spl4_17 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f148,plain,
( spl4_17
<=> ! [X2,X1] : program_not_halts2(X1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_17])]) ).
fof(f167,plain,
( ~ spl4_12
| ~ spl4_16 ),
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f166,plain,
( $false
| ~ spl4_12
| ~ spl4_16 ),
inference(subsumption_resolution,[],[f153,f118]) ).
fof(f118,plain,
( program(c1)
| ~ spl4_12 ),
inference(unit_resulting_resolution,[],[f100,f4]) ).
fof(f4,axiom,
! [X0] :
( ~ program_program_decides(X0)
| program(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_program_decides1) ).
fof(f100,plain,
( program_program_decides(c1)
| ~ spl4_12 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f98,plain,
( spl4_12
<=> program_program_decides(c1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_12])]) ).
fof(f153,plain,
( ~ program(c1)
| ~ spl4_12
| ~ spl4_16 ),
inference(unit_resulting_resolution,[],[f119,f130,f6]) ).
fof(f6,axiom,
! [X0] :
( program_program_decides(X0)
| ~ program(X0)
| ~ program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_program_decides3) ).
fof(f130,plain,
( ! [X0] : ~ program_program_decides(X0)
| ~ spl4_16 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f129,plain,
( spl4_16
<=> ! [X0] : ~ program_program_decides(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_16])]) ).
fof(f119,plain,
( program_decides(c1)
| ~ spl4_12 ),
inference(unit_resulting_resolution,[],[f100,f5]) ).
fof(f5,axiom,
! [X0] :
( ~ program_program_decides(X0)
| program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_program_decides2) ).
fof(f150,plain,
( spl4_17
| spl4_16 ),
inference(avatar_split_clause,[],[f145,f129,f148]) ).
fof(f145,plain,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_not_halts2(X1,X2) ),
inference(resolution,[],[f36,f25]) ).
fof(f25,axiom,
! [X2,X3,X0,X1] :
( ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3)
| program_not_halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).
fof(f36,axiom,
! [X2,X3,X1] :
( program_not_halts2_halts3_outputs(X3,X1,X2,bad)
| ~ program_program_decides(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_2) ).
fof(f131,plain,
( spl4_15
| spl4_16 ),
inference(avatar_split_clause,[],[f123,f129,f126]) ).
fof(f123,plain,
! [X2,X0,X1] :
( ~ program_program_decides(X0)
| program_halts2(X1,X2) ),
inference(resolution,[],[f35,f22]) ).
fof(f22,axiom,
! [X2,X3,X0,X1] :
( ~ program_halts2_halts3_outputs(X0,X1,X2,X3)
| program_halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
fof(f35,axiom,
! [X2,X3,X1] :
( program_halts2_halts3_outputs(X3,X1,X2,good)
| ~ program_program_decides(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_1) ).
fof(f117,plain,
~ spl4_11,
inference(avatar_contradiction_clause,[],[f114]) ).
fof(f114,plain,
( $false
| ~ spl4_11 ),
inference(unit_resulting_resolution,[],[f43,f96]) ).
fof(f96,plain,
( ! [X0] : ~ algorithm_program_decides(X0)
| ~ spl4_11 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f95,plain,
( spl4_11
<=> ! [X0] : ~ algorithm_program_decides(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_11])]) ).
fof(f43,axiom,
algorithm_program_decides(c4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
fof(f101,plain,
( spl4_11
| spl4_12 ),
inference(avatar_split_clause,[],[f34,f98,f95]) ).
fof(f34,axiom,
! [X0] :
( program_program_decides(c1)
| ~ algorithm_program_decides(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : COM003-2 : TPTP v8.2.0. Released v1.1.0.
% 0.13/0.15 % 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.14/0.37 % Computer : n011.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sun May 19 10:16:38 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.37 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.14/0.37 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.80 % (5819)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.80 % (5816)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.80 % (5813)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.80 % (5815)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.80 % (5814)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.81 % (5819)First to succeed.
% 0.60/0.81 % (5813)Also succeeded, but the first one will report.
% 0.60/0.81 % (5819)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5812"
% 0.60/0.81 % (5820)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.81 % (5814)Also succeeded, but the first one will report.
% 0.60/0.81 % (5819)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Unsatisfiable for theBenchmark
% 0.60/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.81 % (5819)------------------------------
% 0.60/0.81 % (5819)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (5819)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (5819)Memory used [KB]: 1025
% 0.60/0.81 % (5819)Time elapsed: 0.003 s
% 0.60/0.81 % (5819)Instructions burned: 5 (million)
% 0.60/0.81 % (5812)Success in time 0.432 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------