%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : REL049+1 : TPTP v8.1.2. Released v4.0.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 13:43:10 EDT 2023 % Result : Theorem 4.21s 1.39s % Output : Proof 6.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n022.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Aug 25 22:42:55 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.02/0.99 Prover 4: Preprocessing ... % 2.02/0.99 Prover 1: Preprocessing ... % 2.71/1.02 Prover 3: Preprocessing ... % 2.71/1.02 Prover 6: Preprocessing ... % 2.71/1.02 Prover 5: Preprocessing ... % 2.71/1.02 Prover 0: Preprocessing ... % 2.71/1.02 Prover 2: Preprocessing ... % 4.21/1.25 Prover 1: Constructing countermodel ... % 4.21/1.26 Prover 3: Constructing countermodel ... % 4.21/1.26 Prover 6: Constructing countermodel ... % 4.21/1.32 Prover 0: Proving ... % 4.21/1.35 Prover 4: Constructing countermodel ... % 4.21/1.35 Prover 5: Proving ... % 4.21/1.39 Prover 3: proved (762ms) % 4.21/1.39 % 4.21/1.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.21/1.39 % 4.21/1.40 Prover 6: stopped % 4.21/1.40 Prover 5: stopped % 4.21/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.21/1.40 Prover 0: stopped % 4.21/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.21/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.21/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.04/1.43 Prover 1: Found proof (size 11) % 5.04/1.43 Prover 10: Preprocessing ... % 5.04/1.43 Prover 1: proved (811ms) % 5.04/1.43 Prover 4: stopped % 5.04/1.44 Prover 7: Preprocessing ... % 5.04/1.45 Prover 11: Preprocessing ... % 5.04/1.45 Prover 8: Preprocessing ... % 5.04/1.47 Prover 2: Proving ... % 5.04/1.47 Prover 10: stopped % 5.04/1.47 Prover 11: stopped % 5.04/1.47 Prover 7: stopped % 5.04/1.47 Prover 2: stopped % 6.04/1.51 Prover 8: Warning: ignoring some quantifiers % 6.04/1.52 Prover 8: Constructing countermodel ... % 6.04/1.52 Prover 8: stopped % 6.04/1.52 % 6.04/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.04/1.52 % 6.04/1.52 % SZS output start Proof for theBenchmark % 6.04/1.53 Assumptions after simplification: % 6.04/1.53 --------------------------------- % 6.04/1.53 % 6.04/1.53 (goals) % 6.04/1.56 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( ~ (v4 % 6.04/1.56 = v1) & join(v3, v1) = v4 & join(v2, v1) = v1 & join(v0, v2) = v3 & % 6.04/1.56 join(v0, v1) = v1 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 6.04/1.56 % 6.04/1.56 (maddux2_join_associativity) % 6.04/1.56 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 6.04/1.56 (join(v3, v2) = v4) | ~ (join(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 6.04/1.56 $i(v0) | ? [v5: $i] : (join(v1, v2) = v5 & join(v0, v5) = v4 & $i(v5) & % 6.04/1.56 $i(v4))) % 6.04/1.56 % 6.04/1.56 (function-axioms) % 6.04/1.57 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.04/1.57 (composition(v3, v2) = v1) | ~ (composition(v3, v2) = v0)) & ! [v0: $i] : % 6.04/1.57 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (meet(v3, v2) = v1) | % 6.04/1.57 ~ (meet(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 6.04/1.57 $i] : (v1 = v0 | ~ (join(v3, v2) = v1) | ~ (join(v3, v2) = v0)) & ! [v0: % 6.04/1.57 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (converse(v2) = v1) | ~ % 6.04/1.57 (converse(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | % 6.04/1.57 ~ (complement(v2) = v1) | ~ (complement(v2) = v0)) % 6.04/1.57 % 6.04/1.57 Further assumptions not needed in the proof: % 6.04/1.57 -------------------------------------------- % 6.04/1.57 composition_associativity, composition_distributivity, composition_identity, % 6.04/1.57 converse_additivity, converse_cancellativity, converse_idempotence, % 6.04/1.57 converse_multiplicativity, def_top, def_zero, maddux1_join_commutativity, % 6.04/1.57 maddux3_a_kind_of_de_Morgan, maddux4_definiton_of_meet % 6.04/1.57 % 6.04/1.57 Those formulas are unsatisfiable: % 6.04/1.57 --------------------------------- % 6.04/1.57 % 6.04/1.57 Begin of proof % 6.04/1.57 | % 6.04/1.57 | ALPHA: (function-axioms) implies: % 6.04/1.57 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.04/1.57 | (join(v3, v2) = v1) | ~ (join(v3, v2) = v0)) % 6.04/1.57 | % 6.04/1.57 | DELTA: instantiating (goals) with fresh symbols all_17_0, all_17_1, all_17_2, % 6.04/1.57 | all_17_3, all_17_4 gives: % 6.04/1.57 | (2) ~ (all_17_0 = all_17_3) & join(all_17_1, all_17_3) = all_17_0 & % 6.04/1.57 | join(all_17_2, all_17_3) = all_17_3 & join(all_17_4, all_17_2) = % 6.04/1.57 | all_17_1 & join(all_17_4, all_17_3) = all_17_3 & $i(all_17_0) & % 6.04/1.57 | $i(all_17_1) & $i(all_17_2) & $i(all_17_3) & $i(all_17_4) % 6.04/1.57 | % 6.04/1.57 | ALPHA: (2) implies: % 6.04/1.58 | (3) ~ (all_17_0 = all_17_3) % 6.04/1.58 | (4) $i(all_17_4) % 6.04/1.58 | (5) $i(all_17_3) % 6.04/1.58 | (6) $i(all_17_2) % 6.04/1.58 | (7) join(all_17_4, all_17_3) = all_17_3 % 6.04/1.58 | (8) join(all_17_4, all_17_2) = all_17_1 % 6.04/1.58 | (9) join(all_17_2, all_17_3) = all_17_3 % 6.40/1.58 | (10) join(all_17_1, all_17_3) = all_17_0 % 6.40/1.58 | % 6.40/1.58 | GROUND_INST: instantiating (maddux2_join_associativity) with all_17_4, % 6.40/1.58 | all_17_2, all_17_3, all_17_1, all_17_0, simplifying with (4), % 6.40/1.58 | (5), (6), (8), (10) gives: % 6.40/1.58 | (11) ? [v0: $i] : (join(all_17_2, all_17_3) = v0 & join(all_17_4, v0) = % 6.40/1.58 | all_17_0 & $i(v0) & $i(all_17_0)) % 6.40/1.58 | % 6.40/1.58 | DELTA: instantiating (11) with fresh symbol all_25_0 gives: % 6.40/1.58 | (12) join(all_17_2, all_17_3) = all_25_0 & join(all_17_4, all_25_0) = % 6.40/1.58 | all_17_0 & $i(all_25_0) & $i(all_17_0) % 6.40/1.58 | % 6.40/1.58 | ALPHA: (12) implies: % 6.40/1.58 | (13) join(all_17_4, all_25_0) = all_17_0 % 6.40/1.58 | (14) join(all_17_2, all_17_3) = all_25_0 % 6.40/1.58 | % 6.40/1.58 | GROUND_INST: instantiating (1) with all_17_3, all_25_0, all_17_3, all_17_2, % 6.40/1.58 | simplifying with (9), (14) gives: % 6.40/1.58 | (15) all_25_0 = all_17_3 % 6.40/1.58 | % 6.40/1.58 | REDUCE: (13), (15) imply: % 6.40/1.58 | (16) join(all_17_4, all_17_3) = all_17_0 % 6.40/1.58 | % 6.40/1.58 | GROUND_INST: instantiating (1) with all_17_3, all_17_0, all_17_3, all_17_4, % 6.40/1.58 | simplifying with (7), (16) gives: % 6.40/1.58 | (17) all_17_0 = all_17_3 % 6.40/1.58 | % 6.40/1.58 | REDUCE: (3), (17) imply: % 6.40/1.59 | (18) $false % 6.40/1.59 | % 6.40/1.59 | CLOSE: (18) is inconsistent. % 6.40/1.59 | % 6.40/1.59 End of proof % 6.40/1.59 % SZS output end Proof for theBenchmark % 6.40/1.59 % 6.40/1.59 983ms %------------------------------------------------------------------------------