TSTP Solution File: GEO203+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO203+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 : n023.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:23 EDT 2024
% Result : Theorem 0.62s 0.77s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 11 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 105 ( 35 ~; 39 |; 21 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 54 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f113,plain,
$false,
inference(subsumption_resolution,[],[f112,f100]) ).
fof(f100,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolution,[],[f74,f77]) ).
fof(f77,plain,
! [X0,X1] :
( ~ distinct_points(X0,X1)
| ~ apart_point_and_line(X1,line_connecting(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apart_point_and_line(X1,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( distinct_points(X0,X1)
=> ~ apart_point_and_line(X1,line_connecting(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci2) ).
fof(f74,plain,
distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
& distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
& convergent_lines(sK0,sK2)
& convergent_lines(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f43,f70]) ).
fof(f70,plain,
( ? [X0,X1,X2] :
( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
& distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
& convergent_lines(X0,X2)
& convergent_lines(X0,X1) )
=> ( ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
& distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
& convergent_lines(sK0,sK2)
& convergent_lines(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1,X2] :
( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
& distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
& convergent_lines(X0,X2)
& convergent_lines(X0,X1) ),
inference(flattening,[],[f42]) ).
fof(f42,plain,
? [X0,X1,X2] :
( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
& distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
& convergent_lines(X0,X2)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
& convergent_lines(X0,X2)
& convergent_lines(X0,X1) )
=> equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0) ),
inference(negated_conjecture,[],[f36]) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
& convergent_lines(X0,X2)
& convergent_lines(X0,X1) )
=> equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f112,plain,
apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(subsumption_resolution,[],[f111,f97]) ).
fof(f97,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(resolution,[],[f73,f85]) ).
fof(f85,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,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(f73,plain,
convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f71]) ).
fof(f111,plain,
( apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(subsumption_resolution,[],[f110,f99]) ).
fof(f99,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolution,[],[f74,f78]) ).
fof(f78,plain,
! [X0,X1] :
( ~ distinct_points(X0,X1)
| ~ apart_point_and_line(X0,line_connecting(X0,X1)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( distinct_points(X0,X1)
=> ~ apart_point_and_line(X0,line_connecting(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci1) ).
fof(f110,plain,
( apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
| apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(subsumption_resolution,[],[f109,f95]) ).
fof(f95,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolution,[],[f72,f85]) ).
fof(f72,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f71]) ).
fof(f109,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
| apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolution,[],[f104,f74]) ).
fof(f104,plain,
! [X0,X1] :
( ~ distinct_points(X1,X0)
| apart_point_and_line(X1,sK0)
| apart_point_and_line(X1,line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
| apart_point_and_line(X0,sK0)
| apart_point_and_line(X0,line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolution,[],[f101,f80]) ).
fof(f80,plain,
! [X2,X3,X0,X1] :
( ~ distinct_lines(X2,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X1,X3)
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,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,[],[f50]) ).
fof(f50,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,[],[f39]) ).
fof(f39,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,[],[f11]) ).
fof(f11,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/sandbox2/benchmark/theBenchmark.p',cu1) ).
fof(f101,plain,
distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
inference(resolution,[],[f75,f88]) ).
fof(f88,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
=> equal_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f32,axiom,
! [X0,X1] :
( equal_lines(X0,X1)
<=> ~ distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(f75,plain,
~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
inference(cnf_transformation,[],[f71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : GEO203+3 : TPTP v8.2.0. Released v4.0.0.
% 0.04/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 : n023.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 13:45:53 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_NEQ problem
% 0.10/0.31 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.62/0.76 % (31029)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.62/0.76 % (31031)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.76 % (31030)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.62/0.76 % (31034)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.62/0.76 % (31033)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 (2995ds/34Mi)
% 0.62/0.76 % (31035)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.62/0.76 % (31032)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.62/0.76 % (31036)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.62/0.76 % (31034)Refutation not found, incomplete strategy% (31034)------------------------------
% 0.62/0.76 % (31034)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.76 % (31034)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.76
% 0.62/0.76 % (31034)Memory used [KB]: 1153
% 0.62/0.76 % (31034)Time elapsed: 0.002 s
% 0.62/0.76 % (31034)Instructions burned: 2 (million)
% 0.62/0.76 % (31034)------------------------------
% 0.62/0.76 % (31034)------------------------------
% 0.62/0.77 % (31036)First to succeed.
% 0.62/0.77 % (31032)Also succeeded, but the first one will report.
% 0.62/0.77 % (31036)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31028"
% 0.62/0.77 % (31036)Refutation found. Thanks to Tanya!
% 0.62/0.77 % SZS status Theorem for theBenchmark
% 0.62/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.77 % (31036)------------------------------
% 0.62/0.77 % (31036)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.77 % (31036)Termination reason: Refutation
% 0.62/0.77
% 0.62/0.77 % (31036)Memory used [KB]: 1168
% 0.62/0.77 % (31036)Time elapsed: 0.004 s
% 0.62/0.77 % (31036)Instructions burned: 4 (million)
% 0.62/0.77 % (31028)Success in time 0.455 s
% 0.62/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------