%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : CSR055+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 : n018.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:55 EDT 2023 % Result : Theorem 6.78s 1.67s % Output : Proof 9.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR055+1 : TPTP v8.1.2. Released v3.4.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n018.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon Aug 28 07:49:01 EDT 2023 % 0.12/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.80/1.09 Prover 1: Preprocessing ... % 2.80/1.09 Prover 4: Preprocessing ... % 3.12/1.14 Prover 2: Preprocessing ... % 3.12/1.14 Prover 5: Preprocessing ... % 3.12/1.14 Prover 0: Preprocessing ... % 3.12/1.14 Prover 6: Preprocessing ... % 3.12/1.14 Prover 3: Preprocessing ... % 4.89/1.46 Prover 2: Constructing countermodel ... % 4.89/1.47 Prover 5: Constructing countermodel ... % 5.60/1.59 Prover 6: Constructing countermodel ... % 6.78/1.64 Prover 1: Constructing countermodel ... % 6.78/1.67 Prover 5: proved (1039ms) % 6.78/1.67 % 6.78/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.78/1.67 % 6.78/1.68 Prover 6: stopped % 6.78/1.68 Prover 2: stopped % 7.33/1.71 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.33/1.71 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.33/1.71 Prover 3: Constructing countermodel ... % 7.33/1.71 Prover 3: stopped % 7.33/1.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.33/1.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.33/1.77 Prover 7: Preprocessing ... % 7.88/1.79 Prover 8: Preprocessing ... % 7.88/1.80 Prover 11: Preprocessing ... % 7.88/1.83 Prover 10: Preprocessing ... % 7.88/1.85 Prover 4: Constructing countermodel ... % 7.88/1.87 Prover 1: Found proof (size 10) % 7.88/1.87 Prover 1: proved (1246ms) % 8.56/1.88 Prover 0: Proving ... % 8.56/1.89 Prover 0: stopped % 8.56/1.89 Prover 7: Constructing countermodel ... % 8.68/1.90 Prover 4: stopped % 8.68/1.91 Prover 7: stopped % 8.68/1.91 Prover 11: stopped % 8.90/1.92 Prover 10: Constructing countermodel ... % 8.90/1.93 Prover 10: stopped % 8.90/1.97 Prover 8: Warning: ignoring some quantifiers % 8.90/1.99 Prover 8: Constructing countermodel ... % 8.90/2.00 Prover 8: stopped % 8.90/2.00 % 8.90/2.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.90/2.00 % 8.90/2.00 % SZS output start Proof for theBenchmark % 9.31/2.00 Assumptions after simplification: % 9.31/2.00 --------------------------------- % 9.31/2.00 % 9.31/2.00 (just1) % 9.31/2.03 individual(c_xskijump_thegame) = 0 & $i(c_xskijump_thegame) % 9.31/2.03 % 9.31/2.03 (just32) % 9.31/2.03 ! [v0: $i] : ! [v1: $i] : ( ~ (disjointwith(v0, v1) = 0) | ~ $i(v1) | ~ % 9.31/2.03 $i(v0) | collection(v0) = 0) % 9.31/2.03 % 9.31/2.03 (just5) % 9.31/2.03 ! [v0: $i] : ( ~ (individual(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = % 9.31/2.03 0) & collection(v0) = v1)) % 9.31/2.03 % 9.31/2.03 (query55) % 9.31/2.03 disjointwith(c_xskijump_thegame, c_tptpcol_16_35301) = 0 & % 9.31/2.03 $i(c_tptpcol_16_35301) & $i(c_xskijump_thegame) % 9.31/2.03 % 9.31/2.03 (function-axioms) % 9.31/2.05 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 9.31/2.05 [v3: $i] : (v1 = v0 | ~ (genls(v3, v2) = v1) | ~ (genls(v3, v2) = v0)) & ! % 9.31/2.05 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 9.31/2.05 $i] : (v1 = v0 | ~ (arg2isa(v3, v2) = v1) | ~ (arg2isa(v3, v2) = v0)) & ! % 9.31/2.05 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 9.31/2.05 $i] : (v1 = v0 | ~ (genlinverse(v3, v2) = v1) | ~ (genlinverse(v3, v2) = % 9.31/2.05 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 9.31/2.05 $i] : ! [v3: $i] : (v1 = v0 | ~ (genlpreds(v3, v2) = v1) | ~ % 9.31/2.05 (genlpreds(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, v2) % 9.31/2.05 = v1) | ~ (isa(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 9.31/2.05 (disjointwith(v3, v2) = v1) | ~ (disjointwith(v3, v2) = v0)) & ! [v0: % 9.31/2.05 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 9.31/2.05 : (v1 = v0 | ~ (genlmt(v3, v2) = v1) | ~ (genlmt(v3, v2) = v0)) & ! [v0: % 9.31/2.05 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 9.31/2.05 ~ (thing(v2) = v1) | ~ (thing(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 9.31/2.05 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (microtheory(v2) = v1) | % 9.31/2.05 ~ (microtheory(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ % 9.31/2.05 (mtvisible(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (binarypredicate(v2) = v1) % 9.31/2.05 | ~ (binarypredicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (predicate(v2) = v1) | ~ % 9.31/2.05 (predicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (relation(v2) = v1) | ~ % 9.31/2.05 (relation(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (collection(v2) = v1) | ~ % 9.31/2.05 (collection(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.31/2.05 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ % 9.31/2.05 (transitivebinarypredicate(v2) = v1) | ~ (transitivebinarypredicate(v2) = % 9.31/2.05 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 9.31/2.05 $i] : (v1 = v0 | ~ (individual(v2) = v1) | ~ (individual(v2) = v0)) % 9.31/2.05 % 9.31/2.05 Further assumptions not needed in the proof: % 9.31/2.05 -------------------------------------------- % 9.31/2.05 just10, just11, just12, just13, just14, just15, just16, just17, just18, just19, % 9.31/2.05 just2, just20, just21, just22, just23, just24, just25, just26, just27, just28, % 9.31/2.05 just29, just3, just30, just31, just33, just34, just35, just36, just37, just38, % 9.31/2.05 just39, just4, just40, just41, just42, just43, just44, just45, just46, just47, % 9.31/2.05 just48, just49, just50, just51, just52, just53, just54, just55, just6, just7, % 9.31/2.05 just8, just9 % 9.31/2.05 % 9.31/2.05 Those formulas are unsatisfiable: % 9.31/2.05 --------------------------------- % 9.31/2.05 % 9.31/2.05 Begin of proof % 9.31/2.05 | % 9.31/2.05 | ALPHA: (just1) implies: % 9.31/2.05 | (1) individual(c_xskijump_thegame) = 0 % 9.31/2.05 | % 9.31/2.05 | ALPHA: (query55) implies: % 9.31/2.05 | (2) $i(c_xskijump_thegame) % 9.31/2.05 | (3) $i(c_tptpcol_16_35301) % 9.31/2.05 | (4) disjointwith(c_xskijump_thegame, c_tptpcol_16_35301) = 0 % 9.31/2.05 | % 9.31/2.05 | ALPHA: (function-axioms) implies: % 9.31/2.06 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 9.31/2.06 | (v1 = v0 | ~ (collection(v2) = v1) | ~ (collection(v2) = v0)) % 9.31/2.06 | % 9.31/2.06 | GROUND_INST: instantiating (just5) with c_xskijump_thegame, simplifying with % 9.31/2.06 | (1), (2) gives: % 9.31/2.06 | (6) ? [v0: int] : ( ~ (v0 = 0) & collection(c_xskijump_thegame) = v0) % 9.31/2.06 | % 9.31/2.06 | GROUND_INST: instantiating (just32) with c_xskijump_thegame, % 9.31/2.06 | c_tptpcol_16_35301, simplifying with (2), (3), (4) gives: % 9.31/2.06 | (7) collection(c_xskijump_thegame) = 0 % 9.31/2.06 | % 9.31/2.06 | DELTA: instantiating (6) with fresh symbol all_55_0 gives: % 9.31/2.06 | (8) ~ (all_55_0 = 0) & collection(c_xskijump_thegame) = all_55_0 % 9.31/2.06 | % 9.31/2.06 | ALPHA: (8) implies: % 9.31/2.06 | (9) ~ (all_55_0 = 0) % 9.31/2.06 | (10) collection(c_xskijump_thegame) = all_55_0 % 9.31/2.06 | % 9.31/2.06 | GROUND_INST: instantiating (5) with 0, all_55_0, c_xskijump_thegame, % 9.31/2.06 | simplifying with (7), (10) gives: % 9.31/2.06 | (11) all_55_0 = 0 % 9.31/2.06 | % 9.31/2.06 | REDUCE: (9), (11) imply: % 9.31/2.06 | (12) $false % 9.31/2.06 | % 9.31/2.06 | CLOSE: (12) is inconsistent. % 9.31/2.06 | % 9.31/2.06 End of proof % 9.31/2.06 % SZS output end Proof for theBenchmark % 9.31/2.06 % 9.31/2.06 1458ms %------------------------------------------------------------------------------