%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n019.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:13 EDT 2022 % Result : Theorem 2.41s 1.25s % Output : Proof 3.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.34 % Computer : n019.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 20 04:39:24 EDT 2022 % 0.14/0.34 % CPUTime : % 0.61/0.59 ____ _ % 0.61/0.59 ___ / __ \_____(_)___ ________ __________ % 0.61/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.61/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.61/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.61/0.60 % 0.61/0.60 A Theorem Prover for First-Order Logic % 0.61/0.60 (ePrincess v.1.0) % 0.61/0.60 % 0.61/0.60 (c) Philipp Rümmer, 2009-2015 % 0.61/0.60 (c) Peter Backeman, 2014-2015 % 0.61/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.61/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.61/0.60 Bug reports to peter@backeman.se % 0.61/0.60 % 0.61/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.61/0.60 % 0.61/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.73/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.48/0.93 Prover 0: Preprocessing ... % 1.86/1.12 Prover 0: Constructing countermodel ... % 2.41/1.25 Prover 0: proved (600ms) % 2.41/1.25 % 2.41/1.25 No countermodel exists, formula is valid % 2.41/1.25 % SZS status Theorem for theBenchmark % 2.41/1.25 % 2.41/1.25 Generating proof ... found it (size 15) % 2.88/1.41 % 2.88/1.41 % SZS output start Proof for theBenchmark % 2.88/1.41 Assumed formulas after preprocessing and simplification: % 2.88/1.41 | (0) ? [v0] : ? [v1] : ? [v2] : (relation_restriction(v1, v0) = v2 & well_ordering(v1) & relation(v1) & ~ well_ordering(v2) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (cartesian_product2(v6, v5) = v4) | ~ (cartesian_product2(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (relation_restriction(v6, v5) = v4) | ~ (relation_restriction(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (set_intersection2(v6, v5) = v4) | ~ (set_intersection2(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : ( ~ (cartesian_product2(v4, v4) = v5) | ~ (set_intersection2(v3, v5) = v6) | ~ relation(v3) | relation_restriction(v3, v4) = v6) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v4, v3) = v5) | ~ well_founded_relation(v4) | ~ relation(v4) | well_founded_relation(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v4, v3) = v5) | ~ connected(v4) | ~ relation(v4) | connected(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v4, v3) = v5) | ~ antisymmetric(v4) | ~ relation(v4) | antisymmetric(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v4, v3) = v5) | ~ transitive(v4) | ~ relation(v4) | transitive(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v4, v3) = v5) | ~ reflexive(v4) | ~ relation(v4) | reflexive(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v3, v4) = v5) | ~ relation(v3) | relation(v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (relation_restriction(v3, v4) = v5) | ~ relation(v3) | ? [v6] : (cartesian_product2(v4, v4) = v6 & set_intersection2(v3, v6) = v5)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (set_intersection2(v4, v3) = v5) | set_intersection2(v3, v4) = v5) & ! [v3] : ! [v4] : ! [v5] : ( ~ (set_intersection2(v3, v4) = v5) | set_intersection2(v4, v3) = v5) & ! [v3] : ! [v4] : (v4 = v3 | ~ (set_intersection2(v3, v3) = v4)) & ! [v3] : ( ~ well_founded_relation(v3) | ~ connected(v3) | ~ antisymmetric(v3) | ~ transitive(v3) | ~ reflexive(v3) | ~ relation(v3) | well_ordering(v3)) & ! [v3] : ( ~ well_ordering(v3) | ~ relation(v3) | well_founded_relation(v3)) & ! [v3] : ( ~ well_ordering(v3) | ~ relation(v3) | connected(v3)) & ! [v3] : ( ~ well_ordering(v3) | ~ relation(v3) | antisymmetric(v3)) & ! [v3] : ( ~ well_ordering(v3) | ~ relation(v3) | transitive(v3)) & ! [v3] : ( ~ well_ordering(v3) | ~ relation(v3) | reflexive(v3))) % 2.88/1.45 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.88/1.45 | (1) relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0 & well_ordering(all_0_1_1) & relation(all_0_1_1) & ~ well_ordering(all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (relation_restriction(v3, v2) = v1) | ~ (relation_restriction(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (cartesian_product2(v1, v1) = v2) | ~ (set_intersection2(v0, v2) = v3) | ~ relation(v0) | relation_restriction(v0, v1) = v3) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ well_founded_relation(v1) | ~ relation(v1) | well_founded_relation(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ connected(v1) | ~ relation(v1) | connected(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ antisymmetric(v1) | ~ relation(v1) | antisymmetric(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ transitive(v1) | ~ relation(v1) | transitive(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ reflexive(v1) | ~ relation(v1) | reflexive(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v0, v1) = v2) | ~ relation(v0) | relation(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v0, v1) = v2) | ~ relation(v0) | ? [v3] : (cartesian_product2(v1, v1) = v3 & set_intersection2(v0, v3) = v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = 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.88/1.46 | % 2.88/1.46 | Applying alpha-rule on (1) yields: % 2.88/1.46 | (2) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | connected(v0)) % 2.88/1.46 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) % 2.88/1.46 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ connected(v1) | ~ relation(v1) | connected(v2)) % 2.88/1.46 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) % 2.88/1.46 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) % 2.88/1.46 | (7) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | reflexive(v0)) % 2.88/1.46 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ reflexive(v1) | ~ relation(v1) | reflexive(v2)) % 2.88/1.46 | (9) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | transitive(v0)) % 2.88/1.46 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (cartesian_product2(v1, v1) = v2) | ~ (set_intersection2(v0, v2) = v3) | ~ relation(v0) | relation_restriction(v0, v1) = v3) % 3.19/1.46 | (11) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) % 3.19/1.46 | (12) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | antisymmetric(v0)) % 3.19/1.46 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) % 3.19/1.46 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (relation_restriction(v3, v2) = v1) | ~ (relation_restriction(v3, v2) = v0)) % 3.19/1.46 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v0, v1) = v2) | ~ relation(v0) | relation(v2)) % 3.19/1.46 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v0, v1) = v2) | ~ relation(v0) | ? [v3] : (cartesian_product2(v1, v1) = v3 & set_intersection2(v0, v3) = v2)) % 3.19/1.46 | (17) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ well_founded_relation(v1) | ~ relation(v1) | well_founded_relation(v2)) % 3.19/1.46 | (18) relation(all_0_1_1) % 3.19/1.46 | (19) relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0 % 3.19/1.46 | (20) well_ordering(all_0_1_1) % 3.19/1.46 | (21) ! [v0] : ( ~ well_founded_relation(v0) | ~ connected(v0) | ~ antisymmetric(v0) | ~ transitive(v0) | ~ reflexive(v0) | ~ relation(v0) | well_ordering(v0)) % 3.19/1.46 | (22) ! [v0] : ( ~ well_ordering(v0) | ~ relation(v0) | well_founded_relation(v0)) % 3.19/1.47 | (23) ~ well_ordering(all_0_0_0) % 3.19/1.47 | (24) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ antisymmetric(v1) | ~ relation(v1) | antisymmetric(v2)) % 3.19/1.47 | (25) ! [v0] : ! [v1] : ! [v2] : ( ~ (relation_restriction(v1, v0) = v2) | ~ transitive(v1) | ~ relation(v1) | transitive(v2)) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (15) with all_0_0_0, all_0_2_2, all_0_1_1 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, relation(all_0_1_1), yields: % 3.19/1.47 | (26) relation(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (22) with all_0_1_1 and discharging atoms well_ordering(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (27) well_founded_relation(all_0_1_1) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (2) with all_0_1_1 and discharging atoms well_ordering(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (28) connected(all_0_1_1) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (12) with all_0_1_1 and discharging atoms well_ordering(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (29) antisymmetric(all_0_1_1) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (9) with all_0_1_1 and discharging atoms well_ordering(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (30) transitive(all_0_1_1) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (7) with all_0_1_1 and discharging atoms well_ordering(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (31) reflexive(all_0_1_1) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (17) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, well_founded_relation(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (32) well_founded_relation(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (4) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, connected(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (33) connected(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (24) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, antisymmetric(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (34) antisymmetric(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (25) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, transitive(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (35) transitive(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (8) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms relation_restriction(all_0_1_1, all_0_2_2) = all_0_0_0, reflexive(all_0_1_1), relation(all_0_1_1), yields: % 3.19/1.47 | (36) reflexive(all_0_0_0) % 3.19/1.47 | % 3.19/1.47 | Instantiating formula (21) with all_0_0_0 and discharging atoms well_founded_relation(all_0_0_0), connected(all_0_0_0), antisymmetric(all_0_0_0), transitive(all_0_0_0), reflexive(all_0_0_0), relation(all_0_0_0), ~ well_ordering(all_0_0_0), yields: % 3.19/1.47 | (37) $false % 3.19/1.47 | % 3.19/1.47 |-The branch is then unsatisfiable % 3.19/1.47 % SZS output end Proof for theBenchmark % 3.19/1.47 % 3.19/1.47 867ms %------------------------------------------------------------------------------