TSTP Solution File: GEO226+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue Apr 30 11:14:53 EDT 2024
% Result : Theorem 0.18s 0.36s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 69 ( 20 ~; 11 |; 29 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 25 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(subsumption_resolution,[],[f83,f59]) ).
fof(f59,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
( ! [X2] :
( ( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f28,f55]) ).
fof(f55,plain,
( ? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ( ! [X2] :
( ( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
~ ! [X0,X1] :
( ( convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ? [X2] :
( point(X2)
=> ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) ) ) ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X7,X8] :
( ( convergent_lines(X7,X8)
& line(X8)
& line(X7) )
=> ? [X0] :
( point(X0)
=> ( ~ apart_point_and_line(X0,X8)
& ~ apart_point_and_line(X0,X7) ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X7,X8] :
( ( convergent_lines(X7,X8)
& line(X8)
& line(X7) )
=> ? [X0] :
( point(X0)
=> ( ~ apart_point_and_line(X0,X8)
& ~ apart_point_and_line(X0,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f83,plain,
~ convergent_lines(sK0,sK1),
inference(resolution,[],[f82,f67]) ).
fof(f67,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,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/sandbox/benchmark/theBenchmark.p',ci3) ).
fof(f82,plain,
apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolution,[],[f81,f59]) ).
fof(f81,plain,
! [X0] :
( ~ convergent_lines(X0,sK1)
| apart_point_and_line(intersection_point(X0,sK1),sK0) ),
inference(resolution,[],[f68,f61]) ).
fof(f61,plain,
! [X2] :
( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f68,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,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/sandbox/benchmark/theBenchmark.p',ci4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Apr 30 05:44:26 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (20190)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.35 % (20194)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.35 TRYING [1,1]
% 0.13/0.35 TRYING [2,1]
% 0.13/0.35 TRYING [2,2]
% 0.13/0.35 TRYING [3,3]
% 0.18/0.35 TRYING [4,4]
% 0.18/0.35 TRYING [5,5]
% 0.18/0.35 % (20195)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.18/0.36 % (20191)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.18/0.36 % (20195)First to succeed.
% 0.18/0.36 % (20193)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.18/0.36 % (20192)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.18/0.36 % (20196)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.18/0.36 % (20197)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.18/0.36 TRYING [1]
% 0.18/0.36 TRYING [2]
% 0.18/0.36 % (20196)Also succeeded, but the first one will report.
% 0.18/0.36 TRYING [1]
% 0.18/0.36 % (20195)Refutation found. Thanks to Tanya!
% 0.18/0.36 % SZS status Theorem for theBenchmark
% 0.18/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.36 % (20195)------------------------------
% 0.18/0.36 % (20195)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.18/0.36 % (20195)Termination reason: Refutation
% 0.18/0.36
% 0.18/0.36 % (20195)Memory used [KB]: 773
% 0.18/0.36 % (20195)Time elapsed: 0.003 s
% 0.18/0.36 % (20195)Instructions burned: 3 (million)
% 0.18/0.36 % (20195)------------------------------
% 0.18/0.36 % (20195)------------------------------
% 0.18/0.36 % (20190)Success in time 0.018 s
%------------------------------------------------------------------------------