%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n029.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 : Mon Jul 18 16:45:11 EDT 2022 % Result : Theorem 2.89s 1.48s % Output : Proof 4.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.15 % Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.0. % 0.04/0.15 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.37 % Computer : n029.cluster.edu % 0.13/0.37 % Model : x86_64 x86_64 % 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.37 % Memory : 8042.1875MB % 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.37 % CPULimit : 300 % 0.13/0.37 % WCLimit : 600 % 0.13/0.37 % DateTime : Thu Jun 2 01:45:16 EDT 2022 % 0.13/0.37 % CPUTime : % 0.41/0.62 ____ _ % 0.41/0.62 ___ / __ \_____(_)___ ________ __________ % 0.41/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.41/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.41/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.41/0.62 % 0.41/0.62 A Theorem Prover for First-Order Logic % 0.41/0.62 (ePrincess v.1.0) % 0.41/0.62 % 0.41/0.62 (c) Philipp Rümmer, 2009-2015 % 0.41/0.62 (c) Peter Backeman, 2014-2015 % 0.41/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.41/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.41/0.62 Bug reports to peter@backeman.se % 0.41/0.62 % 0.41/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.41/0.62 % 0.41/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.62/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.11/0.93 Prover 0: Preprocessing ... % 1.43/1.01 Prover 0: Constructing countermodel ... % 2.89/1.48 Prover 0: proved (812ms) % 2.89/1.48 % 2.89/1.48 No countermodel exists, formula is valid % 2.89/1.48 % SZS status Theorem for theBenchmark % 2.89/1.48 % 2.89/1.48 Generating proof ... found it (size 16) % 4.21/1.78 % 4.21/1.78 % SZS output start Proof for theBenchmark % 4.21/1.78 Assumed formulas after preprocessing and simplification: % 4.21/1.78 | (0) ? [v0] : (exemplifies_property(none_greater, v0) & object(v0) & ! [v1] : ! [v2] : (v2 = v1 | ~ object(v2) | ~ object(v1) | exemplifies_relation(greater_than, v2, v1) | exemplifies_relation(greater_than, v1, v2)) & ! [v1] : ! [v2] : ( ~ exemplifies_relation(greater_than, v2, v1) | ~ exemplifies_property(conceivable, v2) | ~ exemplifies_property(none_greater, v1) | ~ object(v2) | ~ object(v1)) & ! [v1] : ( ~ exemplifies_property(conceivable, v1) | ~ object(v1) | exemplifies_property(none_greater, v1) | ? [v2] : (exemplifies_relation(greater_than, v2, v1) & exemplifies_property(conceivable, v2) & object(v2))) & ! [v1] : ( ~ exemplifies_property(none_greater, v1) | ~ object(v1) | exemplifies_property(conceivable, v1)) & ! [v1] : ( ~ exemplifies_property(none_greater, v1) | ~ object(v1) | ? [v2] : ( ~ (v2 = v1) & exemplifies_property(none_greater, v2) & object(v2)))) % 4.21/1.79 | Instantiating (0) with all_0_0_0 yields: % 4.21/1.79 | (1) exemplifies_property(none_greater, all_0_0_0) & object(all_0_0_0) & ! [v0] : ! [v1] : (v1 = v0 | ~ object(v1) | ~ object(v0) | exemplifies_relation(greater_than, v1, v0) | exemplifies_relation(greater_than, v0, v1)) & ! [v0] : ! [v1] : ( ~ exemplifies_relation(greater_than, v1, v0) | ~ exemplifies_property(conceivable, v1) | ~ exemplifies_property(none_greater, v0) | ~ object(v1) | ~ object(v0)) & ! [v0] : ( ~ exemplifies_property(conceivable, v0) | ~ object(v0) | exemplifies_property(none_greater, v0) | ? [v1] : (exemplifies_relation(greater_than, v1, v0) & exemplifies_property(conceivable, v1) & object(v1))) & ! [v0] : ( ~ exemplifies_property(none_greater, v0) | ~ object(v0) | exemplifies_property(conceivable, v0)) & ! [v0] : ( ~ exemplifies_property(none_greater, v0) | ~ object(v0) | ? [v1] : ( ~ (v1 = v0) & exemplifies_property(none_greater, v1) & object(v1))) % 4.21/1.80 | % 4.21/1.80 | Applying alpha-rule on (1) yields: % 4.21/1.80 | (2) ! [v0] : ! [v1] : ( ~ exemplifies_relation(greater_than, v1, v0) | ~ exemplifies_property(conceivable, v1) | ~ exemplifies_property(none_greater, v0) | ~ object(v1) | ~ object(v0)) % 4.21/1.80 | (3) exemplifies_property(none_greater, all_0_0_0) % 4.21/1.80 | (4) ! [v0] : ( ~ exemplifies_property(none_greater, v0) | ~ object(v0) | ? [v1] : ( ~ (v1 = v0) & exemplifies_property(none_greater, v1) & object(v1))) % 4.21/1.80 | (5) object(all_0_0_0) % 4.21/1.80 | (6) ! [v0] : ! [v1] : (v1 = v0 | ~ object(v1) | ~ object(v0) | exemplifies_relation(greater_than, v1, v0) | exemplifies_relation(greater_than, v0, v1)) % 4.21/1.80 | (7) ! [v0] : ( ~ exemplifies_property(none_greater, v0) | ~ object(v0) | exemplifies_property(conceivable, v0)) % 4.21/1.80 | (8) ! [v0] : ( ~ exemplifies_property(conceivable, v0) | ~ object(v0) | exemplifies_property(none_greater, v0) | ? [v1] : (exemplifies_relation(greater_than, v1, v0) & exemplifies_property(conceivable, v1) & object(v1))) % 4.21/1.80 | % 4.21/1.80 | Instantiating formula (7) with all_0_0_0 and discharging atoms exemplifies_property(none_greater, all_0_0_0), object(all_0_0_0), yields: % 4.21/1.80 | (9) exemplifies_property(conceivable, all_0_0_0) % 4.21/1.80 | % 4.21/1.80 | Instantiating formula (4) with all_0_0_0 and discharging atoms exemplifies_property(none_greater, all_0_0_0), object(all_0_0_0), yields: % 4.21/1.80 | (10) ? [v0] : ( ~ (v0 = all_0_0_0) & exemplifies_property(none_greater, v0) & object(v0)) % 4.21/1.80 | % 4.21/1.80 | Instantiating (10) with all_9_0_1 yields: % 4.21/1.80 | (11) ~ (all_9_0_1 = all_0_0_0) & exemplifies_property(none_greater, all_9_0_1) & object(all_9_0_1) % 4.21/1.80 | % 4.21/1.80 | Applying alpha-rule on (11) yields: % 4.21/1.80 | (12) ~ (all_9_0_1 = all_0_0_0) % 4.21/1.81 | (13) exemplifies_property(none_greater, all_9_0_1) % 4.21/1.81 | (14) object(all_9_0_1) % 4.21/1.81 | % 4.21/1.81 | Instantiating formula (6) with all_9_0_1, all_0_0_0 and discharging atoms object(all_9_0_1), object(all_0_0_0), yields: % 4.21/1.81 | (15) all_9_0_1 = all_0_0_0 | exemplifies_relation(greater_than, all_9_0_1, all_0_0_0) | exemplifies_relation(greater_than, all_0_0_0, all_9_0_1) % 4.21/1.81 | % 4.21/1.81 | Instantiating formula (7) with all_9_0_1 and discharging atoms exemplifies_property(none_greater, all_9_0_1), object(all_9_0_1), yields: % 4.21/1.81 | (16) exemplifies_property(conceivable, all_9_0_1) % 4.21/1.81 | % 4.21/1.81 +-Applying beta-rule and splitting (15), into two cases. % 4.21/1.81 |-Branch one: % 4.21/1.81 | (17) exemplifies_relation(greater_than, all_9_0_1, all_0_0_0) % 4.21/1.81 | % 4.21/1.81 | Instantiating formula (2) with all_9_0_1, all_0_0_0 and discharging atoms exemplifies_relation(greater_than, all_9_0_1, all_0_0_0), exemplifies_property(conceivable, all_9_0_1), exemplifies_property(none_greater, all_0_0_0), object(all_9_0_1), object(all_0_0_0), yields: % 4.21/1.81 | (18) $false % 4.21/1.81 | % 4.21/1.81 |-The branch is then unsatisfiable % 4.21/1.81 |-Branch two: % 4.21/1.81 | (19) ~ exemplifies_relation(greater_than, all_9_0_1, all_0_0_0) % 4.21/1.81 | (20) all_9_0_1 = all_0_0_0 | exemplifies_relation(greater_than, all_0_0_0, all_9_0_1) % 4.21/1.81 | % 4.21/1.81 +-Applying beta-rule and splitting (20), into two cases. % 4.21/1.81 |-Branch one: % 4.21/1.81 | (21) exemplifies_relation(greater_than, all_0_0_0, all_9_0_1) % 4.21/1.81 | % 4.21/1.81 | Instantiating formula (2) with all_0_0_0, all_9_0_1 and discharging atoms exemplifies_relation(greater_than, all_0_0_0, all_9_0_1), exemplifies_property(conceivable, all_0_0_0), exemplifies_property(none_greater, all_9_0_1), object(all_9_0_1), object(all_0_0_0), yields: % 4.21/1.81 | (18) $false % 4.21/1.81 | % 4.21/1.81 |-The branch is then unsatisfiable % 4.21/1.81 |-Branch two: % 4.21/1.81 | (23) ~ exemplifies_relation(greater_than, all_0_0_0, all_9_0_1) % 4.21/1.81 | (24) all_9_0_1 = all_0_0_0 % 4.21/1.81 | % 4.21/1.81 | Equations (24) can reduce 12 to: % 4.21/1.81 | (25) $false % 4.21/1.81 | % 4.21/1.81 |-The branch is then unsatisfiable % 4.21/1.81 % SZS output end Proof for theBenchmark % 4.21/1.81 % 4.21/1.81 1182ms %------------------------------------------------------------------------------