%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : CSR032+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 : n004.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:33 EDT 2023 % Result : Theorem 9.27s 2.03s % Output : Proof 13.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR032+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.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Mon Aug 28 11:04:22 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.82/1.16 Prover 4: Preprocessing ... % 2.82/1.16 Prover 1: Preprocessing ... % 3.51/1.20 Prover 6: Preprocessing ... % 3.51/1.20 Prover 5: Preprocessing ... % 3.51/1.20 Prover 3: Preprocessing ... % 3.51/1.20 Prover 0: Preprocessing ... % 3.51/1.20 Prover 2: Preprocessing ... % 6.54/1.67 Prover 2: Proving ... % 6.54/1.68 Prover 5: Proving ... % 7.08/1.74 Prover 3: Warning: ignoring some quantifiers % 7.08/1.74 Prover 1: Warning: ignoring some quantifiers % 7.08/1.74 Prover 6: Proving ... % 7.08/1.77 Prover 3: Constructing countermodel ... % 7.56/1.78 Prover 1: Constructing countermodel ... % 7.56/1.85 Prover 0: Proving ... % 8.71/1.95 Prover 4: Constructing countermodel ... % 9.27/2.03 Prover 2: proved (1403ms) % 9.27/2.03 % 9.27/2.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.27/2.03 % 9.27/2.03 Prover 5: stopped % 9.27/2.03 Prover 6: stopped % 9.27/2.03 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.27/2.03 Prover 3: stopped % 9.27/2.04 Prover 0: stopped % 9.27/2.04 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.27/2.04 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.27/2.04 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.27/2.05 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.27/2.15 Prover 1: gave up % 9.27/2.16 Prover 10: Preprocessing ... % 9.27/2.16 Prover 11: Preprocessing ... % 9.27/2.16 Prover 8: Preprocessing ... % 9.27/2.17 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.27/2.18 Prover 7: Preprocessing ... % 9.27/2.19 Prover 13: Preprocessing ... % 10.09/2.24 Prover 10: Constructing countermodel ... % 10.09/2.25 Prover 16: Preprocessing ... % 10.09/2.27 Prover 7: Constructing countermodel ... % 11.54/2.36 Prover 13: Warning: ignoring some quantifiers % 11.54/2.37 Prover 13: Constructing countermodel ... % 11.54/2.39 Prover 16: Warning: ignoring some quantifiers % 11.54/2.40 Prover 8: Warning: ignoring some quantifiers % 11.54/2.40 Prover 16: Constructing countermodel ... % 12.25/2.42 Prover 8: Constructing countermodel ... % 12.84/2.52 Prover 11: Constructing countermodel ... % 12.84/2.54 Prover 10: Found proof (size 14) % 12.84/2.54 Prover 10: proved (506ms) % 12.84/2.54 Prover 16: stopped % 12.84/2.54 Prover 11: stopped % 12.84/2.54 Prover 7: stopped % 12.84/2.54 Prover 13: stopped % 12.84/2.54 Prover 4: stopped % 12.84/2.55 Prover 8: stopped % 12.84/2.55 % 12.84/2.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.84/2.55 % 12.84/2.55 % SZS output start Proof for theBenchmark % 12.84/2.56 Assumptions after simplification: % 12.84/2.56 --------------------------------- % 12.84/2.56 % 12.84/2.56 (just1) % 13.43/2.58 $i(c_france) & $i(s_agen) & ? [v0: $i] : (f_citynamedfn(s_agen, c_france) = % 13.43/2.58 v0 & $i(v0) & individual(v0)) % 13.43/2.58 % 13.43/2.58 (just57) % 13.43/2.58 $i(c_individual) & ! [v0: $i] : ( ~ $i(v0) | ~ individual(v0) | isa(v0, % 13.43/2.58 c_individual)) % 13.43/2.58 % 13.43/2.58 (query32) % 13.43/2.58 $i(c_reasoningaboutpossibleantecedentsmt) & $i(c_france) & $i(s_agen) & ? % 13.43/2.58 [v0: $i] : (f_citynamedfn(s_agen, c_france) = v0 & $i(v0) & % 13.43/2.58 mtvisible(c_reasoningaboutpossibleantecedentsmt) & ! [v1: $i] : ( ~ $i(v1) % 13.43/2.58 | ~ isa(v0, v1))) % 13.43/2.58 % 13.43/2.58 (function-axioms) % 13.43/2.59 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.43/2.59 (f_citynamedfn(v3, v2) = v1) | ~ (f_citynamedfn(v3, v2) = v0)) % 13.43/2.59 % 13.43/2.59 Further assumptions not needed in the proof: % 13.43/2.59 -------------------------------------------- % 13.43/2.59 just10, just11, just12, just13, just14, just15, just16, just17, just18, just19, % 13.43/2.59 just2, just20, just21, just22, just23, just24, just25, just26, just27, just28, % 13.43/2.59 just29, just3, just30, just31, just32, just33, just34, just35, just36, just37, % 13.43/2.59 just38, just39, just4, just40, just41, just42, just43, just44, just45, just46, % 13.43/2.59 just47, just48, just49, just5, just50, just51, just52, just53, just54, just55, % 13.43/2.59 just56, just58, just59, just6, just60, just61, just62, just63, just64, just65, % 13.43/2.59 just66, just67, just7, just8, just9 % 13.43/2.59 % 13.43/2.59 Those formulas are unsatisfiable: % 13.43/2.59 --------------------------------- % 13.43/2.59 % 13.43/2.59 Begin of proof % 13.43/2.59 | % 13.43/2.59 | ALPHA: (just1) implies: % 13.43/2.59 | (1) ? [v0: $i] : (f_citynamedfn(s_agen, c_france) = v0 & $i(v0) & % 13.43/2.59 | individual(v0)) % 13.43/2.59 | % 13.43/2.59 | ALPHA: (just57) implies: % 13.43/2.59 | (2) $i(c_individual) % 13.43/2.59 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ individual(v0) | isa(v0, c_individual)) % 13.43/2.59 | % 13.43/2.59 | ALPHA: (query32) implies: % 13.43/2.59 | (4) ? [v0: $i] : (f_citynamedfn(s_agen, c_france) = v0 & $i(v0) & % 13.43/2.59 | mtvisible(c_reasoningaboutpossibleantecedentsmt) & ! [v1: $i] : ( ~ % 13.43/2.59 | $i(v1) | ~ isa(v0, v1))) % 13.43/2.59 | % 13.43/2.59 | DELTA: instantiating (1) with fresh symbol all_61_0 gives: % 13.43/2.59 | (5) f_citynamedfn(s_agen, c_france) = all_61_0 & $i(all_61_0) & % 13.43/2.59 | individual(all_61_0) % 13.43/2.59 | % 13.43/2.59 | ALPHA: (5) implies: % 13.43/2.59 | (6) individual(all_61_0) % 13.43/2.59 | (7) f_citynamedfn(s_agen, c_france) = all_61_0 % 13.43/2.59 | % 13.43/2.59 | DELTA: instantiating (4) with fresh symbol all_63_0 gives: % 13.43/2.60 | (8) f_citynamedfn(s_agen, c_france) = all_63_0 & $i(all_63_0) & % 13.43/2.60 | mtvisible(c_reasoningaboutpossibleantecedentsmt) & ! [v0: $i] : ( ~ % 13.43/2.60 | $i(v0) | ~ isa(all_63_0, v0)) % 13.43/2.60 | % 13.43/2.60 | ALPHA: (8) implies: % 13.43/2.60 | (9) $i(all_63_0) % 13.43/2.60 | (10) f_citynamedfn(s_agen, c_france) = all_63_0 % 13.43/2.60 | (11) ! [v0: $i] : ( ~ $i(v0) | ~ isa(all_63_0, v0)) % 13.43/2.60 | % 13.43/2.60 | GROUND_INST: instantiating (function-axioms) with all_61_0, all_63_0, % 13.43/2.60 | c_france, s_agen, simplifying with (7), (10) gives: % 13.43/2.60 | (12) all_63_0 = all_61_0 % 13.43/2.60 | % 13.43/2.60 | REDUCE: (9), (12) imply: % 13.43/2.60 | (13) $i(all_61_0) % 13.43/2.60 | % 13.43/2.60 | GROUND_INST: instantiating (3) with all_61_0, simplifying with (6), (13) % 13.43/2.60 | gives: % 13.43/2.60 | (14) isa(all_61_0, c_individual) % 13.43/2.60 | % 13.43/2.60 | GROUND_INST: instantiating (11) with c_individual, simplifying with (2) gives: % 13.43/2.60 | (15) ~ isa(all_63_0, c_individual) % 13.43/2.60 | % 13.43/2.60 | REDUCE: (12), (15) imply: % 13.43/2.60 | (16) ~ isa(all_61_0, c_individual) % 13.43/2.60 | % 13.43/2.60 | PRED_UNIFY: (14), (16) imply: % 13.43/2.60 | (17) $false % 13.43/2.60 | % 13.43/2.60 | CLOSE: (17) is inconsistent. % 13.43/2.60 | % 13.43/2.60 End of proof % 13.43/2.60 % SZS output end Proof for theBenchmark % 13.43/2.60 % 13.43/2.60 1996ms %------------------------------------------------------------------------------