TSTP Solution File: SWV395+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV395+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n026.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 : Thu Aug 31 22:56:09 EDT 2023
% Result : Theorem 9.20s 2.10s
% Output : Proof 11.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV395+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 29 03:45:20 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.19/0.61 ________ _____
% 0.19/0.61 ___ __ \_________(_)________________________________
% 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63 Running up to 7 provers in parallel.
% 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.78/1.22 Prover 4: Preprocessing ...
% 3.78/1.22 Prover 1: Preprocessing ...
% 3.78/1.24 Prover 6: Preprocessing ...
% 3.78/1.24 Prover 5: Preprocessing ...
% 3.78/1.24 Prover 2: Preprocessing ...
% 3.78/1.24 Prover 0: Preprocessing ...
% 3.78/1.25 Prover 3: Preprocessing ...
% 7.91/1.83 Prover 1: Warning: ignoring some quantifiers
% 8.31/1.87 Prover 3: Warning: ignoring some quantifiers
% 8.31/1.90 Prover 1: Constructing countermodel ...
% 8.31/1.90 Prover 3: Constructing countermodel ...
% 8.79/1.93 Prover 5: Proving ...
% 8.79/1.93 Prover 6: Proving ...
% 8.79/1.95 Prover 4: Constructing countermodel ...
% 9.20/1.98 Prover 0: Proving ...
% 9.20/2.04 Prover 2: Proving ...
% 9.20/2.10 Prover 6: proved (1463ms)
% 9.20/2.10
% 9.20/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.20/2.10
% 9.20/2.10 Prover 3: proved (1467ms)
% 9.20/2.10
% 9.20/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.20/2.10
% 9.20/2.11 Prover 0: stopped
% 9.20/2.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.20/2.12 Prover 5: stopped
% 9.20/2.13 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.20/2.13 Prover 2: stopped
% 9.20/2.13 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.20/2.13 Prover 1: Found proof (size 6)
% 9.20/2.13 Prover 1: proved (1494ms)
% 9.20/2.13 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.20/2.13 Prover 4: Found proof (size 6)
% 9.20/2.13 Prover 4: proved (1496ms)
% 9.20/2.13 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.20/2.15 Prover 7: Preprocessing ...
% 9.20/2.16 Prover 8: Preprocessing ...
% 9.83/2.17 Prover 13: Preprocessing ...
% 9.83/2.17 Prover 10: Preprocessing ...
% 9.83/2.18 Prover 11: Preprocessing ...
% 9.83/2.20 Prover 7: stopped
% 10.78/2.22 Prover 10: stopped
% 10.78/2.24 Prover 11: stopped
% 11.12/2.26 Prover 13: stopped
% 11.12/2.32 Prover 8: Warning: ignoring some quantifiers
% 11.60/2.34 Prover 8: Constructing countermodel ...
% 11.60/2.36 Prover 8: stopped
% 11.60/2.36
% 11.60/2.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.60/2.36
% 11.60/2.36 % SZS output start Proof for theBenchmark
% 11.60/2.36 Assumptions after simplification:
% 11.60/2.36 ---------------------------------
% 11.60/2.36
% 11.60/2.36 (ax22)
% 11.60/2.39 $i(create_slb) & ! [v0: $i] : ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0,
% 11.60/2.39 v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 11.60/2.39
% 11.60/2.39 (l31_co)
% 11.60/2.39 $i(create_slb) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ?
% 11.60/2.39 [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & ok(v5) =
% 11.60/2.39 0 & triple(v0, create_slb, v1) = v4 & remove_cpq(v4, v2) = v5 &
% 11.60/2.39 remove_slb(create_slb, v2) = v6 & pair_in_list(v6, v2, v3) = v7 &
% 11.60/2.39 pair_in_list(create_slb, v2, v3) = 0 & strictly_less_than(v2, v3) = 0 &
% 11.60/2.39 $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 11.60/2.39
% 11.60/2.39 Further assumptions not needed in the proof:
% 11.60/2.39 --------------------------------------------
% 11.60/2.39 ax18, ax19, ax20, ax21, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, ax31,
% 11.60/2.39 ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, ax44,
% 11.60/2.39 ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest,
% 11.60/2.39 reflexivity, stricly_smaller_definition, totality, transitivity
% 11.60/2.39
% 11.60/2.39 Those formulas are unsatisfiable:
% 11.60/2.39 ---------------------------------
% 11.60/2.39
% 11.60/2.39 Begin of proof
% 11.85/2.39 |
% 11.85/2.39 | ALPHA: (ax22) implies:
% 11.85/2.39 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0, v1) = 0)
% 11.85/2.39 | | ~ $i(v1) | ~ $i(v0))
% 11.85/2.39 |
% 11.85/2.39 | ALPHA: (l31_co) implies:
% 11.85/2.40 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] :
% 11.85/2.40 | ? [v5: $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & ok(v5) = 0 &
% 11.85/2.40 | triple(v0, create_slb, v1) = v4 & remove_cpq(v4, v2) = v5 &
% 11.85/2.40 | remove_slb(create_slb, v2) = v6 & pair_in_list(v6, v2, v3) = v7 &
% 11.85/2.40 | pair_in_list(create_slb, v2, v3) = 0 & strictly_less_than(v2, v3) = 0
% 11.85/2.40 | & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 11.85/2.40 |
% 11.85/2.40 | DELTA: instantiating (2) with fresh symbols all_44_0, all_44_1, all_44_2,
% 11.85/2.40 | all_44_3, all_44_4, all_44_5, all_44_6, all_44_7 gives:
% 11.85/2.40 | (3) ~ (all_44_0 = 0) & ok(all_44_2) = 0 & triple(all_44_7, create_slb,
% 11.85/2.40 | all_44_6) = all_44_3 & remove_cpq(all_44_3, all_44_5) = all_44_2 &
% 11.85/2.40 | remove_slb(create_slb, all_44_5) = all_44_1 & pair_in_list(all_44_1,
% 11.85/2.40 | all_44_5, all_44_4) = all_44_0 & pair_in_list(create_slb, all_44_5,
% 11.85/2.40 | all_44_4) = 0 & strictly_less_than(all_44_5, all_44_4) = 0 &
% 11.85/2.40 | $i(all_44_1) & $i(all_44_2) & $i(all_44_3) & $i(all_44_4) &
% 11.85/2.40 | $i(all_44_5) & $i(all_44_6) & $i(all_44_7)
% 11.85/2.40 |
% 11.85/2.40 | ALPHA: (3) implies:
% 11.85/2.40 | (4) $i(all_44_5)
% 11.85/2.40 | (5) $i(all_44_4)
% 11.85/2.40 | (6) pair_in_list(create_slb, all_44_5, all_44_4) = 0
% 11.85/2.40 |
% 11.85/2.40 | GROUND_INST: instantiating (1) with all_44_5, all_44_4, simplifying with (4),
% 11.85/2.40 | (5), (6) gives:
% 11.85/2.40 | (7) $false
% 11.85/2.40 |
% 11.85/2.40 | CLOSE: (7) is inconsistent.
% 11.85/2.40 |
% 11.85/2.40 End of proof
% 11.85/2.40 % SZS output end Proof for theBenchmark
% 11.85/2.40
% 11.85/2.40 1791ms
%------------------------------------------------------------------------------