%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUN088+2 : TPTP v8.1.2. Released v7.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n029.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 12:51:06 EDT 2023 % Result : Theorem 5.00s 1.45s % Output : Proof 5.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUN088+2 : TPTP v8.1.2. Released v7.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n029.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 : Sun Aug 27 09:36:10 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.66 ________ _____ % 0.19/0.66 ___ __ \_________(_)________________________________ % 0.19/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.66 % 0.19/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.66 (2023-06-19) % 0.19/0.66 % 0.19/0.66 (c) Philipp Rümmer, 2009-2023 % 0.19/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.66 Amanda Stjerna. % 0.19/0.66 Free software under BSD-3-Clause. % 0.19/0.66 % 0.19/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.66 % 0.19/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.68 Running up to 7 provers in parallel. % 0.19/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.82/1.12 Prover 4: Preprocessing ... % 2.82/1.12 Prover 1: Preprocessing ... % 2.82/1.17 Prover 6: Preprocessing ... % 2.82/1.17 Prover 0: Preprocessing ... % 2.82/1.17 Prover 2: Preprocessing ... % 2.82/1.17 Prover 5: Preprocessing ... % 2.82/1.17 Prover 3: Preprocessing ... % 4.28/1.35 Prover 4: Warning: ignoring some quantifiers % 4.28/1.35 Prover 1: Warning: ignoring some quantifiers % 4.28/1.35 Prover 5: Proving ... % 4.28/1.36 Prover 2: Proving ... % 4.28/1.37 Prover 4: Constructing countermodel ... % 4.28/1.37 Prover 0: Proving ... % 4.28/1.37 Prover 1: Constructing countermodel ... % 4.28/1.37 Prover 6: Proving ... % 4.28/1.38 Prover 3: Warning: ignoring some quantifiers % 4.28/1.39 Prover 3: Constructing countermodel ... % 5.00/1.45 Prover 3: proved (759ms) % 5.00/1.45 % 5.00/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.45 % 5.00/1.46 Prover 6: proved (764ms) % 5.00/1.46 Prover 2: proved (769ms) % 5.00/1.46 % 5.00/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.46 % 5.00/1.46 Prover 0: proved (770ms) % 5.00/1.46 % 5.00/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.46 % 5.00/1.46 Prover 5: proved (764ms) % 5.00/1.46 % 5.00/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.46 % 5.00/1.46 % 5.00/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.46 % 5.00/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.00/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.00/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.00/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.00/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.00/1.47 Prover 4: Found proof (size 4) % 5.00/1.47 Prover 1: Found proof (size 6) % 5.00/1.47 Prover 4: proved (778ms) % 5.00/1.47 Prover 1: proved (783ms) % 5.00/1.52 Prover 11: Preprocessing ... % 5.00/1.52 Prover 8: Preprocessing ... % 5.00/1.52 Prover 7: Preprocessing ... % 5.00/1.52 Prover 13: Preprocessing ... % 5.00/1.54 Prover 10: Preprocessing ... % 5.00/1.55 Prover 11: stopped % 5.00/1.55 Prover 7: stopped % 5.00/1.55 Prover 13: stopped % 5.00/1.55 Prover 10: stopped % 5.85/1.62 Prover 8: Warning: ignoring some quantifiers % 5.85/1.63 Prover 8: Constructing countermodel ... % 5.85/1.63 Prover 8: stopped % 5.85/1.63 % 5.85/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.85/1.63 % 5.85/1.64 % SZS output start Proof for theBenchmark % 5.85/1.64 Assumptions after simplification: % 5.85/1.64 --------------------------------- % 5.85/1.64 % 5.85/1.64 (axiom_7a) % 5.85/1.67 ! [v0: $i] : ! [v1: $i] : ( ~ (r2(v0, v1) = 0) | ~ (r1(v1) = 0) | ~ $i(v1) % 5.85/1.67 | ~ $i(v0)) % 5.85/1.67 % 5.85/1.67 (zerouneqone) % 5.85/1.67 ? [v0: $i] : (r1(v0) = 0 & $i(v0) & ? [v1: $i] : (r2(v1, v0) = 0 & r1(v1) = % 5.85/1.67 0 & $i(v1))) % 5.85/1.67 % 5.85/1.67 Further assumptions not needed in the proof: % 5.85/1.67 -------------------------------------------- % 5.85/1.67 axiom_1, axiom_1a, axiom_2, axiom_2a, axiom_3, axiom_3a, axiom_4, axiom_4a, % 5.85/1.67 axiom_5a, axiom_6a % 5.85/1.67 % 5.85/1.67 Those formulas are unsatisfiable: % 5.85/1.67 --------------------------------- % 5.85/1.67 % 5.85/1.67 Begin of proof % 5.85/1.67 | % 5.85/1.67 | DELTA: instantiating (zerouneqone) with fresh symbol all_6_0 gives: % 5.85/1.67 | (1) r1(all_6_0) = 0 & $i(all_6_0) & ? [v0: $i] : (r2(v0, all_6_0) = 0 & % 5.85/1.67 | r1(v0) = 0 & $i(v0)) % 5.85/1.67 | % 5.85/1.67 | ALPHA: (1) implies: % 5.85/1.67 | (2) $i(all_6_0) % 5.85/1.67 | (3) r1(all_6_0) = 0 % 5.85/1.68 | (4) ? [v0: $i] : (r2(v0, all_6_0) = 0 & r1(v0) = 0 & $i(v0)) % 5.85/1.68 | % 5.85/1.68 | DELTA: instantiating (4) with fresh symbol all_18_0 gives: % 5.85/1.68 | (5) r2(all_18_0, all_6_0) = 0 & r1(all_18_0) = 0 & $i(all_18_0) % 5.85/1.68 | % 5.85/1.68 | ALPHA: (5) implies: % 5.85/1.68 | (6) $i(all_18_0) % 5.85/1.68 | (7) r2(all_18_0, all_6_0) = 0 % 5.85/1.68 | % 5.85/1.68 | GROUND_INST: instantiating (axiom_7a) with all_18_0, all_6_0, simplifying with % 5.85/1.68 | (2), (3), (6), (7) gives: % 5.85/1.68 | (8) $false % 5.85/1.68 | % 5.85/1.68 | CLOSE: (8) is inconsistent. % 5.85/1.68 | % 5.85/1.68 End of proof % 5.85/1.68 % SZS output end Proof for theBenchmark % 5.85/1.68 % 5.85/1.68 1020ms %------------------------------------------------------------------------------