TSTP Solution File: GEO171+2 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n028.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 : 600s
% DateTime : Sat Jul 16 03:48:07 EDT 2022
% Result : Theorem 2.10s 1.16s
% Output : Proof 2.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 15:37:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.48/0.60 ____ _
% 0.48/0.60 ___ / __ \_____(_)___ ________ __________
% 0.48/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.48/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.48/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.48/0.60
% 0.48/0.60 A Theorem Prover for First-Order Logic
% 0.48/0.60 (ePrincess v.1.0)
% 0.48/0.60
% 0.48/0.60 (c) Philipp Rümmer, 2009-2015
% 0.48/0.60 (c) Peter Backeman, 2014-2015
% 0.48/0.60 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.48/0.60 Free software under GNU Lesser General Public License (LGPL).
% 0.48/0.60 Bug reports to peter@backeman.se
% 0.48/0.60
% 0.48/0.60 For more information, visit http://user.uu.se/~petba168/breu/
% 0.48/0.60
% 0.48/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.75/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.35/0.94 Prover 0: Preprocessing ...
% 1.93/1.06 Prover 0: Warning: ignoring some quantifiers
% 1.98/1.08 Prover 0: Constructing countermodel ...
% 2.10/1.16 Prover 0: proved (503ms)
% 2.10/1.16
% 2.10/1.16 No countermodel exists, formula is valid
% 2.10/1.16 % SZS status Theorem for theBenchmark
% 2.10/1.16
% 2.10/1.16 Generating proof ... Warning: ignoring some quantifiers
% 2.65/1.27 found it (size 4)
% 2.65/1.27
% 2.65/1.27 % SZS output start Proof for theBenchmark
% 2.65/1.27 Assumed formulas after preprocessing and simplification:
% 2.65/1.27 | (0) ? [v0] : ? [v1] : (convergent_lines(v0, v1) & ~ distinct_lines(v0, v1) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v3 = v2 | ~ (intersection_point(v5, v4) = v3) | ~ (intersection_point(v5, v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v3 = v2 | ~ (line_connecting(v5, v4) = v3) | ~ (line_connecting(v5, v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (intersection_point(v2, v3) = v5) | ~ apart_point_and_line(v4, v3) | ~ convergent_lines(v2, v3) | distinct_points(v4, v5)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (intersection_point(v2, v3) = v5) | ~ apart_point_and_line(v4, v2) | ~ convergent_lines(v2, v3) | distinct_points(v4, v5)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (line_connecting(v2, v3) = v5) | ~ apart_point_and_line(v4, v5) | ~ distinct_points(v2, v3) | distinct_points(v4, v3)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (line_connecting(v2, v3) = v5) | ~ apart_point_and_line(v4, v5) | ~ distinct_points(v2, v3) | distinct_points(v4, v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ distinct_lines(v4, v5) | ~ distinct_points(v2, v3) | apart_point_and_line(v3, v5) | apart_point_and_line(v3, v4) | apart_point_and_line(v2, v5) | apart_point_and_line(v2, v4)) & ? [v2] : ! [v3] : ! [v4] : ( ~ apart_point_and_line(v3, v4) | apart_point_and_line(v3, v2) | distinct_lines(v4, v2)) & ? [v2] : ! [v3] : ! [v4] : ( ~ apart_point_and_line(v3, v4) | apart_point_and_line(v2, v4) | distinct_points(v3, v2)) & ? [v2] : ! [v3] : ! [v4] : ( ~ convergent_lines(v3, v4) | convergent_lines(v4, v2) | convergent_lines(v3, v2)) & ? [v2] : ! [v3] : ! [v4] : ( ~ distinct_lines(v3, v4) | distinct_lines(v4, v2) | distinct_lines(v3, v2)) & ? [v2] : ! [v3] : ! [v4] : ( ~ distinct_points(v3, v4) | distinct_points(v4, v2) | distinct_points(v3, v2)) & ! [v2] : ! [v3] : ( ~ convergent_lines(v2, v3) | distinct_lines(v2, v3)) & ! [v2] : ~ convergent_lines(v2, v2) & ! [v2] : ~ distinct_lines(v2, v2) & ! [v2] : ~ distinct_points(v2, v2))
% 2.73/1.31 | Instantiating (0) with all_0_0_0, all_0_1_1 yields:
% 2.73/1.31 | (1) convergent_lines(all_0_1_1, all_0_0_0) & ~ distinct_lines(all_0_1_1, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection_point(v0, v1) = v3) | ~ apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) | distinct_points(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection_point(v0, v1) = v3) | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) | distinct_points(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (line_connecting(v0, v1) = v3) | ~ apart_point_and_line(v2, v3) | ~ distinct_points(v0, v1) | distinct_points(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (line_connecting(v0, v1) = v3) | ~ apart_point_and_line(v2, v3) | ~ distinct_points(v0, v1) | distinct_points(v2, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ distinct_lines(v2, v3) | ~ distinct_points(v0, v1) | apart_point_and_line(v1, v3) | apart_point_and_line(v1, v2) | apart_point_and_line(v0, v3) | apart_point_and_line(v0, v2)) & ? [v0] : ! [v1] : ! [v2] : ( ~ apart_point_and_line(v1, v2) | apart_point_and_line(v1, v0) | distinct_lines(v2, v0)) & ? [v0] : ! [v1] : ! [v2] : ( ~ apart_point_and_line(v1, v2) | apart_point_and_line(v0, v2) | distinct_points(v1, v0)) & ? [v0] : ! [v1] : ! [v2] : ( ~ convergent_lines(v1, v2) | convergent_lines(v2, v0) | convergent_lines(v1, v0)) & ? [v0] : ! [v1] : ! [v2] : ( ~ distinct_lines(v1, v2) | distinct_lines(v2, v0) | distinct_lines(v1, v0)) & ? [v0] : ! [v1] : ! [v2] : ( ~ distinct_points(v1, v2) | distinct_points(v2, v0) | distinct_points(v1, v0)) & ! [v0] : ! [v1] : ( ~ convergent_lines(v0, v1) | distinct_lines(v0, v1)) & ! [v0] : ~ convergent_lines(v0, v0) & ! [v0] : ~ distinct_lines(v0, v0) & ! [v0] : ~ distinct_points(v0, v0)
% 2.73/1.32 |
% 2.73/1.32 | Applying alpha-rule on (1) yields:
% 2.73/1.32 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0))
% 2.73/1.32 | (3) ? [v0] : ! [v1] : ! [v2] : ( ~ distinct_lines(v1, v2) | distinct_lines(v2, v0) | distinct_lines(v1, v0))
% 2.73/1.32 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0))
% 2.73/1.32 | (5) convergent_lines(all_0_1_1, all_0_0_0)
% 2.73/1.32 | (6) ~ distinct_lines(all_0_1_1, all_0_0_0)
% 2.73/1.32 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (line_connecting(v0, v1) = v3) | ~ apart_point_and_line(v2, v3) | ~ distinct_points(v0, v1) | distinct_points(v2, v0))
% 2.73/1.32 | (8) ? [v0] : ! [v1] : ! [v2] : ( ~ convergent_lines(v1, v2) | convergent_lines(v2, v0) | convergent_lines(v1, v0))
% 2.73/1.32 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ distinct_lines(v2, v3) | ~ distinct_points(v0, v1) | apart_point_and_line(v1, v3) | apart_point_and_line(v1, v2) | apart_point_and_line(v0, v3) | apart_point_and_line(v0, v2))
% 2.73/1.32 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection_point(v0, v1) = v3) | ~ apart_point_and_line(v2, v1) | ~ convergent_lines(v0, v1) | distinct_points(v2, v3))
% 2.73/1.32 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection_point(v0, v1) = v3) | ~ apart_point_and_line(v2, v0) | ~ convergent_lines(v0, v1) | distinct_points(v2, v3))
% 2.73/1.33 | (12) ! [v0] : ~ distinct_points(v0, v0)
% 2.73/1.33 | (13) ! [v0] : ~ convergent_lines(v0, v0)
% 2.73/1.33 | (14) ! [v0] : ~ distinct_lines(v0, v0)
% 2.73/1.33 | (15) ? [v0] : ! [v1] : ! [v2] : ( ~ distinct_points(v1, v2) | distinct_points(v2, v0) | distinct_points(v1, v0))
% 2.73/1.33 | (16) ? [v0] : ! [v1] : ! [v2] : ( ~ apart_point_and_line(v1, v2) | apart_point_and_line(v1, v0) | distinct_lines(v2, v0))
% 2.73/1.33 | (17) ! [v0] : ! [v1] : ( ~ convergent_lines(v0, v1) | distinct_lines(v0, v1))
% 2.73/1.33 | (18) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (line_connecting(v0, v1) = v3) | ~ apart_point_and_line(v2, v3) | ~ distinct_points(v0, v1) | distinct_points(v2, v1))
% 2.73/1.33 | (19) ? [v0] : ! [v1] : ! [v2] : ( ~ apart_point_and_line(v1, v2) | apart_point_and_line(v0, v2) | distinct_points(v1, v0))
% 2.73/1.33 |
% 2.73/1.33 | Instantiating formula (17) with all_0_0_0, all_0_1_1 and discharging atoms convergent_lines(all_0_1_1, all_0_0_0), ~ distinct_lines(all_0_1_1, all_0_0_0), yields:
% 2.85/1.33 | (20) $false
% 2.85/1.33 |
% 2.85/1.33 |-The branch is then unsatisfiable
% 2.85/1.33 % SZS output end Proof for theBenchmark
% 2.85/1.33
% 2.85/1.33 716ms
%------------------------------------------------------------------------------