TSTP Solution File: SWV410+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV410+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 : n022.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:14 EDT 2023
% Result : Theorem 6.45s 1.58s
% Output : Proof 7.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV410+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 04:14:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.11/1.04 Prover 1: Preprocessing ...
% 2.11/1.04 Prover 4: Preprocessing ...
% 2.72/1.08 Prover 5: Preprocessing ...
% 2.72/1.08 Prover 3: Preprocessing ...
% 2.72/1.08 Prover 6: Preprocessing ...
% 2.72/1.08 Prover 0: Preprocessing ...
% 2.72/1.08 Prover 2: Preprocessing ...
% 5.30/1.46 Prover 5: Proving ...
% 5.30/1.47 Prover 6: Proving ...
% 5.83/1.49 Prover 1: Constructing countermodel ...
% 5.83/1.49 Prover 4: Constructing countermodel ...
% 5.83/1.50 Prover 3: Constructing countermodel ...
% 5.83/1.50 Prover 0: Proving ...
% 5.83/1.51 Prover 2: Proving ...
% 6.45/1.57 Prover 3: proved (925ms)
% 6.45/1.58
% 6.45/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.45/1.58
% 6.45/1.58 Prover 0: stopped
% 6.45/1.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.45/1.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.54/1.59 Prover 5: proved (937ms)
% 6.54/1.59 Prover 2: proved (946ms)
% 6.54/1.59
% 6.54/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.54/1.59
% 6.54/1.59
% 6.54/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.54/1.59
% 6.54/1.59 Prover 6: proved (938ms)
% 6.54/1.59
% 6.54/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.54/1.59
% 6.54/1.60 Prover 4: Found proof (size 6)
% 6.54/1.60 Prover 1: Found proof (size 6)
% 6.54/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.54/1.60 Prover 4: proved (946ms)
% 6.54/1.60 Prover 1: proved (956ms)
% 6.54/1.60 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.54/1.60 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.54/1.61 Prover 7: Preprocessing ...
% 6.73/1.61 Prover 8: Preprocessing ...
% 6.73/1.62 Prover 10: Preprocessing ...
% 6.84/1.63 Prover 7: stopped
% 6.84/1.64 Prover 11: Preprocessing ...
% 6.84/1.64 Prover 13: Preprocessing ...
% 6.84/1.65 Prover 10: stopped
% 6.84/1.67 Prover 11: stopped
% 6.84/1.69 Prover 13: stopped
% 6.84/1.70 Prover 8: Warning: ignoring some quantifiers
% 7.39/1.72 Prover 8: Constructing countermodel ...
% 7.39/1.72 Prover 8: stopped
% 7.39/1.72
% 7.39/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.39/1.72
% 7.39/1.73 % SZS output start Proof for theBenchmark
% 7.39/1.73 Assumptions after simplification:
% 7.39/1.73 ---------------------------------
% 7.39/1.73
% 7.39/1.73 (ax20)
% 7.39/1.76 $i(create_slb) & ! [v0: $i] : ( ~ (contains_slb(create_slb, v0) = 0) | ~
% 7.39/1.76 $i(v0))
% 7.39/1.76
% 7.39/1.76 (l46_co)
% 7.39/1.76 $i(create_slb) & ? [v0: $i] : (contains_slb(create_slb, v0) = 0 & $i(v0) & !
% 7.39/1.76 [v1: $i] : ( ~ (pair_in_list(create_slb, v0, v1) = 0) | ~ $i(v1)))
% 7.39/1.76
% 7.39/1.76 Further assumptions not needed in the proof:
% 7.39/1.76 --------------------------------------------
% 7.39/1.76 ax18, ax19, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 7.39/1.76 bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity
% 7.39/1.76
% 7.39/1.76 Those formulas are unsatisfiable:
% 7.39/1.76 ---------------------------------
% 7.39/1.76
% 7.39/1.76 Begin of proof
% 7.39/1.76 |
% 7.39/1.76 | ALPHA: (ax20) implies:
% 7.39/1.76 | (1) ! [v0: $i] : ( ~ (contains_slb(create_slb, v0) = 0) | ~ $i(v0))
% 7.39/1.76 |
% 7.39/1.76 | ALPHA: (l46_co) implies:
% 7.39/1.76 | (2) ? [v0: $i] : (contains_slb(create_slb, v0) = 0 & $i(v0) & ! [v1: $i]
% 7.39/1.76 | : ( ~ (pair_in_list(create_slb, v0, v1) = 0) | ~ $i(v1)))
% 7.39/1.76 |
% 7.39/1.76 | DELTA: instantiating (2) with fresh symbol all_23_0 gives:
% 7.39/1.77 | (3) contains_slb(create_slb, all_23_0) = 0 & $i(all_23_0) & ! [v0: $i] : (
% 7.39/1.77 | ~ (pair_in_list(create_slb, all_23_0, v0) = 0) | ~ $i(v0))
% 7.39/1.77 |
% 7.39/1.77 | ALPHA: (3) implies:
% 7.39/1.77 | (4) $i(all_23_0)
% 7.39/1.77 | (5) contains_slb(create_slb, all_23_0) = 0
% 7.39/1.77 |
% 7.39/1.77 | GROUND_INST: instantiating (1) with all_23_0, simplifying with (4), (5) gives:
% 7.39/1.77 | (6) $false
% 7.39/1.77 |
% 7.39/1.77 | CLOSE: (6) is inconsistent.
% 7.39/1.77 |
% 7.39/1.77 End of proof
% 7.39/1.77 % SZS output end Proof for theBenchmark
% 7.39/1.77
% 7.39/1.77 1150ms
%------------------------------------------------------------------------------