TSTP Solution File: GEO265+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO265+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n006.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 : Wed Aug 30 23:22:52 EDT 2023
% Result : Theorem 8.47s 1.91s
% Output : Proof 11.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO265+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 20:11:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.60 ________ _____
% 0.18/0.60 ___ __ \_________(_)________________________________
% 0.18/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.60
% 0.18/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.60 (2023-06-19)
% 0.18/0.60
% 0.18/0.60 (c) Philipp Rümmer, 2009-2023
% 0.18/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.60 Amanda Stjerna.
% 0.18/0.60 Free software under BSD-3-Clause.
% 0.18/0.60
% 0.18/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.60
% 0.18/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.18/0.61 Running up to 7 provers in parallel.
% 0.18/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.09/1.15 Prover 1: Preprocessing ...
% 3.09/1.16 Prover 4: Preprocessing ...
% 3.09/1.19 Prover 6: Preprocessing ...
% 3.09/1.19 Prover 2: Preprocessing ...
% 3.09/1.19 Prover 0: Preprocessing ...
% 3.09/1.19 Prover 5: Preprocessing ...
% 3.09/1.19 Prover 3: Preprocessing ...
% 6.96/1.70 Prover 5: Proving ...
% 7.55/1.76 Prover 2: Proving ...
% 7.96/1.79 Prover 6: Constructing countermodel ...
% 7.96/1.79 Prover 3: Constructing countermodel ...
% 7.96/1.80 Prover 1: Constructing countermodel ...
% 8.47/1.90 Prover 6: proved (1276ms)
% 8.47/1.91
% 8.47/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.47/1.91
% 8.47/1.91 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.47/1.91 Prover 5: stopped
% 8.71/1.92 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.71/1.93 Prover 3: stopped
% 8.71/1.93 Prover 2: stopped
% 8.71/1.94 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.71/1.94 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.53/2.02 Prover 1: Found proof (size 23)
% 9.53/2.02 Prover 1: proved (1397ms)
% 9.53/2.02 Prover 11: Preprocessing ...
% 9.75/2.04 Prover 7: Preprocessing ...
% 9.75/2.04 Prover 8: Preprocessing ...
% 9.75/2.05 Prover 10: Preprocessing ...
% 9.75/2.09 Prover 7: stopped
% 9.75/2.09 Prover 10: stopped
% 9.75/2.12 Prover 11: stopped
% 10.52/2.16 Prover 4: Constructing countermodel ...
% 10.52/2.19 Prover 4: stopped
% 11.01/2.21 Prover 8: Warning: ignoring some quantifiers
% 11.01/2.23 Prover 8: Constructing countermodel ...
% 11.01/2.23 Prover 8: stopped
% 11.01/2.25 Prover 0: Proving ...
% 11.01/2.26 Prover 0: stopped
% 11.01/2.26
% 11.01/2.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.01/2.26
% 11.01/2.26 % SZS output start Proof for theBenchmark
% 11.40/2.27 Assumptions after simplification:
% 11.40/2.27 ---------------------------------
% 11.40/2.27
% 11.40/2.27 (a1_defns)
% 11.40/2.30 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 11.40/2.30 (reverse_line(v1) = v2) | ~ (unequally_directed_lines(v0, v2) = v3) | ~
% 11.40/2.30 $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) &
% 11.40/2.30 unequally_directed_opposite_lines(v0, v1) = v4)) & ! [v0: $i] : ! [v1:
% 11.40/2.30 $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~
% 11.40/2.30 (unequally_directed_lines(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) |
% 11.40/2.30 unequally_directed_opposite_lines(v0, v1) = 0)
% 11.40/2.30
% 11.40/2.30 (a4_defns)
% 11.54/2.30 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~
% 11.54/2.30 (equally_directed_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) |
% 11.54/2.30 unequally_directed_lines(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~
% 11.54/2.30 (equally_directed_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: int]
% 11.54/2.30 : ( ~ (v2 = 0) & unequally_directed_lines(v0, v1) = v2))
% 11.54/2.30
% 11.54/2.30 (a5_defns)
% 11.54/2.30 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~
% 11.54/2.30 (equally_directed_opposite_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) |
% 11.54/2.30 unequally_directed_opposite_lines(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] :
% 11.54/2.30 ( ~ (equally_directed_opposite_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ?
% 11.54/2.30 [v2: int] : ( ~ (v2 = 0) & unequally_directed_opposite_lines(v0, v1) = v2))
% 11.54/2.30
% 11.54/2.30 (con)
% 11.54/2.30 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) &
% 11.54/2.30 equally_directed_opposite_lines(v0, v1) = v3 & equally_directed_lines(v0,
% 11.54/2.30 v2) = 0 & reverse_line(v1) = v2 & $i(v2) & $i(v1) & $i(v0))
% 11.54/2.30
% 11.54/2.30 (function-axioms)
% 11.54/2.32 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 11.54/2.32 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (between_on_line(v5, v4,
% 11.54/2.32 v3, v2) = v1) | ~ (between_on_line(v5, v4, v3, v2) = v0)) & ! [v0:
% 11.54/2.32 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.54/2.32 : ! [v4: $i] : (v1 = v0 | ~ (before_on_line(v4, v3, v2) = v1) | ~
% 11.54/2.32 (before_on_line(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.54/2.32 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~
% 11.54/2.32 (divides_points(v4, v3, v2) = v1) | ~ (divides_points(v4, v3, v2) = v0)) &
% 11.54/2.32 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) =
% 11.54/2.32 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 11.54/2.32 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0))
% 11.54/2.32 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 11.54/2.32 [v3: $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~
% 11.54/2.32 (distinct_lines(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 11.54/2.32 ! [v3: $i] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~
% 11.54/2.32 (line_connecting(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.54/2.32 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3, v2) = v0)) & !
% 11.54/2.32 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 11.54/2.32 $i] : (v1 = v0 | ~ (incident_point_and_line(v3, v2) = v1) | ~
% 11.54/2.32 (incident_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.54/2.32 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & !
% 11.54/2.32 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 11.54/2.32 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~
% 11.54/2.32 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.54/2.32 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (equally_directed_opposite_lines(v3, v2) = v1) | ~
% 11.54/2.32 (equally_directed_opposite_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool]
% 11.54/2.32 : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (equally_directed_lines(v3, v2) = v1) | ~ (equally_directed_lines(v3, v2) =
% 11.54/2.32 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 11.54/2.32 $i] : ! [v3: $i] : (v1 = v0 | ~ (left_convergent_lines(v3, v2) = v1) | ~
% 11.54/2.32 (left_convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.54/2.32 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (right_convergent_lines(v3, v2) = v1) | ~ (right_convergent_lines(v3, v2) =
% 11.54/2.32 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 11.54/2.32 $i] : ! [v3: $i] : (v1 = v0 | ~ (left_apart_point(v3, v2) = v1) | ~
% 11.54/2.32 (left_apart_point(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.54/2.32 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (right_apart_point(v3, v2) = v1) | ~ (right_apart_point(v3, v2) = v0)) & !
% 11.54/2.32 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 11.54/2.32 $i] : (v1 = v0 | ~ (unequally_directed_lines(v3, v2) = v1) | ~
% 11.54/2.32 (unequally_directed_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.54/2.32 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.54/2.32 (unequally_directed_opposite_lines(v3, v2) = v1) | ~
% 11.54/2.32 (unequally_directed_opposite_lines(v3, v2) = v0)) & ! [v0:
% 11.54/2.32 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 11.54/2.32 ~ (point(v2) = v1) | ~ (point(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.54/2.32 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (line(v2) = v1) | ~
% 11.54/2.32 (line(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 11.54/2.32 (reverse_line(v2) = v1) | ~ (reverse_line(v2) = v0))
% 11.54/2.32
% 11.54/2.32 Further assumptions not needed in the proof:
% 11.54/2.32 --------------------------------------------
% 11.54/2.32 a2_defns, a3_defns, a6_defns, a7_defns, a8_defns, a9_defns, ax10_basics,
% 11.54/2.32 ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons,
% 11.54/2.32 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs,
% 11.54/2.32 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs,
% 11.54/2.32 ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs,
% 11.54/2.32 ax9_basics, ax9_cons_objs
% 11.54/2.32
% 11.54/2.32 Those formulas are unsatisfiable:
% 11.54/2.32 ---------------------------------
% 11.54/2.32
% 11.54/2.32 Begin of proof
% 11.54/2.32 |
% 11.54/2.32 | ALPHA: (a1_defns) implies:
% 11.54/2.32 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 11.54/2.32 | (reverse_line(v1) = v2) | ~ (unequally_directed_lines(v0, v2) = v3)
% 11.54/2.32 | | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) &
% 11.54/2.32 | unequally_directed_opposite_lines(v0, v1) = v4))
% 11.54/2.32 |
% 11.54/2.32 | ALPHA: (a4_defns) implies:
% 11.54/2.32 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (equally_directed_lines(v0, v1) = 0) |
% 11.54/2.32 | ~ $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) &
% 11.54/2.32 | unequally_directed_lines(v0, v1) = v2))
% 11.54/2.32 |
% 11.54/2.32 | ALPHA: (a5_defns) implies:
% 11.54/2.32 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~
% 11.54/2.32 | (equally_directed_opposite_lines(v0, v1) = v2) | ~ $i(v1) | ~
% 11.54/2.32 | $i(v0) | unequally_directed_opposite_lines(v0, v1) = 0)
% 11.54/2.32 |
% 11.54/2.32 | ALPHA: (function-axioms) implies:
% 11.54/2.32 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 11.54/2.32 | ! [v3: $i] : (v1 = v0 | ~ (unequally_directed_opposite_lines(v3, v2)
% 11.54/2.32 | = v1) | ~ (unequally_directed_opposite_lines(v3, v2) = v0))
% 11.54/2.32 |
% 11.54/2.32 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2,
% 11.54/2.32 | all_39_3 gives:
% 11.54/2.32 | (5) ~ (all_39_0 = 0) & equally_directed_opposite_lines(all_39_3, all_39_2)
% 11.54/2.32 | = all_39_0 & equally_directed_lines(all_39_3, all_39_1) = 0 &
% 11.54/2.33 | reverse_line(all_39_2) = all_39_1 & $i(all_39_1) & $i(all_39_2) &
% 11.54/2.33 | $i(all_39_3)
% 11.54/2.33 |
% 11.54/2.33 | ALPHA: (5) implies:
% 11.68/2.33 | (6) ~ (all_39_0 = 0)
% 11.68/2.33 | (7) $i(all_39_3)
% 11.68/2.33 | (8) $i(all_39_2)
% 11.68/2.33 | (9) $i(all_39_1)
% 11.68/2.33 | (10) reverse_line(all_39_2) = all_39_1
% 11.68/2.33 | (11) equally_directed_lines(all_39_3, all_39_1) = 0
% 11.68/2.33 | (12) equally_directed_opposite_lines(all_39_3, all_39_2) = all_39_0
% 11.68/2.33 |
% 11.68/2.33 | GROUND_INST: instantiating (2) with all_39_3, all_39_1, simplifying with (7),
% 11.68/2.33 | (9), (11) gives:
% 11.68/2.33 | (13) ? [v0: int] : ( ~ (v0 = 0) & unequally_directed_lines(all_39_3,
% 11.68/2.33 | all_39_1) = v0)
% 11.68/2.33 |
% 11.68/2.33 | GROUND_INST: instantiating (3) with all_39_3, all_39_2, all_39_0, simplifying
% 11.68/2.33 | with (7), (8), (12) gives:
% 11.68/2.33 | (14) all_39_0 = 0 | unequally_directed_opposite_lines(all_39_3, all_39_2) =
% 11.68/2.33 | 0
% 11.68/2.33 |
% 11.68/2.33 | DELTA: instantiating (13) with fresh symbol all_46_0 gives:
% 11.68/2.33 | (15) ~ (all_46_0 = 0) & unequally_directed_lines(all_39_3, all_39_1) =
% 11.68/2.33 | all_46_0
% 11.68/2.33 |
% 11.68/2.33 | ALPHA: (15) implies:
% 11.68/2.33 | (16) ~ (all_46_0 = 0)
% 11.68/2.33 | (17) unequally_directed_lines(all_39_3, all_39_1) = all_46_0
% 11.68/2.33 |
% 11.68/2.33 | BETA: splitting (14) gives:
% 11.68/2.33 |
% 11.68/2.33 | Case 1:
% 11.68/2.33 | |
% 11.68/2.33 | | (18) unequally_directed_opposite_lines(all_39_3, all_39_2) = 0
% 11.68/2.33 | |
% 11.68/2.33 | | GROUND_INST: instantiating (1) with all_39_3, all_39_2, all_39_1, all_46_0,
% 11.68/2.33 | | simplifying with (7), (8), (10), (17) gives:
% 11.68/2.33 | | (19) all_46_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) &
% 11.68/2.33 | | unequally_directed_opposite_lines(all_39_3, all_39_2) = v0)
% 11.68/2.33 | |
% 11.68/2.33 | | BETA: splitting (19) gives:
% 11.68/2.33 | |
% 11.68/2.33 | | Case 1:
% 11.68/2.33 | | |
% 11.68/2.33 | | | (20) all_46_0 = 0
% 11.68/2.33 | | |
% 11.68/2.33 | | | REDUCE: (16), (20) imply:
% 11.68/2.33 | | | (21) $false
% 11.68/2.33 | | |
% 11.68/2.33 | | | CLOSE: (21) is inconsistent.
% 11.68/2.33 | | |
% 11.68/2.33 | | Case 2:
% 11.68/2.33 | | |
% 11.68/2.33 | | | (22) ? [v0: int] : ( ~ (v0 = 0) &
% 11.68/2.33 | | | unequally_directed_opposite_lines(all_39_3, all_39_2) = v0)
% 11.68/2.33 | | |
% 11.68/2.33 | | | DELTA: instantiating (22) with fresh symbol all_63_0 gives:
% 11.68/2.33 | | | (23) ~ (all_63_0 = 0) & unequally_directed_opposite_lines(all_39_3,
% 11.68/2.33 | | | all_39_2) = all_63_0
% 11.68/2.33 | | |
% 11.68/2.33 | | | ALPHA: (23) implies:
% 11.68/2.34 | | | (24) ~ (all_63_0 = 0)
% 11.68/2.34 | | | (25) unequally_directed_opposite_lines(all_39_3, all_39_2) = all_63_0
% 11.68/2.34 | | |
% 11.68/2.34 | | | GROUND_INST: instantiating (4) with 0, all_63_0, all_39_2, all_39_3,
% 11.68/2.34 | | | simplifying with (18), (25) gives:
% 11.68/2.34 | | | (26) all_63_0 = 0
% 11.68/2.34 | | |
% 11.68/2.34 | | | REDUCE: (24), (26) imply:
% 11.68/2.34 | | | (27) $false
% 11.68/2.34 | | |
% 11.68/2.34 | | | CLOSE: (27) is inconsistent.
% 11.68/2.34 | | |
% 11.68/2.34 | | End of split
% 11.68/2.34 | |
% 11.68/2.34 | Case 2:
% 11.68/2.34 | |
% 11.68/2.34 | | (28) all_39_0 = 0
% 11.68/2.34 | |
% 11.68/2.34 | | REDUCE: (6), (28) imply:
% 11.68/2.34 | | (29) $false
% 11.68/2.34 | |
% 11.68/2.34 | | CLOSE: (29) is inconsistent.
% 11.68/2.34 | |
% 11.68/2.34 | End of split
% 11.68/2.34 |
% 11.68/2.34 End of proof
% 11.68/2.34 % SZS output end Proof for theBenchmark
% 11.68/2.34
% 11.68/2.34 1738ms
%------------------------------------------------------------------------------