TSTP Solution File: GEO261+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GEO261+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n002.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:15:04 EDT 2024
% Result : Theorem 0.10s 0.35s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 31 ~; 22 |; 24 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 79 ( 64 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f313,plain,
$false,
inference(subsumption_resolution,[],[f312,f178]) ).
fof(f178,plain,
unequally_directed_lines(sK0,sK1),
inference(resolution,[],[f151,f128]) ).
fof(f128,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( ~ divides_points(sK1,sK2,sK4)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK2,sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f82,f125]) ).
fof(f125,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ divides_points(X1,X2,X4)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) )
=> ( ~ divides_points(sK1,sK2,sK4)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK2,sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
? [X0,X1,X2,X3,X4] :
( ~ divides_points(X1,X2,X4)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) ),
inference(flattening,[],[f81]) ).
fof(f81,plain,
? [X0,X1,X2,X3,X4] :
( ~ divides_points(X1,X2,X4)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) ),
inference(ennf_transformation,[],[f80]) ).
fof(f80,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) )
=> divides_points(X1,X2,X4) ),
inference(pure_predicate_removal,[],[f39]) ).
fof(f39,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( incident_point_and_line(X3,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) )
=> divides_points(X1,X2,X4) ),
inference(rectify,[],[f38]) ).
fof(f38,negated_conjecture,
~ ! [X3,X4,X2,X5,X6] :
( ( incident_point_and_line(X5,X4)
& convergent_lines(X3,X4)
& between_on_line(X3,X2,X5,X6) )
=> divides_points(X4,X2,X6) ),
inference(negated_conjecture,[],[f37]) ).
fof(f37,conjecture,
! [X3,X4,X2,X5,X6] :
( ( incident_point_and_line(X5,X4)
& convergent_lines(X3,X4)
& between_on_line(X3,X2,X5,X6) )
=> divides_points(X4,X2,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f151,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X0,X1] :
( ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_opposite_lines(X0,X1)
& unequally_directed_lines(X0,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X3,X4] :
( convergent_lines(X3,X4)
<=> ( unequally_directed_opposite_lines(X3,X4)
& unequally_directed_lines(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a7_defns) ).
fof(f312,plain,
~ unequally_directed_lines(sK0,sK1),
inference(resolution,[],[f258,f179]) ).
fof(f179,plain,
unequally_directed_opposite_lines(sK0,sK1),
inference(resolution,[],[f152,f128]) ).
fof(f152,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f258,plain,
! [X0,X1] :
( ~ unequally_directed_opposite_lines(X0,X1)
| ~ unequally_directed_lines(X0,X1) ),
inference(resolution,[],[f255,f147]) ).
fof(f147,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
=> unequally_directed_lines(X0,reverse_line(X1)) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
<=> unequally_directed_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_defns) ).
fof(f255,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(subsumption_resolution,[],[f254,f154]) ).
fof(f154,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X3,X4] :
~ ( left_convergent_lines(X3,reverse_line(X4))
| left_convergent_lines(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11_basics) ).
fof(f254,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(subsumption_resolution,[],[f146,f154]) ).
fof(f146,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) )
=> ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X3,X4] :
( ( unequally_directed_lines(X3,reverse_line(X4))
& unequally_directed_lines(X3,X4) )
=> ( left_convergent_lines(X3,reverse_line(X4))
| left_convergent_lines(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax9_basics) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GEO261+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.32 % Computer : n002.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 06:10:09 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % (8367)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.34 % (8370)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.10/0.34 % (8368)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.34 % (8369)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.34 % (8373)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.10/0.34 % (8372)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.10/0.34 % (8371)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.10/0.34 % (8374)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.10/0.34 TRYING [1]
% 0.10/0.34 TRYING [1]
% 0.10/0.34 TRYING [2]
% 0.10/0.34 TRYING [2]
% 0.10/0.34 TRYING [1,1]
% 0.10/0.34 TRYING [1,1]
% 0.10/0.34 TRYING [3]
% 0.10/0.34 TRYING [2,2]
% 0.10/0.34 TRYING [2,2]
% 0.10/0.34 % (8373)First to succeed.
% 0.10/0.35 TRYING [3]
% 0.10/0.35 TRYING [3,2]
% 0.10/0.35 TRYING [3,2]
% 0.10/0.35 % (8370)Also succeeded, but the first one will report.
% 0.10/0.35 % (8373)Refutation found. Thanks to Tanya!
% 0.10/0.35 % SZS status Theorem for theBenchmark
% 0.10/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.35 % (8373)------------------------------
% 0.10/0.35 % (8373)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.10/0.35 % (8373)Termination reason: Refutation
% 0.10/0.35
% 0.10/0.35 % (8373)Memory used [KB]: 898
% 0.10/0.35 % (8373)Time elapsed: 0.006 s
% 0.10/0.35 % (8373)Instructions burned: 8 (million)
% 0.10/0.35 % (8373)------------------------------
% 0.10/0.35 % (8373)------------------------------
% 0.10/0.35 % (8367)Success in time 0.021 s
%------------------------------------------------------------------------------