%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n023.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 18:08:54 EDT 2022 % Result : Theorem 3.18s 1.52s % Output : Proof 3.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PUZ061+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n023.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 : Sat May 28 21:51:42 EDT 2022 % 0.13/0.34 % CPUTime : % 0.66/0.62 ____ _ % 0.66/0.62 ___ / __ \_____(_)___ ________ __________ % 0.66/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.66/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.66/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.66/0.62 % 0.66/0.62 A Theorem Prover for First-Order Logic % 0.66/0.63 (ePrincess v.1.0) % 0.66/0.63 % 0.66/0.63 (c) Philipp Rümmer, 2009-2015 % 0.66/0.63 (c) Peter Backeman, 2014-2015 % 0.66/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.63 Bug reports to peter@backeman.se % 0.66/0.63 % 0.66/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.63 % 0.66/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.94 Prover 0: Preprocessing ... % 1.41/1.00 Prover 0: Warning: ignoring some quantifiers % 1.41/1.02 Prover 0: Constructing countermodel ... % 2.06/1.21 Prover 0: gave up % 2.06/1.21 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.20/1.23 Prover 1: Preprocessing ... % 2.27/1.31 Prover 1: Constructing countermodel ... % 2.65/1.40 Prover 1: gave up % 2.65/1.40 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.65/1.42 Prover 2: Preprocessing ... % 2.95/1.47 Prover 2: Warning: ignoring some quantifiers % 2.95/1.47 Prover 2: Constructing countermodel ... % 3.18/1.52 Prover 2: proved (120ms) % 3.18/1.52 % 3.18/1.52 No countermodel exists, formula is valid % 3.18/1.52 % SZS status Theorem for theBenchmark % 3.18/1.52 % 3.18/1.52 Generating proof ... Warning: ignoring some quantifiers % 3.67/1.69 found it (size 21) % 3.67/1.69 % 3.67/1.69 % SZS output start Proof for theBenchmark % 3.67/1.69 Assumed formulas after preprocessing and simplification: % 3.67/1.69 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v6 = 0) & food(v5) = 0 & food(v4) = 0 & likes(v1, v0) = v6 & alive(v2) = 0 & eats(v2, v0) = 0 & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (not_killed_by(v10, v9) = v8) | ~ (not_killed_by(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (likes(v10, v9) = v8) | ~ (likes(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (eats(v10, v9) = v8) | ~ (eats(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : (v9 = 0 | ~ (not_killed_by(v7, v8) = v9) | ~ (alive(v7) = 0)) & ! [v7] : ! [v8] : ! [v9] : (v9 = 0 | ~ (likes(v8, v7) = v9) | ? [v10] : (( ~ (v10 = 0) & alive(v8) = v10) | ( ~ (v10 = 0) & eats(v8, v5) = v10))) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (food(v9) = v8) | ~ (food(v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (alive(v9) = v8) | ~ (alive(v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : (v8 = 0 | ~ (not_killed_by(v9, v7) = 0) | ~ (food(v7) = v8) | ? [v10] : ( ~ (v10 = 0) & eats(v9, v7) = v10)) & ! [v7] : ! [v8] : ! [v9] : (v8 = 0 | ~ (food(v7) = v8) | ~ (eats(v9, v7) = 0) | ? [v10] : ( ~ (v10 = 0) & not_killed_by(v9, v7) = v10)) & ! [v7] : ! [v8] : (v8 = 0 | ~ (likes(v1, v7) = v8) | ? [v9] : ( ~ (v9 = 0) & food(v7) = v9)) & ! [v7] : ! [v8] : (v8 = 0 | ~ (eats(v3, v7) = v8) | ? [v9] : ( ~ (v9 = 0) & eats(v2, v7) = v9)) & ! [v7] : ( ~ (food(v7) = 0) | likes(v1, v7) = 0) & ! [v7] : ( ~ (eats(v2, v7) = 0) | eats(v3, v7) = 0) & ? [v7] : ? [v8] : ? [v9] : not_killed_by(v8, v7) = v9 & ? [v7] : ? [v8] : ? [v9] : likes(v8, v7) = v9 & ? [v7] : ? [v8] : ? [v9] : eats(v8, v7) = v9 & ? [v7] : ? [v8] : food(v7) = v8 & ? [v7] : ? [v8] : alive(v7) = v8) % 3.67/1.72 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6 yields: % 3.67/1.72 | (1) ~ (all_0_0_0 = 0) & food(all_0_1_1) = 0 & food(all_0_2_2) = 0 & likes(all_0_5_5, all_0_6_6) = all_0_0_0 & alive(all_0_4_4) = 0 & eats(all_0_4_4, all_0_6_6) = 0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (not_killed_by(v3, v2) = v1) | ~ (not_killed_by(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (likes(v3, v2) = v1) | ~ (likes(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (eats(v3, v2) = v1) | ~ (eats(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (not_killed_by(v0, v1) = v2) | ~ (alive(v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (likes(v1, v0) = v2) | ? [v3] : (( ~ (v3 = 0) & alive(v1) = v3) | ( ~ (v3 = 0) & eats(v1, all_0_1_1) = v3))) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (food(v2) = v1) | ~ (food(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (alive(v2) = v1) | ~ (alive(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = 0 | ~ (not_killed_by(v2, v0) = 0) | ~ (food(v0) = v1) | ? [v3] : ( ~ (v3 = 0) & eats(v2, v0) = v3)) & ! [v0] : ! [v1] : ! [v2] : (v1 = 0 | ~ (food(v0) = v1) | ~ (eats(v2, v0) = 0) | ? [v3] : ( ~ (v3 = 0) & not_killed_by(v2, v0) = v3)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (likes(all_0_5_5, v0) = v1) | ? [v2] : ( ~ (v2 = 0) & food(v0) = v2)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (eats(all_0_3_3, v0) = v1) | ? [v2] : ( ~ (v2 = 0) & eats(all_0_4_4, v0) = v2)) & ! [v0] : ( ~ (food(v0) = 0) | likes(all_0_5_5, v0) = 0) & ! [v0] : ( ~ (eats(all_0_4_4, v0) = 0) | eats(all_0_3_3, v0) = 0) & ? [v0] : ? [v1] : ? [v2] : not_killed_by(v1, v0) = v2 & ? [v0] : ? [v1] : ? [v2] : likes(v1, v0) = v2 & ? [v0] : ? [v1] : ? [v2] : eats(v1, v0) = v2 & ? [v0] : ? [v1] : food(v0) = v1 & ? [v0] : ? [v1] : alive(v0) = v1 % 3.67/1.73 | % 3.67/1.73 | Applying alpha-rule on (1) yields: % 3.67/1.73 | (2) ! [v0] : ( ~ (eats(all_0_4_4, v0) = 0) | eats(all_0_3_3, v0) = 0) % 3.67/1.73 | (3) ? [v0] : ? [v1] : alive(v0) = v1 % 3.67/1.73 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = 0 | ~ (food(v0) = v1) | ~ (eats(v2, v0) = 0) | ? [v3] : ( ~ (v3 = 0) & not_killed_by(v2, v0) = v3)) % 3.67/1.73 | (5) ? [v0] : ? [v1] : ? [v2] : likes(v1, v0) = v2 % 3.67/1.73 | (6) ! [v0] : ! [v1] : ! [v2] : (v1 = 0 | ~ (not_killed_by(v2, v0) = 0) | ~ (food(v0) = v1) | ? [v3] : ( ~ (v3 = 0) & eats(v2, v0) = v3)) % 3.67/1.73 | (7) food(all_0_2_2) = 0 % 3.67/1.73 | (8) ! [v0] : ( ~ (food(v0) = 0) | likes(all_0_5_5, v0) = 0) % 3.67/1.73 | (9) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (not_killed_by(v0, v1) = v2) | ~ (alive(v0) = 0)) % 3.67/1.73 | (10) food(all_0_1_1) = 0 % 3.67/1.73 | (11) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (likes(v1, v0) = v2) | ? [v3] : (( ~ (v3 = 0) & alive(v1) = v3) | ( ~ (v3 = 0) & eats(v1, all_0_1_1) = v3))) % 3.67/1.73 | (12) ~ (all_0_0_0 = 0) % 3.67/1.73 | (13) eats(all_0_4_4, all_0_6_6) = 0 % 3.67/1.73 | (14) ? [v0] : ? [v1] : ? [v2] : not_killed_by(v1, v0) = v2 % 3.67/1.73 | (15) ! [v0] : ! [v1] : (v1 = 0 | ~ (eats(all_0_3_3, v0) = v1) | ? [v2] : ( ~ (v2 = 0) & eats(all_0_4_4, v0) = v2)) % 3.67/1.73 | (16) alive(all_0_4_4) = 0 % 3.67/1.73 | (17) ? [v0] : ? [v1] : food(v0) = v1 % 3.67/1.73 | (18) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (eats(v3, v2) = v1) | ~ (eats(v3, v2) = v0)) % 3.67/1.73 | (19) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (food(v2) = v1) | ~ (food(v2) = v0)) % 3.67/1.73 | (20) ! [v0] : ! [v1] : (v1 = 0 | ~ (likes(all_0_5_5, v0) = v1) | ? [v2] : ( ~ (v2 = 0) & food(v0) = v2)) % 3.67/1.73 | (21) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (not_killed_by(v3, v2) = v1) | ~ (not_killed_by(v3, v2) = v0)) % 3.67/1.73 | (22) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (alive(v2) = v1) | ~ (alive(v2) = v0)) % 3.67/1.73 | (23) ? [v0] : ? [v1] : ? [v2] : eats(v1, v0) = v2 % 3.67/1.73 | (24) likes(all_0_5_5, all_0_6_6) = all_0_0_0 % 3.67/1.73 | (25) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (likes(v3, v2) = v1) | ~ (likes(v3, v2) = v0)) % 3.67/1.73 | % 3.67/1.73 | Instantiating formula (20) with all_0_0_0, all_0_6_6 and discharging atoms likes(all_0_5_5, all_0_6_6) = all_0_0_0, yields: % 3.67/1.73 | (26) all_0_0_0 = 0 | ? [v0] : ( ~ (v0 = 0) & food(all_0_6_6) = v0) % 3.67/1.73 | % 3.67/1.73 | Instantiating formula (11) with all_0_0_0, all_0_5_5, all_0_6_6 and discharging atoms likes(all_0_5_5, all_0_6_6) = all_0_0_0, yields: % 3.67/1.73 | (27) all_0_0_0 = 0 | ? [v0] : (( ~ (v0 = 0) & alive(all_0_5_5) = v0) | ( ~ (v0 = 0) & eats(all_0_5_5, all_0_1_1) = v0)) % 3.67/1.74 | % 3.67/1.74 +-Applying beta-rule and splitting (27), into two cases. % 3.67/1.74 |-Branch one: % 3.67/1.74 | (28) all_0_0_0 = 0 % 3.67/1.74 | % 3.67/1.74 | Equations (28) can reduce 12 to: % 3.67/1.74 | (29) $false % 3.67/1.74 | % 3.67/1.74 |-The branch is then unsatisfiable % 3.67/1.74 |-Branch two: % 3.67/1.74 | (12) ~ (all_0_0_0 = 0) % 3.67/1.74 | (31) ? [v0] : (( ~ (v0 = 0) & alive(all_0_5_5) = v0) | ( ~ (v0 = 0) & eats(all_0_5_5, all_0_1_1) = v0)) % 3.67/1.74 | % 3.67/1.74 +-Applying beta-rule and splitting (26), into two cases. % 3.67/1.74 |-Branch one: % 3.67/1.74 | (28) all_0_0_0 = 0 % 3.67/1.74 | % 3.67/1.74 | Equations (28) can reduce 12 to: % 3.67/1.74 | (29) $false % 3.67/1.74 | % 3.67/1.74 |-The branch is then unsatisfiable % 3.67/1.74 |-Branch two: % 3.67/1.74 | (12) ~ (all_0_0_0 = 0) % 3.67/1.74 | (35) ? [v0] : ( ~ (v0 = 0) & food(all_0_6_6) = v0) % 3.67/1.74 | % 3.67/1.74 | Instantiating (35) with all_27_0_21 yields: % 3.67/1.74 | (36) ~ (all_27_0_21 = 0) & food(all_0_6_6) = all_27_0_21 % 3.67/1.74 | % 3.67/1.74 | Applying alpha-rule on (36) yields: % 3.67/1.74 | (37) ~ (all_27_0_21 = 0) % 3.67/1.74 | (38) food(all_0_6_6) = all_27_0_21 % 3.67/1.74 | % 3.67/1.74 | Instantiating formula (4) with all_0_4_4, all_27_0_21, all_0_6_6 and discharging atoms food(all_0_6_6) = all_27_0_21, eats(all_0_4_4, all_0_6_6) = 0, yields: % 3.67/1.74 | (39) all_27_0_21 = 0 | ? [v0] : ( ~ (v0 = 0) & not_killed_by(all_0_4_4, all_0_6_6) = v0) % 3.67/1.74 | % 3.67/1.74 +-Applying beta-rule and splitting (39), into two cases. % 3.67/1.74 |-Branch one: % 3.67/1.74 | (40) all_27_0_21 = 0 % 3.67/1.74 | % 3.67/1.74 | Equations (40) can reduce 37 to: % 3.67/1.74 | (29) $false % 3.67/1.74 | % 3.67/1.74 |-The branch is then unsatisfiable % 3.67/1.74 |-Branch two: % 3.67/1.74 | (37) ~ (all_27_0_21 = 0) % 3.67/1.74 | (43) ? [v0] : ( ~ (v0 = 0) & not_killed_by(all_0_4_4, all_0_6_6) = v0) % 3.67/1.74 | % 3.67/1.74 | Instantiating (43) with all_40_0_22 yields: % 3.67/1.74 | (44) ~ (all_40_0_22 = 0) & not_killed_by(all_0_4_4, all_0_6_6) = all_40_0_22 % 3.67/1.74 | % 3.67/1.74 | Applying alpha-rule on (44) yields: % 3.67/1.74 | (45) ~ (all_40_0_22 = 0) % 3.67/1.74 | (46) not_killed_by(all_0_4_4, all_0_6_6) = all_40_0_22 % 3.67/1.74 | % 3.67/1.74 | Instantiating formula (9) with all_40_0_22, all_0_6_6, all_0_4_4 and discharging atoms not_killed_by(all_0_4_4, all_0_6_6) = all_40_0_22, alive(all_0_4_4) = 0, yields: % 3.67/1.74 | (47) all_40_0_22 = 0 % 3.67/1.74 | % 3.67/1.74 | Equations (47) can reduce 45 to: % 3.67/1.74 | (29) $false % 3.67/1.74 | % 3.67/1.74 |-The branch is then unsatisfiable % 3.67/1.74 % SZS output end Proof for theBenchmark % 3.67/1.74 % 3.67/1.74 1098ms %------------------------------------------------------------------------------