TSTP Solution File: GEO176+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GEO176+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 : n027.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 : Sun May 5 05:15:51 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 96 ( 34 ~; 31 |; 21 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 42 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f135,plain,
$false,
inference(avatar_sat_refutation,[],[f67,f122,f130,f134]) ).
fof(f134,plain,
( ~ spl4_3
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f125,f60,f119]) ).
fof(f119,plain,
( spl4_3
<=> convergent_lines(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f60,plain,
( spl4_1
<=> apart_point_and_line(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f125,plain,
( ~ apart_point_and_line(sK0,sK2)
| ~ convergent_lines(sK2,sK3) ),
inference(resolution,[],[f84,f44]) ).
fof(f44,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
( ~ distinct_points(sK0,intersection_point(sK2,sK3))
& ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f20,f39]) ).
fof(f39,plain,
( ? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ~ distinct_points(sK0,intersection_point(sK2,sK3))
& ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X0,X1,X2,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
inference(rectify,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X3,X4] :
( ( ( apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) )
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X0,X1,X3,X4] :
( ( ( apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) )
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f84,plain,
! [X2,X0,X1] :
( distinct_points(X0,intersection_point(X1,X2))
| ~ apart_point_and_line(X0,X1)
| ~ convergent_lines(X1,X2) ),
inference(resolution,[],[f57,f49]) ).
fof(f49,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,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(f57,plain,
! [X2,X0,X1] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( apart_point_and_line(X2,X1)
| distinct_points(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq1) ).
fof(f130,plain,
spl4_3,
inference(avatar_contradiction_clause,[],[f127]) ).
fof(f127,plain,
( $false
| spl4_3 ),
inference(resolution,[],[f121,f42]) ).
fof(f42,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f40]) ).
fof(f121,plain,
( ~ convergent_lines(sK2,sK3)
| spl4_3 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f122,plain,
( ~ spl4_3
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f116,f64,f119]) ).
fof(f64,plain,
( spl4_2
<=> apart_point_and_line(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f116,plain,
( ~ apart_point_and_line(sK0,sK3)
| ~ convergent_lines(sK2,sK3) ),
inference(resolution,[],[f83,f44]) ).
fof(f83,plain,
! [X2,X0,X1] :
( distinct_points(X0,intersection_point(X1,X2))
| ~ apart_point_and_line(X0,X2)
| ~ convergent_lines(X1,X2) ),
inference(resolution,[],[f57,f48]) ).
fof(f48,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,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) ).
fof(f67,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f43,f64,f60]) ).
fof(f43,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO176+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 22:03:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (28483)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (28487)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38 % (28484)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 % (28486)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.15/0.38 % (28489)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38 % (28488)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38 % (28485)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (28490)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.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [1,1]
% 0.15/0.39 TRYING [1,1]
% 0.15/0.39 TRYING [1,2]
% 0.15/0.39 TRYING [1,2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [2,2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [2,2]
% 0.15/0.39 TRYING [2,3]
% 0.15/0.39 TRYING [2,3]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 % (28489)Also succeeded, but the first one will report.
% 0.15/0.39 % (28486)First to succeed.
% 0.15/0.39 TRYING [2,4]
% 0.15/0.39 TRYING [2,4]
% 0.15/0.39 TRYING [4]
% 0.15/0.39 % (28486)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28483"
% 0.15/0.39 TRYING [2,5]
% 0.15/0.39 TRYING [2,5]
% 0.15/0.39 % (28486)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (28486)------------------------------
% 0.15/0.39 % (28486)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (28486)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (28486)Memory used [KB]: 860
% 0.15/0.39 % (28486)Time elapsed: 0.006 s
% 0.15/0.39 % (28486)Instructions burned: 5 (million)
% 0.15/0.39 % (28483)Success in time 0.021 s
%------------------------------------------------------------------------------