TSTP Solution File: GEO198+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO198+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.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:20 EDT 2024
% Result : Theorem 0.69s 0.86s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 37 ~; 39 |; 18 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 63 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f170,plain,
$false,
inference(subsumption_resolution,[],[f165,f122]) ).
fof(f122,plain,
distinct_points(intersection_point(sK0,sK2),intersection_point(sK0,sK1)),
inference(unit_resulting_resolution,[],[f33,f37,f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con2) ).
fof(f37,plain,
apart_point_and_line(intersection_point(sK0,sK2),sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
? [X0,X1,X2] :
( apart_point_and_line(intersection_point(X0,X2),X1)
& ~ apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X2)
& convergent_lines(X2,X1)
& convergent_lines(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2] :
( apart_point_and_line(intersection_point(X0,X2),X1)
& ~ apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X2)
& convergent_lines(X2,X1)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X2)
& convergent_lines(X2,X1)
& convergent_lines(X0,X1) )
=> ~ apart_point_and_line(intersection_point(X0,X2),X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1,X2] :
( ( ~ apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X2)
& convergent_lines(X2,X1)
& convergent_lines(X0,X1) )
=> ~ apart_point_and_line(intersection_point(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f33,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f17]) ).
fof(f165,plain,
~ distinct_points(intersection_point(sK0,sK2),intersection_point(sK0,sK1)),
inference(unit_resulting_resolution,[],[f53,f36,f97,f67,f68,f45]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( ( distinct_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X3,X4] :
( ( distinct_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cu1) ).
fof(f68,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),sK2),
inference(unit_resulting_resolution,[],[f47,f35,f39]) ).
fof(f35,plain,
convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
! [X0] : ~ distinct_points(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : ~ distinct_points(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart1) ).
fof(f67,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(unit_resulting_resolution,[],[f47,f35,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f97,plain,
distinct_lines(sK2,sK0),
inference(unit_resulting_resolution,[],[f65,f40]) ).
fof(f40,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,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/sandbox/benchmark/theBenchmark.p',ceq3) ).
fof(f65,plain,
convergent_lines(sK2,sK0),
inference(unit_resulting_resolution,[],[f42,f35,f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f21]) ).
fof(f21,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/sandbox/benchmark/theBenchmark.p',apart6) ).
fof(f42,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).
fof(f36,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f17]) ).
fof(f53,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(unit_resulting_resolution,[],[f47,f33,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO198+2 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 14:31:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_NEQ problem
% 0.13/0.34 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.69/0.85 % (27231)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.69/0.85 % (27230)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.69/0.85 % (27233)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.69/0.85 % (27228)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 (2994ds/34Mi)
% 0.69/0.85 % (27229)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 (2994ds/51Mi)
% 0.69/0.85 % (27232)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 (2994ds/34Mi)
% 0.69/0.85 % (27234)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 (2994ds/83Mi)
% 0.69/0.85 % (27235)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 (2994ds/56Mi)
% 0.69/0.85 % (27231)Refutation not found, incomplete strategy% (27231)------------------------------
% 0.69/0.85 % (27231)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.85 % (27231)Termination reason: Refutation not found, incomplete strategy
% 0.69/0.85
% 0.69/0.85 % (27231)Memory used [KB]: 982
% 0.69/0.85 % (27231)Time elapsed: 0.003 s
% 0.69/0.85 % (27231)Instructions burned: 2 (million)
% 0.69/0.85 % (27231)------------------------------
% 0.69/0.85 % (27231)------------------------------
% 0.69/0.85 % (27235)Refutation not found, incomplete strategy% (27235)------------------------------
% 0.69/0.85 % (27235)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.85 % (27235)Termination reason: Refutation not found, incomplete strategy
% 0.69/0.85
% 0.69/0.86 % (27235)Memory used [KB]: 982
% 0.69/0.86 % (27235)Time elapsed: 0.002 s
% 0.69/0.86 % (27235)Instructions burned: 2 (million)
% 0.69/0.86 % (27235)------------------------------
% 0.69/0.86 % (27235)------------------------------
% 0.69/0.86 % (27234)First to succeed.
% 0.69/0.86 % (27234)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27227"
% 0.69/0.86 % (27234)Refutation found. Thanks to Tanya!
% 0.69/0.86 % SZS status Theorem for theBenchmark
% 0.69/0.86 % SZS output start Proof for theBenchmark
% See solution above
% 0.69/0.86 % (27234)------------------------------
% 0.69/0.86 % (27234)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.86 % (27234)Termination reason: Refutation
% 0.69/0.86
% 0.69/0.86 % (27234)Memory used [KB]: 1064
% 0.69/0.86 % (27234)Time elapsed: 0.005 s
% 0.69/0.86 % (27234)Instructions burned: 7 (million)
% 0.69/0.86 % (27227)Success in time 0.512 s
% 0.69/0.86 % Vampire---4.8 exiting
%------------------------------------------------------------------------------