TSTP Solution File: GEO226+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO226+3 : TPTP v8.2.0. Released v4.0.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 : n032.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:38 EDT 2024
% Result : Theorem 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 3 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 89 ( 33 ~; 16 |; 29 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 35 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f149,plain,
$false,
inference(subsumption_resolution,[],[f148,f98]) ).
fof(f98,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
( ! [X2] :
( ( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f54,f94]) ).
fof(f94,plain,
( ? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ( ! [X2] :
( ( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
? [X0,X1] :
( ! [X2] :
( ( ~ incident_point_and_line(X2,X1)
| ~ incident_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
~ ! [X0,X1] :
( ( convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ? [X2] :
( point(X2)
=> ( incident_point_and_line(X2,X1)
& incident_point_and_line(X2,X0) ) ) ),
inference(rectify,[],[f37]) ).
fof(f37,negated_conjecture,
~ ! [X5,X6] :
( ( convergent_lines(X5,X6)
& line(X6)
& line(X5) )
=> ? [X0] :
( point(X0)
=> ( incident_point_and_line(X0,X6)
& incident_point_and_line(X0,X5) ) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f36,conjecture,
! [X5,X6] :
( ( convergent_lines(X5,X6)
& line(X6)
& line(X5) )
=> ? [X0] :
( point(X0)
=> ( incident_point_and_line(X0,X6)
& incident_point_and_line(X0,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f148,plain,
~ convergent_lines(sK0,sK1),
inference(duplicate_literal_removal,[],[f147]) ).
fof(f147,plain,
( ~ convergent_lines(sK0,sK1)
| ~ convergent_lines(sK0,sK1) ),
inference(resolution,[],[f146,f113]) ).
fof(f113,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci3) ).
fof(f146,plain,
! [X0] :
( apart_point_and_line(intersection_point(X0,sK1),sK0)
| ~ convergent_lines(X0,sK1) ),
inference(resolution,[],[f144,f107]) ).
fof(f107,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,X1)
=> incident_point_and_line(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f34,axiom,
! [X0,X1] :
( incident_point_and_line(X0,X1)
<=> ~ apart_point_and_line(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).
fof(f144,plain,
! [X0] :
( ~ incident_point_and_line(intersection_point(X0,sK1),sK0)
| ~ convergent_lines(X0,sK1) ),
inference(resolution,[],[f112,f142]) ).
fof(f142,plain,
! [X0] :
( apart_point_and_line(X0,sK1)
| ~ incident_point_and_line(X0,sK0) ),
inference(resolution,[],[f107,f100]) ).
fof(f100,plain,
! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ incident_point_and_line(X2,sK0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f112,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GEO226+3 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10 % 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.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 14:16:08 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_NEQ problem
% 0.10/0.30 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.47/0.65 % (26706)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.47/0.65 % (26703)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.47/0.65 % (26704)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.47/0.65 % (26702)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.65 % (26700)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.47/0.65 % (26703)Refutation not found, incomplete strategy% (26703)------------------------------
% 0.47/0.65 % (26703)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65 % (26703)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65 % (26705)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.47/0.65
% 0.47/0.65 % (26703)Memory used [KB]: 1086
% 0.47/0.65 % (26703)Time elapsed: 0.002 s
% 0.47/0.65 % (26703)Instructions burned: 2 (million)
% 0.47/0.65 % (26701)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.47/0.65 % (26703)------------------------------
% 0.47/0.65 % (26703)------------------------------
% 0.47/0.65 % (26705)Refutation not found, incomplete strategy% (26705)------------------------------
% 0.47/0.65 % (26705)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65 % (26705)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65
% 0.47/0.65 % (26705)Memory used [KB]: 1084
% 0.47/0.65 % (26705)Time elapsed: 0.003 s
% 0.47/0.65 % (26705)Instructions burned: 2 (million)
% 0.47/0.65 % (26705)------------------------------
% 0.47/0.65 % (26705)------------------------------
% 0.47/0.65 % (26700)Refutation not found, incomplete strategy% (26700)------------------------------
% 0.47/0.65 % (26700)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65 % (26700)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65
% 0.47/0.65 % (26700)Memory used [KB]: 1165
% 0.47/0.65 % (26700)Time elapsed: 0.003 s
% 0.47/0.65 % (26700)Instructions burned: 3 (million)
% 0.47/0.65 % (26702)First to succeed.
% 0.47/0.65 % (26701)Also succeeded, but the first one will report.
% 0.47/0.65 % (26700)------------------------------
% 0.47/0.65 % (26700)------------------------------
% 0.47/0.65 % (26702)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26699"
% 0.47/0.65 % (26704)Also succeeded, but the first one will report.
% 0.47/0.65 % (26707)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.47/0.65 % (26702)Refutation found. Thanks to Tanya!
% 0.47/0.65 % SZS status Theorem for theBenchmark
% 0.47/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.65 % (26702)------------------------------
% 0.47/0.65 % (26702)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65 % (26702)Termination reason: Refutation
% 0.47/0.65
% 0.47/0.65 % (26702)Memory used [KB]: 1171
% 0.47/0.65 % (26702)Time elapsed: 0.005 s
% 0.47/0.65 % (26702)Instructions burned: 5 (million)
% 0.47/0.65 % (26699)Success in time 0.342 s
% 0.47/0.65 % Vampire---4.8 exiting
%------------------------------------------------------------------------------