%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM836+2 : TPTP v8.1.2. Released v4.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n014.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 11:50:17 EDT 2023 % Result : Theorem 4.69s 1.56s % Output : Proof 6.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.14 % Problem : NUM836+2 : TPTP v8.1.2. Released v4.1.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n014.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 : Fri Aug 25 15:56:18 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.63 ________ _____ % 0.21/0.63 ___ __ \_________(_)________________________________ % 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.63 % 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.63 (2023-06-19) % 0.21/0.63 % 0.21/0.63 (c) Philipp Rümmer, 2009-2023 % 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.63 Amanda Stjerna. % 0.21/0.63 Free software under BSD-3-Clause. % 0.21/0.63 % 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.63 % 0.21/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.39/1.09 Prover 1: Preprocessing ... % 2.39/1.09 Prover 4: Preprocessing ... % 2.39/1.14 Prover 6: Preprocessing ... % 2.39/1.14 Prover 5: Preprocessing ... % 2.39/1.14 Prover 2: Preprocessing ... % 2.39/1.14 Prover 0: Preprocessing ... % 2.39/1.14 Prover 3: Preprocessing ... % 3.86/1.35 Prover 1: Warning: ignoring some quantifiers % 3.86/1.37 Prover 4: Warning: ignoring some quantifiers % 3.86/1.38 Prover 1: Constructing countermodel ... % 3.86/1.42 Prover 3: Warning: ignoring some quantifiers % 3.86/1.42 Prover 0: Proving ... % 3.86/1.43 Prover 3: Constructing countermodel ... % 3.86/1.43 Prover 4: Constructing countermodel ... % 3.86/1.45 Prover 6: Proving ... % 3.86/1.46 Prover 5: Proving ... % 3.86/1.50 Prover 2: Proving ... % 4.69/1.56 Prover 0: proved (911ms) % 4.69/1.56 % 4.69/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.69/1.56 % 4.69/1.56 Prover 3: stopped % 4.69/1.56 Prover 5: stopped % 4.69/1.56 Prover 2: stopped % 4.69/1.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.69/1.57 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.69/1.57 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.69/1.57 Prover 6: stopped % 4.69/1.57 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.69/1.57 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.69/1.59 Prover 7: Preprocessing ... % 5.75/1.60 Prover 8: Preprocessing ... % 5.75/1.60 Prover 10: Preprocessing ... % 5.75/1.61 Prover 11: Preprocessing ... % 5.92/1.62 Prover 13: Preprocessing ... % 5.92/1.68 Prover 4: Found proof (size 18) % 5.92/1.69 Prover 10: Warning: ignoring some quantifiers % 5.92/1.69 Prover 7: Warning: ignoring some quantifiers % 5.92/1.69 Prover 10: Constructing countermodel ... % 5.92/1.69 Prover 7: Constructing countermodel ... % 5.92/1.70 Prover 4: proved (1026ms) % 5.92/1.70 Prover 8: Warning: ignoring some quantifiers % 6.52/1.70 Prover 1: stopped % 6.52/1.70 Prover 7: stopped % 6.52/1.71 Prover 10: stopped % 6.52/1.72 Prover 13: Warning: ignoring some quantifiers % 6.52/1.72 Prover 8: Constructing countermodel ... % 6.52/1.72 Prover 11: Warning: ignoring some quantifiers % 6.52/1.72 Prover 8: stopped % 6.52/1.73 Prover 13: Constructing countermodel ... % 6.52/1.73 Prover 11: Constructing countermodel ... % 6.52/1.73 Prover 13: stopped % 6.52/1.74 Prover 11: stopped % 6.52/1.74 % 6.52/1.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.52/1.74 % 6.52/1.74 % SZS output start Proof for theBenchmark % 6.52/1.74 Assumptions after simplification: % 6.52/1.74 --------------------------------- % 6.52/1.74 % 6.52/1.74 (ass(cond(goal(88), 0), 2)) % 6.52/1.77 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (vplus(v1, v3) = % 6.52/1.77 v0) | ~ (vplus(v0, v2) = v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 6.52/1.77 $i(v0)) % 6.52/1.77 % 6.52/1.77 (def(cond(conseq(axiom(3)), 11), 1)) % 6.52/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : ! [v3: $i] : (v2 = 0 | ~ % 6.52/1.78 (vplus(v0, v3) = v1) | ~ (greater(v1, v0) = v2) | ~ $i(v3) | ~ $i(v1) | % 6.52/1.78 ~ $i(v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ (greater(v1, v0) = 0) | ~ % 6.52/1.78 $i(v1) | ~ $i(v0) | ? [v2: $i] : (vplus(v0, v2) = v1 & $i(v2))) % 6.52/1.78 % 6.52/1.78 (def(cond(conseq(axiom(3)), 12), 1)) % 6.97/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : ! [v3: $i] : (v2 = 0 | ~ % 6.97/1.78 (less(v1, v0) = v2) | ~ (vplus(v1, v3) = v0) | ~ $i(v3) | ~ $i(v1) | ~ % 6.97/1.78 $i(v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ (less(v1, v0) = 0) | ~ $i(v1) | % 6.97/1.78 ~ $i(v0) | ? [v2: $i] : (vplus(v1, v2) = v0 & $i(v2))) % 6.97/1.78 % 6.97/1.78 (dis(ex(cond(conseq(131), 0), 0))) % 6.97/1.78 $i(vd204) & $i(vd203) & ? [v0: any] : (greater(vd203, vd204) = v0 & ( ~ (v0 = % 6.97/1.78 0) | ~ (vd204 = vd203))) % 6.97/1.78 % 6.97/1.78 (dis(ex(cond(conseq(131), 0), 1))) % 6.97/1.78 less(vd203, vd204) = 0 & greater(vd203, vd204) = 0 & $i(vd204) & $i(vd203) % 6.97/1.78 % 6.97/1.78 (function-axioms) % 6.97/1.79 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 6.97/1.79 [v3: $i] : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = v0)) & ! % 6.97/1.79 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (vplus(v3, % 6.97/1.79 v2) = v1) | ~ (vplus(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 6.97/1.79 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.97/1.79 (greater(v3, v2) = v1) | ~ (greater(v3, v2) = v0)) & ! [v0: $i] : ! [v1: % 6.97/1.79 $i] : ! [v2: $i] : (v1 = v0 | ~ (vsucc(v2) = v1) | ~ (vsucc(v2) = v0)) % 6.97/1.79 % 6.97/1.79 Further assumptions not needed in the proof: % 6.97/1.79 -------------------------------------------- % 6.97/1.79 ass(cond(33, 0), 0), ass(cond(81, 0), 0), ass(cond(goal(88), 0), 0), % 6.97/1.79 ass(cond(goal(88), 0), 1), ass(cond(goal(88), 0), 3), qu(cond(conseq(axiom(3)), % 6.97/1.79 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0))) % 6.97/1.79 % 6.97/1.79 Those formulas are unsatisfiable: % 6.97/1.79 --------------------------------- % 6.97/1.79 % 6.97/1.79 Begin of proof % 6.97/1.79 | % 6.97/1.79 | ALPHA: (dis(ex(cond(conseq(131), 0), 0))) implies: % 6.97/1.79 | (1) ? [v0: any] : (greater(vd203, vd204) = v0 & ( ~ (v0 = 0) | ~ (vd204 = % 6.97/1.79 | vd203))) % 6.97/1.79 | % 6.97/1.79 | ALPHA: (def(cond(conseq(axiom(3)), 12), 1)) implies: % 6.97/1.80 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (less(v1, v0) = 0) | ~ $i(v1) | ~ % 6.97/1.80 | $i(v0) | ? [v2: $i] : (vplus(v1, v2) = v0 & $i(v2))) % 6.97/1.80 | % 6.97/1.80 | ALPHA: (def(cond(conseq(axiom(3)), 11), 1)) implies: % 6.97/1.80 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (greater(v1, v0) = 0) | ~ $i(v1) | ~ % 6.97/1.80 | $i(v0) | ? [v2: $i] : (vplus(v0, v2) = v1 & $i(v2))) % 6.97/1.80 | % 6.97/1.80 | ALPHA: (dis(ex(cond(conseq(131), 0), 1))) implies: % 6.97/1.80 | (4) $i(vd203) % 6.97/1.80 | (5) $i(vd204) % 6.97/1.80 | (6) greater(vd203, vd204) = 0 % 6.97/1.80 | (7) less(vd203, vd204) = 0 % 6.97/1.80 | % 6.97/1.80 | ALPHA: (function-axioms) implies: % 6.97/1.80 | (8) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.97/1.80 | ! [v3: $i] : (v1 = v0 | ~ (greater(v3, v2) = v1) | ~ (greater(v3, % 6.97/1.80 | v2) = v0)) % 6.97/1.80 | % 6.97/1.80 | DELTA: instantiating (1) with fresh symbol all_11_0 gives: % 6.97/1.80 | (9) greater(vd203, vd204) = all_11_0 & ( ~ (all_11_0 = 0) | ~ (vd204 = % 6.97/1.80 | vd203)) % 6.97/1.80 | % 6.97/1.80 | ALPHA: (9) implies: % 6.97/1.80 | (10) greater(vd203, vd204) = all_11_0 % 6.97/1.80 | % 6.97/1.81 | GROUND_INST: instantiating (8) with 0, all_11_0, vd204, vd203, simplifying % 6.97/1.81 | with (6), (10) gives: % 6.97/1.81 | (11) all_11_0 = 0 % 6.97/1.81 | % 6.97/1.81 | GROUND_INST: instantiating (3) with vd204, vd203, simplifying with (4), (5), % 6.97/1.81 | (6) gives: % 6.97/1.81 | (12) ? [v0: $i] : (vplus(vd204, v0) = vd203 & $i(v0)) % 6.97/1.81 | % 6.97/1.81 | GROUND_INST: instantiating (2) with vd204, vd203, simplifying with (4), (5), % 6.97/1.81 | (7) gives: % 6.97/1.81 | (13) ? [v0: $i] : (vplus(vd203, v0) = vd204 & $i(v0)) % 6.97/1.81 | % 6.97/1.81 | DELTA: instantiating (13) with fresh symbol all_29_0 gives: % 6.97/1.81 | (14) vplus(vd203, all_29_0) = vd204 & $i(all_29_0) % 6.97/1.81 | % 6.97/1.81 | ALPHA: (14) implies: % 6.97/1.81 | (15) $i(all_29_0) % 6.97/1.81 | (16) vplus(vd203, all_29_0) = vd204 % 6.97/1.81 | % 6.97/1.81 | DELTA: instantiating (12) with fresh symbol all_31_0 gives: % 6.97/1.81 | (17) vplus(vd204, all_31_0) = vd203 & $i(all_31_0) % 6.97/1.81 | % 6.97/1.81 | ALPHA: (17) implies: % 6.97/1.81 | (18) $i(all_31_0) % 6.97/1.81 | (19) vplus(vd204, all_31_0) = vd203 % 6.97/1.81 | % 6.97/1.81 | GROUND_INST: instantiating (ass(cond(goal(88), 0), 2)) with vd203, vd204, % 6.97/1.81 | all_29_0, all_31_0, simplifying with (4), (5), (15), (16), (18), % 6.97/1.81 | (19) gives: % 6.97/1.81 | (20) $false % 6.97/1.81 | % 6.97/1.81 | CLOSE: (20) is inconsistent. % 6.97/1.81 | % 6.97/1.81 End of proof % 6.97/1.81 % SZS output end Proof for theBenchmark % 6.97/1.82 % 6.97/1.82 1183ms %------------------------------------------------------------------------------