%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU261+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 : 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 : Thu Aug 31 17:43:43 EDT 2023 % Result : Theorem 4.58s 1.45s % Output : Proof 11.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU261+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n013.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 : Wed Aug 23 17:20:47 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.07/0.98 Prover 4: Preprocessing ... % 2.07/0.99 Prover 1: Preprocessing ... % 2.47/1.02 Prover 3: Preprocessing ... % 2.47/1.02 Prover 2: Preprocessing ... % 2.47/1.02 Prover 6: Preprocessing ... % 2.47/1.03 Prover 5: Preprocessing ... % 2.47/1.03 Prover 0: Preprocessing ... % 3.69/1.18 Prover 5: Constructing countermodel ... % 3.69/1.22 Prover 3: Constructing countermodel ... % 3.69/1.22 Prover 2: Constructing countermodel ... % 3.69/1.22 Prover 6: Proving ... % 3.69/1.22 Prover 1: Constructing countermodel ... % 4.58/1.44 Prover 2: proved (807ms) % 4.58/1.45 % 4.58/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.58/1.45 % 4.58/1.45 Prover 6: stopped % 4.58/1.45 Prover 3: stopped % 4.58/1.46 Prover 5: stopped % 4.58/1.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.58/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.58/1.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.58/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.31/1.48 Prover 10: Preprocessing ... % 5.31/1.49 Prover 7: Preprocessing ... % 5.31/1.50 Prover 11: Preprocessing ... % 5.31/1.51 Prover 8: Preprocessing ... % 5.31/1.53 Prover 7: Constructing countermodel ... % 5.31/1.54 Prover 10: Constructing countermodel ... % 5.31/1.56 Prover 8: Warning: ignoring some quantifiers % 5.31/1.56 Prover 8: Constructing countermodel ... % 6.63/1.62 Prover 10: Found proof (size 16) % 6.63/1.62 Prover 10: proved (160ms) % 6.63/1.62 Prover 1: stopped % 6.63/1.62 Prover 7: stopped % 6.63/1.62 Prover 8: stopped % 6.83/1.64 Prover 11: stopped % 10.62/2.31 Prover 4: Constructing countermodel ... % 10.62/2.32 Prover 4: stopped % 10.62/2.35 Prover 0: Proving ... % 10.62/2.36 Prover 0: stopped % 10.62/2.36 % 10.62/2.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.62/2.36 % 10.62/2.36 % SZS output start Proof for theBenchmark % 10.62/2.36 Assumptions after simplification: % 10.62/2.36 --------------------------------- % 10.62/2.36 % 10.62/2.36 (d4_wellord1) % 10.62/2.37 ! [v0: $i] : ( ~ $i(v0) | ~ well_founded_relation(v0) | ~ connected(v0) | % 10.62/2.37 ~ antisymmetric(v0) | ~ transitive(v0) | ~ reflexive(v0) | ~ relation(v0) % 10.62/2.37 | well_ordering(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ % 10.62/2.37 relation(v0) | well_founded_relation(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 10.62/2.37 well_ordering(v0) | ~ relation(v0) | connected(v0)) & ! [v0: $i] : ( ~ % 10.62/2.37 $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | antisymmetric(v0)) & ! % 10.62/2.37 [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.37 transitive(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ % 10.62/2.37 relation(v0) | reflexive(v0)) % 10.62/2.37 % 10.62/2.37 (t53_wellord1) % 10.62/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.62/2.38 ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.38 well_founded_relation(v0) | ~ relation(v2) | ~ relation(v1) | ~ % 10.62/2.38 relation(v0) | well_founded_relation(v1)) & ! [v0: $i] : ! [v1: $i] : ! % 10.62/2.38 [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation_isomorphism(v0, % 10.62/2.38 v1, v2) | ~ function(v2) | ~ connected(v0) | ~ relation(v2) | ~ % 10.62/2.38 relation(v1) | ~ relation(v0) | connected(v1)) & ! [v0: $i] : ! [v1: $i] % 10.62/2.38 : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.62/2.38 relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ antisymmetric(v0) | % 10.62/2.38 ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | antisymmetric(v1)) & ! % 10.62/2.38 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.62/2.38 relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ transitive(v0) | ~ % 10.62/2.38 relation(v2) | ~ relation(v1) | ~ relation(v0) | transitive(v1)) & ! [v0: % 10.62/2.38 $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.62/2.38 relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ reflexive(v0) | ~ % 10.62/2.38 relation(v2) | ~ relation(v1) | ~ relation(v0) | reflexive(v1)) % 10.62/2.38 % 10.62/2.38 (t54_wellord1) % 10.62/2.38 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 10.62/2.38 relation_isomorphism(v0, v1, v2) & function(v2) & well_ordering(v0) & % 10.62/2.38 relation(v2) & relation(v1) & relation(v0) & ~ well_ordering(v1)) % 10.62/2.38 % 10.62/2.38 Further assumptions not needed in the proof: % 10.62/2.38 -------------------------------------------- % 10.62/2.38 rc1_funct_1 % 10.62/2.38 % 10.62/2.38 Those formulas are unsatisfiable: % 10.62/2.38 --------------------------------- % 10.62/2.38 % 10.62/2.38 Begin of proof % 10.62/2.38 | % 10.62/2.38 | ALPHA: (t53_wellord1) implies: % 10.62/2.38 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.62/2.38 | $i(v0) | ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.38 | reflexive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | % 10.62/2.38 | reflexive(v1)) % 10.62/2.38 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.62/2.38 | $i(v0) | ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.38 | transitive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) % 10.62/2.38 | | transitive(v1)) % 10.62/2.38 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.62/2.38 | $i(v0) | ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.38 | antisymmetric(v0) | ~ relation(v2) | ~ relation(v1) | ~ % 10.62/2.38 | relation(v0) | antisymmetric(v1)) % 10.62/2.39 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.62/2.39 | $i(v0) | ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.39 | connected(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | % 10.62/2.39 | connected(v1)) % 10.62/2.39 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 10.62/2.39 | $i(v0) | ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ % 10.62/2.39 | well_founded_relation(v0) | ~ relation(v2) | ~ relation(v1) | ~ % 10.62/2.39 | relation(v0) | well_founded_relation(v1)) % 10.62/2.39 | % 10.62/2.39 | ALPHA: (d4_wellord1) implies: % 10.62/2.39 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.39 | reflexive(v0)) % 10.62/2.39 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.39 | transitive(v0)) % 10.62/2.39 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.39 | antisymmetric(v0)) % 10.62/2.39 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.39 | connected(v0)) % 10.62/2.39 | (10) ! [v0: $i] : ( ~ $i(v0) | ~ well_ordering(v0) | ~ relation(v0) | % 10.62/2.39 | well_founded_relation(v0)) % 10.62/2.39 | (11) ! [v0: $i] : ( ~ $i(v0) | ~ well_founded_relation(v0) | ~ % 10.62/2.39 | connected(v0) | ~ antisymmetric(v0) | ~ transitive(v0) | ~ % 10.62/2.39 | reflexive(v0) | ~ relation(v0) | well_ordering(v0)) % 10.62/2.39 | % 10.62/2.39 | DELTA: instantiating (t54_wellord1) with fresh symbols all_6_0, all_6_1, % 10.62/2.39 | all_6_2 gives: % 10.62/2.39 | (12) $i(all_6_0) & $i(all_6_1) & $i(all_6_2) & % 10.62/2.39 | relation_isomorphism(all_6_2, all_6_1, all_6_0) & function(all_6_0) & % 10.62/2.39 | well_ordering(all_6_2) & relation(all_6_0) & relation(all_6_1) & % 10.62/2.39 | relation(all_6_2) & ~ well_ordering(all_6_1) % 10.62/2.39 | % 10.62/2.39 | ALPHA: (12) implies: % 10.62/2.39 | (13) ~ well_ordering(all_6_1) % 10.62/2.39 | (14) relation(all_6_2) % 10.62/2.39 | (15) relation(all_6_1) % 10.62/2.39 | (16) relation(all_6_0) % 10.62/2.39 | (17) well_ordering(all_6_2) % 10.62/2.39 | (18) function(all_6_0) % 10.62/2.39 | (19) relation_isomorphism(all_6_2, all_6_1, all_6_0) % 10.62/2.39 | (20) $i(all_6_2) % 10.62/2.39 | (21) $i(all_6_1) % 10.62/2.39 | (22) $i(all_6_0) % 10.62/2.39 | % 10.62/2.39 | GROUND_INST: instantiating (10) with all_6_2, simplifying with (14), (17), % 10.62/2.39 | (20) gives: % 10.62/2.39 | (23) well_founded_relation(all_6_2) % 10.62/2.39 | % 10.62/2.39 | GROUND_INST: instantiating (9) with all_6_2, simplifying with (14), (17), (20) % 10.62/2.39 | gives: % 10.62/2.39 | (24) connected(all_6_2) % 10.62/2.39 | % 10.62/2.40 | GROUND_INST: instantiating (8) with all_6_2, simplifying with (14), (17), (20) % 10.62/2.40 | gives: % 10.62/2.40 | (25) antisymmetric(all_6_2) % 10.62/2.40 | % 10.62/2.40 | GROUND_INST: instantiating (7) with all_6_2, simplifying with (14), (17), (20) % 10.62/2.40 | gives: % 10.62/2.40 | (26) transitive(all_6_2) % 10.62/2.40 | % 10.62/2.40 | GROUND_INST: instantiating (6) with all_6_2, simplifying with (14), (17), (20) % 10.62/2.40 | gives: % 10.62/2.40 | (27) reflexive(all_6_2) % 10.62/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (1) with all_6_2, all_6_1, all_6_0, simplifying % 11.02/2.40 | with (14), (15), (16), (18), (19), (20), (21), (22), (27) gives: % 11.02/2.40 | (28) reflexive(all_6_1) % 11.02/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (2) with all_6_2, all_6_1, all_6_0, simplifying % 11.02/2.40 | with (14), (15), (16), (18), (19), (20), (21), (22), (26) gives: % 11.02/2.40 | (29) transitive(all_6_1) % 11.02/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (3) with all_6_2, all_6_1, all_6_0, simplifying % 11.02/2.40 | with (14), (15), (16), (18), (19), (20), (21), (22), (25) gives: % 11.02/2.40 | (30) antisymmetric(all_6_1) % 11.02/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (4) with all_6_2, all_6_1, all_6_0, simplifying % 11.02/2.40 | with (14), (15), (16), (18), (19), (20), (21), (22), (24) gives: % 11.02/2.40 | (31) connected(all_6_1) % 11.02/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (5) with all_6_2, all_6_1, all_6_0, simplifying % 11.02/2.40 | with (14), (15), (16), (18), (19), (20), (21), (22), (23) gives: % 11.02/2.40 | (32) well_founded_relation(all_6_1) % 11.02/2.40 | % 11.02/2.40 | GROUND_INST: instantiating (11) with all_6_1, simplifying with (13), (15), % 11.02/2.40 | (21), (28), (29), (30), (31), (32) gives: % 11.02/2.40 | (33) $false % 11.02/2.40 | % 11.02/2.40 | CLOSE: (33) is inconsistent. % 11.02/2.40 | % 11.02/2.40 End of proof % 11.02/2.40 % SZS output end Proof for theBenchmark % 11.02/2.41 % 11.02/2.41 1792ms %------------------------------------------------------------------------------