%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO211+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 : n001.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:21 EDT 2023 % Result : Theorem 5.77s 1.53s % Output : Proof 6.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : GEO211+1 : TPTP v8.1.2. Released v3.3.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n001.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % 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 22:24:08 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.86/1.11 Prover 1: Preprocessing ... % 2.86/1.11 Prover 4: Preprocessing ... % 2.86/1.14 Prover 0: Preprocessing ... % 2.86/1.14 Prover 2: Preprocessing ... % 2.86/1.14 Prover 6: Preprocessing ... % 2.86/1.14 Prover 3: Preprocessing ... % 2.86/1.14 Prover 5: Preprocessing ... % 5.02/1.42 Prover 5: Proving ... % 5.02/1.44 Prover 2: Proving ... % 5.02/1.45 Prover 3: Constructing countermodel ... % 5.02/1.45 Prover 6: Constructing countermodel ... % 5.02/1.47 Prover 1: Constructing countermodel ... % 5.77/1.53 Prover 3: proved (891ms) % 5.77/1.53 % 5.77/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.77/1.53 % 5.77/1.53 Prover 6: proved (890ms) % 5.77/1.53 % 5.77/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.77/1.53 % 5.77/1.53 Prover 2: stopped % 5.77/1.53 Prover 5: stopped % 5.77/1.54 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.77/1.54 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.77/1.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.77/1.54 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.77/1.57 Prover 1: Found proof (size 8) % 5.77/1.57 Prover 1: proved (945ms) % 5.77/1.58 Prover 8: Preprocessing ... % 5.77/1.58 Prover 10: Preprocessing ... % 5.77/1.59 Prover 11: Preprocessing ... % 5.77/1.59 Prover 10: stopped % 5.77/1.59 Prover 7: Preprocessing ... % 6.45/1.61 Prover 7: stopped % 6.45/1.64 Prover 11: stopped % 6.45/1.67 Prover 8: Warning: ignoring some quantifiers % 6.45/1.68 Prover 4: Constructing countermodel ... % 6.45/1.68 Prover 8: Constructing countermodel ... % 6.45/1.68 Prover 8: stopped % 6.45/1.69 Prover 0: Proving ... % 6.45/1.69 Prover 4: stopped % 6.45/1.70 Prover 0: stopped % 6.45/1.70 % 6.45/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.45/1.70 % 6.45/1.70 % SZS output start Proof for theBenchmark % 6.45/1.71 Assumptions after simplification: % 6.45/1.71 --------------------------------- % 6.45/1.71 % 6.45/1.71 (apart3) % 6.45/1.73 ! [v0: $i] : ( ~ (convergent_lines(v0, v0) = 0) | ~ $i(v0)) % 6.45/1.73 % 6.45/1.73 (con) % 6.45/1.74 ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & unorthogonal_lines(v0, v0) = v1 & % 6.45/1.74 $i(v0)) % 6.45/1.74 % 6.45/1.74 (occu1) % 6.45/1.74 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 6.45/1.74 (unorthogonal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 6.45/1.74 convergent_lines(v0, v1) = 0) % 6.45/1.74 % 6.45/1.74 Further assumptions not needed in the proof: % 6.45/1.74 -------------------------------------------- % 6.45/1.74 apart1, apart2, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci1, ci2, ci3, ci4, cp1, % 6.45/1.74 cp2, cu1, cup1, oac1, ooc1, ooc2, ouo1 % 6.45/1.74 % 6.45/1.74 Those formulas are unsatisfiable: % 6.45/1.74 --------------------------------- % 6.45/1.74 % 6.45/1.74 Begin of proof % 6.45/1.74 | % 6.45/1.74 | DELTA: instantiating (con) with fresh symbols all_25_0, all_25_1 gives: % 6.45/1.74 | (1) ~ (all_25_0 = 0) & unorthogonal_lines(all_25_1, all_25_1) = all_25_0 & % 6.45/1.74 | $i(all_25_1) % 6.45/1.74 | % 6.45/1.74 | ALPHA: (1) implies: % 6.45/1.74 | (2) ~ (all_25_0 = 0) % 6.45/1.74 | (3) $i(all_25_1) % 6.45/1.74 | (4) unorthogonal_lines(all_25_1, all_25_1) = all_25_0 % 6.45/1.74 | % 6.45/1.74 | GROUND_INST: instantiating (occu1) with all_25_1, all_25_1, all_25_0, % 6.45/1.74 | simplifying with (3), (4) gives: % 6.45/1.74 | (5) all_25_0 = 0 | convergent_lines(all_25_1, all_25_1) = 0 % 6.45/1.74 | % 6.45/1.74 | BETA: splitting (5) gives: % 6.45/1.74 | % 6.45/1.74 | Case 1: % 6.45/1.74 | | % 6.45/1.75 | | (6) convergent_lines(all_25_1, all_25_1) = 0 % 6.45/1.75 | | % 6.45/1.75 | | GROUND_INST: instantiating (apart3) with all_25_1, simplifying with (3), (6) % 6.45/1.75 | | gives: % 6.45/1.75 | | (7) $false % 6.45/1.75 | | % 6.45/1.75 | | CLOSE: (7) is inconsistent. % 6.45/1.75 | | % 6.45/1.75 | Case 2: % 6.45/1.75 | | % 6.45/1.75 | | (8) all_25_0 = 0 % 6.45/1.75 | | % 6.45/1.75 | | REDUCE: (2), (8) imply: % 6.45/1.75 | | (9) $false % 6.45/1.75 | | % 6.45/1.75 | | CLOSE: (9) is inconsistent. % 6.45/1.75 | | % 6.45/1.75 | End of split % 6.45/1.75 | % 6.45/1.75 End of proof % 6.45/1.75 % SZS output end Proof for theBenchmark % 6.45/1.75 % 6.45/1.75 1139ms %------------------------------------------------------------------------------