%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%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 : 600s % DateTime : Tue Jul 19 08:48:15 EDT 2022 % Result : Theorem 2.06s 1.17s % Output : Proof 2.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%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 : 600 % 0.13/0.34 % DateTime : Sun Jun 19 16:07:44 EDT 2022 % 0.13/0.34 % CPUTime : % 0.54/0.58 ____ _ % 0.54/0.58 ___ / __ \_____(_)___ ________ __________ % 0.54/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.54/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.54/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.54/0.58 % 0.54/0.58 A Theorem Prover for First-Order Logic % 0.54/0.58 (ePrincess v.1.0) % 0.54/0.58 % 0.54/0.58 (c) Philipp Rümmer, 2009-2015 % 0.54/0.58 (c) Peter Backeman, 2014-2015 % 0.54/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.54/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.54/0.58 Bug reports to peter@backeman.se % 0.54/0.58 % 0.54/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.54/0.58 % 0.54/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.75/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.91 Prover 0: Preprocessing ... % 1.68/1.04 Prover 0: Constructing countermodel ... % 2.06/1.17 Prover 0: proved (531ms) % 2.06/1.17 % 2.06/1.17 No countermodel exists, formula is valid % 2.06/1.17 % SZS status Theorem for theBenchmark % 2.06/1.17 % 2.06/1.17 Generating proof ... found it (size 14) % 2.68/1.34 % 2.68/1.34 % SZS output start Proof for theBenchmark % 2.68/1.34 Assumed formulas after preprocessing and simplification: % 2.68/1.34 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (relation_isomorphism(v0, v1, v2) & function(v3) & function(v2) & well_ordering(v0) & relation(v3) & relation(v2) & relation(v1) & relation(v0) & ~ well_ordering(v1) & ! [v4] : ! [v5] : ! [v6] : ( ~ relation_isomorphism(v4, v5, v6) | ~ function(v6) | ~ well_founded_relation(v4) | ~ relation(v6) | ~ relation(v5) | ~ relation(v4) | well_founded_relation(v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ relation_isomorphism(v4, v5, v6) | ~ function(v6) | ~ connected(v4) | ~ relation(v6) | ~ relation(v5) | ~ relation(v4) | connected(v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ relation_isomorphism(v4, v5, v6) | ~ function(v6) | ~ antisymmetric(v4) | ~ relation(v6) | ~ relation(v5) | ~ relation(v4) | antisymmetric(v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ relation_isomorphism(v4, v5, v6) | ~ function(v6) | ~ transitive(v4) | ~ relation(v6) | ~ relation(v5) | ~ relation(v4) | transitive(v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ relation_isomorphism(v4, v5, v6) | ~ function(v6) | ~ reflexive(v4) | ~ relation(v6) | ~ relation(v5) | ~ relation(v4) | reflexive(v5)) & ! [v4] : ( ~ well_founded_relation(v4) | ~ connected(v4) | ~ antisymmetric(v4) | ~ transitive(v4) | ~ reflexive(v4) | ~ relation(v4) | well_ordering(v4)) & ! [v4] : ( ~ well_ordering(v4) | ~ relation(v4) | well_founded_relation(v4)) & ! [v4] : ( ~ well_ordering(v4) | ~ relation(v4) | connected(v4)) & ! [v4] : ( ~ well_ordering(v4) | ~ relation(v4) | antisymmetric(v4)) & ! [v4] : ( ~ well_ordering(v4) | ~ relation(v4) | transitive(v4)) & ! [v4] : ( ~ well_ordering(v4) | ~ relation(v4) | reflexive(v4))) % 2.68/1.35 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.68/1.35 | (1) relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1) & function(all_0_0_0) & function(all_0_1_1) & well_ordering(all_0_3_3) & relation(all_0_0_0) & relation(all_0_1_1) & relation(all_0_2_2) & relation(all_0_3_3) & ~ well_ordering(all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ well_founded_relation(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | well_founded_relation(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ connected(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | connected(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ antisymmetric(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | antisymmetric(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ transitive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | transitive(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ reflexive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | reflexive(v1)) & ! [v0] : ( ~ well_founded_relation(v0) | ~ connected(v0) | ~ antisymmetric(v0) | ~ transitive(v0) | ~ reflexive(v0) | ~ relation(v0) | well_ordering(v0)) & ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | well_founded_relation(v0)) & ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | connected(v0)) & ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | antisymmetric(v0)) & ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | transitive(v0)) & ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | reflexive(v0)) % 2.82/1.36 | % 2.82/1.36 | Applying alpha-rule on (1) yields: % 2.82/1.36 | (2) function(all_0_1_1) % 2.82/1.36 | (3) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | transitive(v0)) % 2.82/1.36 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ transitive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | transitive(v1)) % 2.82/1.36 | (5) well_ordering(all_0_3_3) % 2.82/1.36 | (6) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | connected(v0)) % 2.82/1.36 | (7) relation(all_0_2_2) % 2.82/1.36 | (8) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | antisymmetric(v0)) % 2.82/1.36 | (9) relation(all_0_1_1) % 2.82/1.36 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ antisymmetric(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | antisymmetric(v1)) % 2.82/1.36 | (11) function(all_0_0_0) % 2.82/1.36 | (12) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | well_founded_relation(v0)) % 2.82/1.36 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ well_founded_relation(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | well_founded_relation(v1)) % 2.82/1.37 | (14) relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1) % 2.82/1.37 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ connected(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | connected(v1)) % 2.82/1.37 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ relation_isomorphism(v0, v1, v2) | ~ function(v2) | ~ reflexive(v0) | ~ relation(v2) | ~ relation(v1) | ~ relation(v0) | reflexive(v1)) % 2.82/1.37 | (17) relation(all_0_3_3) % 2.82/1.37 | (18) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | reflexive(v0)) % 2.82/1.37 | (19) ! [v0] : ( ~ well_founded_relation(v0) | ~ connected(v0) | ~ antisymmetric(v0) | ~ transitive(v0) | ~ reflexive(v0) | ~ relation(v0) | well_ordering(v0)) % 2.82/1.37 | (20) ~ well_ordering(all_0_2_2) % 2.82/1.37 | (21) relation(all_0_0_0) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (12) with all_0_3_3 and discharging atoms well_ordering(all_0_3_3), relation(all_0_3_3), yields: % 2.82/1.37 | (22) well_founded_relation(all_0_3_3) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (6) with all_0_3_3 and discharging atoms well_ordering(all_0_3_3), relation(all_0_3_3), yields: % 2.82/1.37 | (23) connected(all_0_3_3) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (8) with all_0_3_3 and discharging atoms well_ordering(all_0_3_3), relation(all_0_3_3), yields: % 2.82/1.37 | (24) antisymmetric(all_0_3_3) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (3) with all_0_3_3 and discharging atoms well_ordering(all_0_3_3), relation(all_0_3_3), yields: % 2.82/1.37 | (25) transitive(all_0_3_3) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (18) with all_0_3_3 and discharging atoms well_ordering(all_0_3_3), relation(all_0_3_3), yields: % 2.82/1.37 | (26) reflexive(all_0_3_3) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (13) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1), function(all_0_1_1), well_founded_relation(all_0_3_3), relation(all_0_1_1), relation(all_0_2_2), relation(all_0_3_3), yields: % 2.82/1.37 | (27) well_founded_relation(all_0_2_2) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (15) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1), function(all_0_1_1), connected(all_0_3_3), relation(all_0_1_1), relation(all_0_2_2), relation(all_0_3_3), yields: % 2.82/1.37 | (28) connected(all_0_2_2) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (10) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1), function(all_0_1_1), antisymmetric(all_0_3_3), relation(all_0_1_1), relation(all_0_2_2), relation(all_0_3_3), yields: % 2.82/1.37 | (29) antisymmetric(all_0_2_2) % 2.82/1.37 | % 2.82/1.37 | Instantiating formula (4) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1), function(all_0_1_1), transitive(all_0_3_3), relation(all_0_1_1), relation(all_0_2_2), relation(all_0_3_3), yields: % 2.82/1.38 | (30) transitive(all_0_2_2) % 2.82/1.38 | % 2.82/1.38 | Instantiating formula (16) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms relation_isomorphism(all_0_3_3, all_0_2_2, all_0_1_1), function(all_0_1_1), reflexive(all_0_3_3), relation(all_0_1_1), relation(all_0_2_2), relation(all_0_3_3), yields: % 2.82/1.38 | (31) reflexive(all_0_2_2) % 2.82/1.38 | % 2.82/1.38 | Instantiating formula (19) with all_0_2_2 and discharging atoms well_founded_relation(all_0_2_2), connected(all_0_2_2), antisymmetric(all_0_2_2), transitive(all_0_2_2), reflexive(all_0_2_2), relation(all_0_2_2), ~ well_ordering(all_0_2_2), yields: % 2.82/1.38 | (32) $false % 2.82/1.38 | % 2.82/1.38 |-The branch is then unsatisfiable % 2.82/1.38 % SZS output end Proof for theBenchmark % 2.82/1.38 % 2.82/1.38 783ms %------------------------------------------------------------------------------