TSTP Solution File: CSR031+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : CSR031+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n009.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 21:36:32 EDT 2023
% Result : Theorem 7.04s 1.71s
% Output : Proof 9.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR031+1 : TPTP v8.1.2. Released v3.4.0.
% 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 11:12:50 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.67/0.64 ________ _____
% 0.67/0.64 ___ __ \_________(_)________________________________
% 0.67/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.67/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.67/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.67/0.64
% 0.67/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.67/0.64 (2023-06-19)
% 0.67/0.64
% 0.67/0.64 (c) Philipp Rümmer, 2009-2023
% 0.67/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.67/0.64 Amanda Stjerna.
% 0.67/0.64 Free software under BSD-3-Clause.
% 0.67/0.64
% 0.67/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.67/0.64
% 0.67/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.67/0.65 Running up to 7 provers in parallel.
% 0.67/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.17/1.18 Prover 1: Preprocessing ...
% 3.17/1.18 Prover 4: Preprocessing ...
% 3.39/1.21 Prover 0: Preprocessing ...
% 3.39/1.21 Prover 3: Preprocessing ...
% 3.39/1.23 Prover 2: Preprocessing ...
% 3.39/1.23 Prover 5: Preprocessing ...
% 3.39/1.23 Prover 6: Preprocessing ...
% 5.64/1.52 Prover 2: Constructing countermodel ...
% 5.64/1.52 Prover 5: Constructing countermodel ...
% 6.62/1.64 Prover 6: Constructing countermodel ...
% 6.62/1.65 Prover 3: Constructing countermodel ...
% 7.04/1.70 Prover 1: Constructing countermodel ...
% 7.04/1.71 Prover 2: proved (1045ms)
% 7.04/1.71
% 7.04/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.04/1.71
% 7.04/1.71 Prover 3: stopped
% 7.04/1.71 Prover 5: stopped
% 7.04/1.72 Prover 6: stopped
% 7.04/1.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.04/1.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.04/1.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.04/1.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.58/1.79 Prover 8: Preprocessing ...
% 7.58/1.80 Prover 4: Constructing countermodel ...
% 7.58/1.81 Prover 7: Preprocessing ...
% 8.10/1.84 Prover 10: Preprocessing ...
% 8.10/1.85 Prover 11: Preprocessing ...
% 8.10/1.86 Prover 0: Proving ...
% 8.10/1.86 Prover 0: stopped
% 8.10/1.87 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.10/1.90 Prover 7: Constructing countermodel ...
% 8.10/1.92 Prover 10: Constructing countermodel ...
% 8.75/1.92 Prover 1: Found proof (size 10)
% 8.75/1.92 Prover 1: proved (1261ms)
% 8.75/1.93 Prover 13: Preprocessing ...
% 8.75/1.93 Prover 4: stopped
% 8.75/1.93 Prover 11: stopped
% 8.75/1.94 Prover 13: stopped
% 8.75/1.94 Prover 7: stopped
% 8.75/1.94 Prover 10: stopped
% 8.75/1.96 Prover 8: Warning: ignoring some quantifiers
% 8.75/1.97 Prover 8: Constructing countermodel ...
% 9.11/1.98 Prover 8: stopped
% 9.11/1.98
% 9.11/1.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.11/1.98
% 9.11/1.98 % SZS output start Proof for theBenchmark
% 9.11/1.99 Assumptions after simplification:
% 9.11/1.99 ---------------------------------
% 9.11/1.99
% 9.11/1.99 (just34)
% 9.11/2.01 ! [v0: $i] : ! [v1: $i] : ( ~ (disjointwith(v0, v1) = 0) | ~ $i(v1) | ~
% 9.11/2.01 $i(v0) | collection(v0) = 0)
% 9.11/2.01
% 9.11/2.01 (just4)
% 9.11/2.02 ! [v0: $i] : ( ~ (individual(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 =
% 9.11/2.02 0) & collection(v0) = v1))
% 9.11/2.02
% 9.11/2.02 (just6)
% 9.11/2.02 individual(c_tptptptpcol_16_8398) = 0 & $i(c_tptptptpcol_16_8398)
% 9.11/2.02
% 9.11/2.02 (query31)
% 9.11/2.02 disjointwith(c_tptptptpcol_16_8398, c_tptpcol_16_18488) = 0 &
% 9.11/2.02 $i(c_tptpcol_16_18488) & $i(c_tptptptpcol_16_8398)
% 9.11/2.02
% 9.11/2.02 (function-axioms)
% 9.11/2.03 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 9.11/2.03 [v3: $i] : (v1 = v0 | ~ (genls(v3, v2) = v1) | ~ (genls(v3, v2) = v0)) & !
% 9.11/2.03 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 9.11/2.03 $i] : (v1 = v0 | ~ (arg2isa(v3, v2) = v1) | ~ (arg2isa(v3, v2) = v0)) & !
% 9.11/2.03 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 9.11/2.03 $i] : (v1 = v0 | ~ (genlinverse(v3, v2) = v1) | ~ (genlinverse(v3, v2) =
% 9.11/2.03 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 9.11/2.03 $i] : ! [v3: $i] : (v1 = v0 | ~ (genlpreds(v3, v2) = v1) | ~
% 9.11/2.03 (genlpreds(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, v2)
% 9.11/2.03 = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 9.11/2.03 (disjointwith(v3, v2) = v1) | ~ (disjointwith(v3, v2) = v0)) & ! [v0:
% 9.11/2.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 9.11/2.03 : (v1 = v0 | ~ (genlmt(v3, v2) = v1) | ~ (genlmt(v3, v2) = v0)) & ! [v0:
% 9.11/2.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 9.11/2.03 ~ (microtheory(v2) = v1) | ~ (microtheory(v2) = v0)) & ! [v0:
% 9.11/2.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 9.11/2.03 ~ (thing(v2) = v1) | ~ (thing(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 9.11/2.03 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (mtvisible(v2) = v1) |
% 9.11/2.03 ~ (mtvisible(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (binarypredicate(v2) = v1)
% 9.11/2.03 | ~ (binarypredicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (predicate(v2) = v1) | ~
% 9.11/2.03 (predicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (relation(v2) = v1) | ~
% 9.11/2.03 (relation(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (individual(v2) = v1) | ~
% 9.11/2.03 (individual(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (collection(v2) = v1) | ~
% 9.11/2.03 (collection(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 9.11/2.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~
% 9.11/2.03 (transitivebinarypredicate(v2) = v1) | ~ (transitivebinarypredicate(v2) =
% 9.11/2.03 v0))
% 9.11/2.03
% 9.11/2.03 Further assumptions not needed in the proof:
% 9.11/2.03 --------------------------------------------
% 9.11/2.03 just1, just10, just11, just12, just13, just14, just15, just16, just17, just18,
% 9.11/2.03 just19, just2, just20, just21, just22, just23, just24, just25, just26, just27,
% 9.11/2.03 just28, just29, just3, just30, just31, just32, just33, just35, just36, just37,
% 9.11/2.03 just38, just39, just40, just41, just42, just43, just44, just45, just46, just47,
% 9.11/2.03 just48, just49, just5, just50, just51, just52, just53, just54, just55, just7,
% 9.11/2.03 just8, just9
% 9.11/2.03
% 9.11/2.03 Those formulas are unsatisfiable:
% 9.11/2.03 ---------------------------------
% 9.11/2.03
% 9.11/2.03 Begin of proof
% 9.11/2.03 |
% 9.11/2.03 | ALPHA: (just6) implies:
% 9.11/2.03 | (1) individual(c_tptptptpcol_16_8398) = 0
% 9.11/2.03 |
% 9.11/2.03 | ALPHA: (query31) implies:
% 9.11/2.04 | (2) $i(c_tptptptpcol_16_8398)
% 9.11/2.04 | (3) $i(c_tptpcol_16_18488)
% 9.11/2.04 | (4) disjointwith(c_tptptptpcol_16_8398, c_tptpcol_16_18488) = 0
% 9.11/2.04 |
% 9.11/2.04 | ALPHA: (function-axioms) implies:
% 9.11/2.04 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 9.11/2.04 | (v1 = v0 | ~ (collection(v2) = v1) | ~ (collection(v2) = v0))
% 9.11/2.04 |
% 9.11/2.04 | GROUND_INST: instantiating (just4) with c_tptptptpcol_16_8398, simplifying
% 9.11/2.04 | with (1), (2) gives:
% 9.11/2.04 | (6) ? [v0: int] : ( ~ (v0 = 0) & collection(c_tptptptpcol_16_8398) = v0)
% 9.11/2.04 |
% 9.11/2.04 | GROUND_INST: instantiating (just34) with c_tptptptpcol_16_8398,
% 9.11/2.04 | c_tptpcol_16_18488, simplifying with (2), (3), (4) gives:
% 9.11/2.04 | (7) collection(c_tptptptpcol_16_8398) = 0
% 9.11/2.04 |
% 9.11/2.04 | DELTA: instantiating (6) with fresh symbol all_55_0 gives:
% 9.11/2.04 | (8) ~ (all_55_0 = 0) & collection(c_tptptptpcol_16_8398) = all_55_0
% 9.11/2.04 |
% 9.11/2.04 | ALPHA: (8) implies:
% 9.11/2.04 | (9) ~ (all_55_0 = 0)
% 9.11/2.04 | (10) collection(c_tptptptpcol_16_8398) = all_55_0
% 9.11/2.04 |
% 9.11/2.04 | GROUND_INST: instantiating (5) with 0, all_55_0, c_tptptptpcol_16_8398,
% 9.11/2.04 | simplifying with (7), (10) gives:
% 9.11/2.04 | (11) all_55_0 = 0
% 9.11/2.04 |
% 9.11/2.04 | REDUCE: (9), (11) imply:
% 9.11/2.04 | (12) $false
% 9.11/2.04 |
% 9.11/2.04 | CLOSE: (12) is inconsistent.
% 9.11/2.04 |
% 9.11/2.04 End of proof
% 9.11/2.04 % SZS output end Proof for theBenchmark
% 9.11/2.04
% 9.11/2.04 1402ms
%------------------------------------------------------------------------------