TSTP Solution File: GEO213+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO213+2 : 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 : Mon May 20 20:09:29 EDT 2024
% Result : Theorem 0.51s 0.70s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 33 ~; 37 |; 14 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 70 ( 64 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f135,plain,
$false,
inference(avatar_sat_refutation,[],[f133,f134]) ).
fof(f134,plain,
~ spl4_2,
inference(avatar_split_clause,[],[f111,f79]) ).
fof(f79,plain,
( spl4_2
<=> convergent_lines(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f111,plain,
~ convergent_lines(sK0,sK1),
inference(unit_resulting_resolution,[],[f51,f49,f95,f62]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ unorthogonal_lines(X0,X1)
| ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| unorthogonal_lines(X1,X2) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,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,[],[f41]) ).
fof(f41,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,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( unorthogonal_lines(X0,X1)
& convergent_lines(X0,X1) )
=> ( ( unorthogonal_lines(X1,X2)
& convergent_lines(X1,X2) )
| ( unorthogonal_lines(X0,X2)
& convergent_lines(X0,X2) ) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X5,X6,X7] :
( ( unorthogonal_lines(X5,X6)
& convergent_lines(X5,X6) )
=> ( ( unorthogonal_lines(X6,X7)
& convergent_lines(X6,X7) )
| ( unorthogonal_lines(X5,X7)
& convergent_lines(X5,X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oac1) ).
fof(f95,plain,
~ convergent_lines(sK0,sK2),
inference(unit_resulting_resolution,[],[f50,f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( distinct_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ceq3) ).
fof(f50,plain,
~ distinct_lines(sK0,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
? [X0,X1,X2] :
( ~ unorthogonal_lines(X1,X2)
& ~ distinct_lines(X0,X2)
& unorthogonal_lines(X0,X1) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
? [X0,X1,X2] :
( ~ unorthogonal_lines(X1,X2)
& ~ distinct_lines(X0,X2)
& unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( unorthogonal_lines(X0,X1)
=> ( unorthogonal_lines(X1,X2)
| distinct_lines(X0,X2) ) ),
inference(rectify,[],[f22]) ).
fof(f22,negated_conjecture,
~ ! [X5,X6,X7] :
( unorthogonal_lines(X5,X6)
=> ( unorthogonal_lines(X6,X7)
| distinct_lines(X5,X7) ) ),
inference(negated_conjecture,[],[f21]) ).
fof(f21,conjecture,
! [X5,X6,X7] :
( unorthogonal_lines(X5,X6)
=> ( unorthogonal_lines(X6,X7)
| distinct_lines(X5,X7) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f49,plain,
unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
~ unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f133,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f132]) ).
fof(f132,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f129,f110]) ).
fof(f110,plain,
~ convergent_lines(sK2,sK0),
inference(unit_resulting_resolution,[],[f91,f53]) ).
fof(f91,plain,
~ distinct_lines(sK2,sK0),
inference(unit_resulting_resolution,[],[f57,f50,f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ distinct_lines(X0,X1)
| distinct_lines(X0,X2)
| distinct_lines(X1,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(flattening,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( distinct_lines(X0,X1)
=> ( distinct_lines(X1,X2)
| distinct_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apart5) ).
fof(f57,plain,
! [X0] : ~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] : ~ distinct_lines(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apart2) ).
fof(f129,plain,
( convergent_lines(sK2,sK0)
| spl4_2 ),
inference(unit_resulting_resolution,[],[f96,f104,f64]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f43]) ).
fof(f43,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',apart6) ).
fof(f104,plain,
( ~ convergent_lines(sK1,sK0)
| spl4_2 ),
inference(unit_resulting_resolution,[],[f65,f81,f64]) ).
fof(f81,plain,
( ~ convergent_lines(sK0,sK1)
| spl4_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f65,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apart3) ).
fof(f96,plain,
convergent_lines(sK1,sK2),
inference(unit_resulting_resolution,[],[f51,f63]) ).
fof(f63,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X5,X6] :
( unorthogonal_lines(X5,X6)
| convergent_lines(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',occu1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GEO213+2 : TPTP v8.2.0. Released v3.3.0.
% 0.05/0.12 % 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.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 14:58:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_NEQ problem
% 0.11/0.33 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.51/0.69 % (32255)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.51/0.69 % (32248)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.51/0.69 % (32254)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.51/0.70 % (32250)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.70 % (32254)First to succeed.
% 0.51/0.70 % (32254)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32247"
% 0.51/0.70 % (32254)Refutation found. Thanks to Tanya!
% 0.51/0.70 % SZS status Theorem for theBenchmark
% 0.51/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.70 % (32254)------------------------------
% 0.51/0.70 % (32254)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.70 % (32254)Termination reason: Refutation
% 0.51/0.70
% 0.51/0.70 % (32254)Memory used [KB]: 1109
% 0.51/0.70 % (32254)Time elapsed: 0.005 s
% 0.51/0.70 % (32254)Instructions burned: 5 (million)
% 0.51/0.70 % (32247)Success in time 0.367 s
% 0.51/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------