%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO207+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n017.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 23:22:18 EDT 2023 % Result : Theorem 5.72s 1.52s % Output : Proof 6.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GEO207+1 : TPTP v8.1.2. Released v3.3.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n017.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 20:11:28 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.64 ________ _____ % 0.20/0.64 ___ __ \_________(_)________________________________ % 0.20/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.64 % 0.20/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.64 (2023-06-19) % 0.20/0.64 % 0.20/0.64 (c) Philipp Rümmer, 2009-2023 % 0.20/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.64 Amanda Stjerna. % 0.20/0.64 Free software under BSD-3-Clause. % 0.20/0.64 % 0.20/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.64 % 0.20/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.65 Running up to 7 provers in parallel. % 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.41/1.08 Prover 4: Preprocessing ... % 2.67/1.10 Prover 1: Preprocessing ... % 2.97/1.14 Prover 0: Preprocessing ... % 2.97/1.14 Prover 5: Preprocessing ... % 2.97/1.14 Prover 6: Preprocessing ... % 2.97/1.14 Prover 2: Preprocessing ... % 2.97/1.14 Prover 3: Preprocessing ... % 3.92/1.42 Prover 2: Proving ... % 3.92/1.43 Prover 5: Proving ... % 5.15/1.44 Prover 6: Constructing countermodel ... % 5.15/1.45 Prover 3: Constructing countermodel ... % 5.15/1.46 Prover 1: Constructing countermodel ... % 5.72/1.51 Prover 6: proved (851ms) % 5.72/1.52 % 5.72/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.72/1.52 % 5.72/1.52 Prover 3: proved (854ms) % 5.72/1.52 % 5.72/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.72/1.52 % 5.72/1.52 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.72/1.52 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.72/1.52 Prover 5: proved (865ms) % 5.72/1.52 Prover 2: proved (866ms) % 5.72/1.53 % 5.72/1.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.72/1.53 % 5.90/1.54 % 5.90/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.90/1.54 % 5.90/1.54 Prover 1: Found proof (size 4) % 5.90/1.54 Prover 1: proved (875ms) % 5.90/1.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.90/1.54 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.90/1.56 Prover 7: Preprocessing ... % 5.90/1.56 Prover 8: Preprocessing ... % 5.90/1.57 Prover 4: Constructing countermodel ... % 5.90/1.57 Prover 10: Preprocessing ... % 5.90/1.58 Prover 11: Preprocessing ... % 5.90/1.58 Prover 4: stopped % 5.90/1.59 Prover 10: stopped % 5.90/1.59 Prover 7: stopped % 5.90/1.60 Prover 0: Proving ... % 5.90/1.61 Prover 0: stopped % 5.90/1.61 Prover 11: stopped % 6.52/1.64 Prover 8: Warning: ignoring some quantifiers % 6.52/1.65 Prover 8: Constructing countermodel ... % 6.52/1.65 Prover 8: stopped % 6.52/1.65 % 6.52/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.52/1.65 % 6.52/1.65 % SZS output start Proof for theBenchmark % 6.52/1.66 Assumptions after simplification: % 6.52/1.66 --------------------------------- % 6.52/1.66 % 6.52/1.66 (apart3) % 6.82/1.69 ! [v0: $i] : ( ~ (convergent_lines(v0, v0) = 0) | ~ $i(v0)) % 6.82/1.69 % 6.82/1.69 (con) % 6.82/1.69 ? [v0: $i] : (convergent_lines(v0, v0) = 0 & $i(v0)) % 6.82/1.69 % 6.82/1.69 Further assumptions not needed in the proof: % 6.82/1.69 -------------------------------------------- % 6.82/1.69 apart1, apart2, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci1, ci2, ci3, ci4, cp1, % 6.82/1.69 cp2, cu1, cup1 % 6.82/1.69 % 6.82/1.69 Those formulas are unsatisfiable: % 6.82/1.69 --------------------------------- % 6.82/1.69 % 6.82/1.69 Begin of proof % 6.82/1.69 | % 6.82/1.69 | DELTA: instantiating (con) with fresh symbol all_20_0 gives: % 6.82/1.69 | (1) convergent_lines(all_20_0, all_20_0) = 0 & $i(all_20_0) % 6.82/1.69 | % 6.82/1.69 | ALPHA: (1) implies: % 6.82/1.69 | (2) $i(all_20_0) % 6.82/1.70 | (3) convergent_lines(all_20_0, all_20_0) = 0 % 6.82/1.70 | % 6.82/1.70 | GROUND_INST: instantiating (apart3) with all_20_0, simplifying with (2), (3) % 6.82/1.70 | gives: % 6.82/1.70 | (4) $false % 6.82/1.70 | % 6.82/1.70 | CLOSE: (4) is inconsistent. % 6.82/1.70 | % 6.82/1.70 End of proof % 6.82/1.70 % SZS output end Proof for theBenchmark % 6.82/1.70 % 6.82/1.70 1058ms %------------------------------------------------------------------------------