%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO207+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n009.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:19 EDT 2023 % Result : Theorem 7.25s 1.73s % Output : Proof 9.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO207+3 : TPTP v8.1.2. Released v4.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n009.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 20:55:35 EDT 2023 % 0.13/0.34 % CPUTime : % 0.63/0.62 ________ _____ % 0.63/0.62 ___ __ \_________(_)________________________________ % 0.63/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.63/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.63/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.63/0.62 % 0.63/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.63/0.62 (2023-06-19) % 0.63/0.62 % 0.63/0.62 (c) Philipp Rümmer, 2009-2023 % 0.63/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.63/0.62 Amanda Stjerna. % 0.63/0.62 Free software under BSD-3-Clause. % 0.63/0.62 % 0.63/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.63/0.62 % 0.63/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.64 Running up to 7 provers in parallel. % 0.67/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.67/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.37/1.19 Prover 4: Preprocessing ... % 3.57/1.21 Prover 1: Preprocessing ... % 3.78/1.24 Prover 3: Preprocessing ... % 3.78/1.24 Prover 2: Preprocessing ... % 3.78/1.24 Prover 5: Preprocessing ... % 3.78/1.24 Prover 6: Preprocessing ... % 3.78/1.24 Prover 0: Preprocessing ... % 6.10/1.57 Prover 5: Proving ... % 6.10/1.62 Prover 2: Proving ... % 7.25/1.72 Prover 6: Constructing countermodel ... % 7.25/1.72 Prover 3: Constructing countermodel ... % 7.25/1.73 Prover 5: proved (1071ms) % 7.25/1.73 % 7.25/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.25/1.73 % 7.25/1.73 Prover 2: proved (1079ms) % 7.25/1.73 % 7.25/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.25/1.73 % 7.25/1.74 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.25/1.74 Prover 3: stopped % 7.25/1.77 Prover 6: stopped % 7.93/1.78 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.93/1.78 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.93/1.78 Prover 1: Constructing countermodel ... % 7.93/1.78 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.25/1.84 Prover 7: Preprocessing ... % 8.25/1.84 Prover 8: Preprocessing ... % 8.25/1.85 Prover 10: Preprocessing ... % 8.25/1.86 Prover 11: Preprocessing ... % 8.86/1.92 Prover 1: Found proof (size 4) % 8.86/1.93 Prover 1: proved (1278ms) % 8.86/1.93 Prover 10: stopped % 8.86/1.96 Prover 7: Warning: ignoring some quantifiers % 9.26/1.98 Prover 11: stopped % 9.26/1.98 Prover 7: Constructing countermodel ... % 9.26/1.99 Prover 7: stopped % 9.26/2.03 Prover 8: Warning: ignoring some quantifiers % 9.26/2.04 Prover 4: Constructing countermodel ... % 9.26/2.04 Prover 8: Constructing countermodel ... % 9.26/2.05 Prover 8: stopped % 9.26/2.05 Prover 0: Proving ... % 9.84/2.06 Prover 0: stopped % 9.84/2.07 Prover 4: stopped % 9.84/2.07 % 9.84/2.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.84/2.07 % 9.84/2.07 % SZS output start Proof for theBenchmark % 9.84/2.08 Assumptions after simplification: % 9.84/2.08 --------------------------------- % 9.84/2.08 % 9.84/2.08 (apart3) % 9.97/2.10 ! [v0: $i] : ( ~ (convergent_lines(v0, v0) = 0) | ~ $i(v0)) % 9.97/2.10 % 9.97/2.10 (con) % 9.97/2.10 ? [v0: $i] : (convergent_lines(v0, v0) = 0 & $i(v0)) % 9.97/2.10 % 9.97/2.10 Further assumptions not needed in the proof: % 9.97/2.10 -------------------------------------------- % 9.97/2.10 a3, a4, a5, apart1, apart2, apart4, apart5, ax1, ax2, ax6, ceq1, ceq2, ceq3, % 9.97/2.10 ci1, ci2, ci3, ci4, coipo1, con1, cotno1, couo1, cp1, cp2, cu1, cup1, int1, % 9.97/2.10 oac1, occu1, ooc1, ooc2, orth1, ouo1, p1, par1 % 9.97/2.10 % 9.97/2.10 Those formulas are unsatisfiable: % 9.97/2.10 --------------------------------- % 9.97/2.10 % 9.97/2.10 Begin of proof % 9.97/2.10 | % 9.97/2.11 | DELTA: instantiating (con) with fresh symbol all_38_0 gives: % 9.97/2.11 | (1) convergent_lines(all_38_0, all_38_0) = 0 & $i(all_38_0) % 9.97/2.11 | % 9.97/2.11 | ALPHA: (1) implies: % 9.97/2.11 | (2) $i(all_38_0) % 9.97/2.11 | (3) convergent_lines(all_38_0, all_38_0) = 0 % 9.97/2.11 | % 9.97/2.11 | GROUND_INST: instantiating (apart3) with all_38_0, simplifying with (2), (3) % 9.97/2.11 | gives: % 9.97/2.11 | (4) $false % 9.97/2.11 | % 9.97/2.11 | CLOSE: (4) is inconsistent. % 9.97/2.11 | % 9.97/2.11 End of proof % 9.97/2.11 % SZS output end Proof for theBenchmark % 9.97/2.11 % 9.97/2.11 1492ms %------------------------------------------------------------------------------