%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO252+1 : TPTP v8.1.2. Bugfixed v6.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n013.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:46 EDT 2023 % Result : Theorem 11.25s 2.44s % Output : Proof 15.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : GEO252+1 : TPTP v8.1.2. Bugfixed v6.4.0. % 0.08/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.37 % Computer : n013.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 300 % 0.16/0.37 % DateTime : Tue Aug 29 20:54:16 EDT 2023 % 0.16/0.37 % CPUTime : % 0.22/0.63 ________ _____ % 0.22/0.63 ___ __ \_________(_)________________________________ % 0.22/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.63 % 0.22/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.63 (2023-06-19) % 0.22/0.63 % 0.22/0.63 (c) Philipp Rümmer, 2009-2023 % 0.22/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.63 Amanda Stjerna. % 0.22/0.63 Free software under BSD-3-Clause. % 0.22/0.63 % 0.22/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.63 % 0.22/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.65 Running up to 7 provers in parallel. % 0.22/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.20/1.31 Prover 4: Preprocessing ... % 3.20/1.31 Prover 1: Preprocessing ... % 3.20/1.37 Prover 5: Preprocessing ... % 3.20/1.37 Prover 0: Preprocessing ... % 3.20/1.37 Prover 3: Preprocessing ... % 3.20/1.37 Prover 2: Preprocessing ... % 3.20/1.37 Prover 6: Preprocessing ... % 9.38/2.15 Prover 5: Proving ... % 9.38/2.19 Prover 3: Constructing countermodel ... % 9.38/2.21 Prover 1: Constructing countermodel ... % 10.07/2.25 Prover 6: Constructing countermodel ... % 10.47/2.32 Prover 2: Proving ... % 11.25/2.44 Prover 6: proved (1745ms) % 11.25/2.44 % 11.25/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.25/2.44 % 11.25/2.44 Prover 5: proved (1774ms) % 11.25/2.45 % 11.25/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.25/2.45 % 11.52/2.45 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.52/2.45 Prover 3: stopped % 11.52/2.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.52/2.46 Prover 2: stopped % 11.52/2.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.52/2.49 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.04/2.54 Prover 1: Found proof (size 5) % 12.04/2.54 Prover 1: proved (1881ms) % 12.04/2.57 Prover 7: Preprocessing ... % 12.35/2.61 Prover 8: Preprocessing ... % 12.35/2.61 Prover 11: Preprocessing ... % 12.35/2.64 Prover 10: Preprocessing ... % 12.35/2.71 Prover 10: stopped % 12.35/2.71 Prover 7: stopped % 13.86/2.88 Prover 4: Constructing countermodel ... % 14.17/2.91 Prover 8: Warning: ignoring some quantifiers % 14.17/2.91 Prover 4: stopped % 14.17/2.92 Prover 11: stopped % 14.17/2.93 Prover 8: Constructing countermodel ... % 14.17/2.95 Prover 8: stopped % 14.42/2.99 Prover 0: Proving ... % 14.42/3.01 Prover 0: stopped % 14.42/3.01 % 14.42/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.42/3.01 % 14.42/3.01 % SZS output start Proof for theBenchmark % 14.42/3.02 Assumptions after simplification: % 14.42/3.02 --------------------------------- % 14.42/3.02 % 14.42/3.02 (con) % 14.85/3.07 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: any] : ? [v5: % 14.85/3.07 $i] : ? [v6: any] : (left_convergent_lines(v5, v2) = v6 & % 14.85/3.07 line_connecting(v0, v1) = v5 & distinct_points(v0, v1) = v4 & % 14.85/3.07 reverse_line(v2) = v3 & left_apart_point(v1, v3) = 0 & left_apart_point(v0, % 14.85/3.07 v2) = 0 & $i(v5) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ( ~ (v6 = 0) | ~ % 14.85/3.07 (v4 = 0))) % 14.85/3.07 % 14.85/3.07 (oag10) % 14.85/3.07 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 14.85/3.07 (left_apart_point(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : ! % 14.85/3.07 [v1: $i] : ( ~ (left_apart_point(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 14.85/3.07 % 14.85/3.07 Further assumptions not needed in the proof: % 14.85/3.07 -------------------------------------------- % 14.85/3.07 apt_def, bet_def, bf_def, con_def, div_def, oag1, oag11, oag2, oag3, oag4, oag5, % 14.85/3.07 oag6, oag7, oag8, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6, % 14.85/3.07 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2 % 14.85/3.07 % 14.85/3.07 Those formulas are unsatisfiable: % 14.85/3.07 --------------------------------- % 14.85/3.07 % 14.85/3.07 Begin of proof % 14.85/3.07 | % 14.85/3.08 | ALPHA: (oag10) implies: % 14.85/3.08 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | % 14.85/3.08 | ~ (left_apart_point(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)) % 14.85/3.08 | % 14.85/3.08 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2, % 14.85/3.08 | all_34_3, all_34_4, all_34_5, all_34_6 gives: % 14.85/3.08 | (2) left_convergent_lines(all_34_1, all_34_4) = all_34_0 & % 14.85/3.08 | line_connecting(all_34_6, all_34_5) = all_34_1 & % 14.85/3.08 | distinct_points(all_34_6, all_34_5) = all_34_2 & reverse_line(all_34_4) % 14.85/3.08 | = all_34_3 & left_apart_point(all_34_5, all_34_3) = 0 & % 14.85/3.09 | left_apart_point(all_34_6, all_34_4) = 0 & $i(all_34_1) & $i(all_34_3) % 14.85/3.09 | & $i(all_34_4) & $i(all_34_5) & $i(all_34_6) & ( ~ (all_34_0 = 0) | ~ % 14.85/3.09 | (all_34_2 = 0)) % 14.85/3.09 | % 14.85/3.09 | ALPHA: (2) implies: % 15.08/3.09 | (3) $i(all_34_5) % 15.08/3.09 | (4) $i(all_34_4) % 15.08/3.09 | (5) left_apart_point(all_34_5, all_34_3) = 0 % 15.08/3.09 | (6) reverse_line(all_34_4) = all_34_3 % 15.08/3.09 | % 15.08/3.09 | GROUND_INST: instantiating (1) with all_34_5, all_34_4, all_34_3, simplifying % 15.08/3.09 | with (3), (4), (5), (6) gives: % 15.08/3.09 | (7) $false % 15.08/3.09 | % 15.08/3.09 | CLOSE: (7) is inconsistent. % 15.08/3.09 | % 15.08/3.09 End of proof % 15.08/3.09 % SZS output end Proof for theBenchmark % 15.08/3.09 % 15.08/3.09 2458ms %------------------------------------------------------------------------------