TSTP Solution File: GEO219+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO219+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 : n004.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 20:09:33 EDT 2024
% Result : Theorem 0.54s 0.77s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 122 ( 60 ~; 33 |; 21 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 55 ( 46 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(avatar_sat_refutation,[],[f69,f79]) ).
fof(f79,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f77,f58]) ).
fof(f58,plain,
( convergent_lines(sK1,sK2)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f57,plain,
( spl3_2
<=> convergent_lines(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f77,plain,
~ convergent_lines(sK1,sK2),
inference(subsumption_resolution,[],[f72,f36]) ).
fof(f36,plain,
~ convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
( unorthogonal_lines(sK1,sK2)
& ~ convergent_lines(sK0,sK2)
& ~ unorthogonal_lines(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f25,f33]) ).
fof(f33,plain,
( ? [X0,X1,X2] :
( unorthogonal_lines(X1,X2)
& ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) )
=> ( unorthogonal_lines(sK1,sK2)
& ~ convergent_lines(sK0,sK2)
& ~ unorthogonal_lines(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
? [X0,X1,X2] :
( unorthogonal_lines(X1,X2)
& ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
? [X0,X1,X2] :
( unorthogonal_lines(X1,X2)
& ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,plain,
~ ! [X0,X1,X2] :
( ( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) )
=> ~ unorthogonal_lines(X1,X2) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ! [X5,X6,X7] :
( ( ~ convergent_lines(X5,X7)
& ~ unorthogonal_lines(X5,X6) )
=> ~ unorthogonal_lines(X6,X7) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
! [X5,X6,X7] :
( ( ~ convergent_lines(X5,X7)
& ~ unorthogonal_lines(X5,X6) )
=> ~ unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f72,plain,
( convergent_lines(sK0,sK2)
| ~ convergent_lines(sK1,sK2) ),
inference(resolution,[],[f47,f37]) ).
fof(f37,plain,
unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f34]) ).
fof(f47,plain,
! [X0] :
( ~ unorthogonal_lines(sK1,X0)
| convergent_lines(sK0,X0)
| ~ convergent_lines(sK1,X0) ),
inference(resolution,[],[f35,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( unorthogonal_lines(X0,X1)
| ~ convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ unorthogonal_lines(X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2)
| ( unorthogonal_lines(X0,X2)
& convergent_lines(X0,X2) )
| ( unorthogonal_lines(X0,X1)
& convergent_lines(X0,X1) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2)
| ( unorthogonal_lines(X0,X2)
& convergent_lines(X0,X2) )
| ( unorthogonal_lines(X0,X1)
& convergent_lines(X0,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( ( ~ unorthogonal_lines(X0,X2)
| ~ convergent_lines(X0,X2) )
& ( ~ unorthogonal_lines(X0,X1)
| ~ convergent_lines(X0,X1) ) )
=> ( ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X5,X6,X7] :
( ( ( ~ unorthogonal_lines(X5,X7)
| ~ convergent_lines(X5,X7) )
& ( ~ unorthogonal_lines(X5,X6)
| ~ convergent_lines(X5,X6) ) )
=> ( ~ unorthogonal_lines(X6,X7)
| ~ convergent_lines(X6,X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cotno1) ).
fof(f35,plain,
~ unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f69,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f68,plain,
( $false
| spl3_2 ),
inference(subsumption_resolution,[],[f67,f46]) ).
fof(f46,plain,
convergent_lines(sK0,sK1),
inference(resolution,[],[f35,f45]) ).
fof(f45,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
~ ( ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X1) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X5,X6] :
~ ( ~ unorthogonal_lines(X5,X6)
& ~ convergent_lines(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',coipo1) ).
fof(f67,plain,
( ~ convergent_lines(sK0,sK1)
| spl3_2 ),
inference(resolution,[],[f51,f59]) ).
fof(f59,plain,
( ~ convergent_lines(sK1,sK2)
| spl3_2 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f51,plain,
! [X0] :
( convergent_lines(X0,sK2)
| ~ convergent_lines(sK0,X0) ),
inference(resolution,[],[f36,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO219+1 : TPTP v8.2.0. Released v3.3.0.
% 0.08/0.16 % 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.15/0.37 % Computer : n004.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 14:56:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_NEQ problem
% 0.15/0.38 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.54/0.77 % (27625)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 (2996ds/34Mi)
% 0.54/0.77 % (27628)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 (2996ds/56Mi)
% 0.54/0.77 % (27621)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 (2996ds/34Mi)
% 0.54/0.77 % (27623)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.77 % (27622)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 (2996ds/51Mi)
% 0.54/0.77 % (27624)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.77 % (27626)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.77 % (27628)First to succeed.
% 0.54/0.77 % (27627)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 (2996ds/83Mi)
% 0.54/0.77 % (27625)Also succeeded, but the first one will report.
% 0.54/0.77 % (27628)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27617"
% 0.54/0.77 % (27628)Refutation found. Thanks to Tanya!
% 0.54/0.77 % SZS status Theorem for theBenchmark
% 0.54/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.77 % (27628)------------------------------
% 0.54/0.77 % (27628)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.77 % (27628)Termination reason: Refutation
% 0.54/0.77
% 0.54/0.77 % (27628)Memory used [KB]: 1024
% 0.54/0.77 % (27628)Time elapsed: 0.003 s
% 0.54/0.77 % (27628)Instructions burned: 4 (million)
% 0.54/0.77 % (27617)Success in time 0.378 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------