%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN073+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n027.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 : Thu Jul 21 04:59:42 EDT 2022 % Result : Theorem 3.29s 1.61s % Output : Proof 4.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN073+1 : TPTP v8.1.0. Released v2.0.0. % 0.12/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 12 05:56:49 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.56 ____ _ % 0.19/0.56 ___ / __ \_____(_)___ ________ __________ % 0.19/0.56 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.56 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.56 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.56 % 0.19/0.56 A Theorem Prover for First-Order Logic % 0.19/0.57 (ePrincess v.1.0) % 0.19/0.57 % 0.19/0.57 (c) Philipp Rümmer, 2009-2015 % 0.19/0.57 (c) Peter Backeman, 2014-2015 % 0.19/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.57 Bug reports to peter@backeman.se % 0.19/0.57 % 0.19/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.57 % 0.19/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.65/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.20/0.87 Prover 0: Preprocessing ... % 1.28/0.90 Prover 0: Warning: ignoring some quantifiers % 1.28/0.91 Prover 0: Constructing countermodel ... % 1.35/1.00 Prover 0: gave up % 1.52/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.52/1.02 Prover 1: Preprocessing ... % 1.52/1.05 Prover 1: Warning: ignoring some quantifiers % 1.52/1.05 Prover 1: Constructing countermodel ... % 1.84/1.10 Prover 1: gave up % 1.84/1.10 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.84/1.11 Prover 2: Preprocessing ... % 1.84/1.12 Prover 2: Warning: ignoring some quantifiers % 1.84/1.12 Prover 2: Constructing countermodel ... % 1.84/1.15 Prover 2: gave up % 1.84/1.15 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.84/1.16 Prover 3: Preprocessing ... % 1.84/1.16 Prover 3: Warning: ignoring some quantifiers % 1.84/1.16 Prover 3: Constructing countermodel ... % 1.84/1.17 Prover 3: gave up % 1.84/1.17 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.23/1.18 Prover 4: Preprocessing ... % 2.23/1.20 Prover 4: Warning: ignoring some quantifiers % 2.23/1.20 Prover 4: Constructing countermodel ... % 2.39/1.24 Prover 4: gave up % 2.39/1.24 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.39/1.24 Prover 5: Preprocessing ... % 2.39/1.25 Prover 5: Warning: ignoring some quantifiers % 2.39/1.25 Prover 5: Constructing countermodel ... % 2.39/1.27 Prover 5: gave up % 2.39/1.27 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.39/1.28 Prover 6: Preprocessing ... % 2.39/1.28 Prover 6: Warning: ignoring some quantifiers % 2.39/1.29 Prover 6: Constructing countermodel ... % 2.39/1.31 Prover 6: gave up % 2.39/1.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.39/1.31 Prover 7: Preprocessing ... % 2.39/1.32 Prover 7: Proving ... % 3.29/1.61 Prover 7: proved (300ms) % 3.29/1.61 % 3.29/1.61 % SZS status Theorem for theBenchmark % 3.29/1.61 % 3.29/1.61 Generating proof ... found it (size 21) % 4.11/1.84 % 4.11/1.84 % SZS output start Proof for theBenchmark % 4.11/1.84 Assumed formulas after preprocessing and simplification: % 4.11/1.84 | (0) ? [v0] : ( ! [v1] : (big_f(v0, v1) | ! [v2] : big_f(v1, v2)) & ! [v1] : ? [v2] : ~ big_f(v1, v2)) % 4.11/1.85 | Instantiating (0) with all_0_0_0 yields: % 4.11/1.85 | (1) ! [v0] : (big_f(all_0_0_0, v0) | ! [v1] : big_f(v0, v1)) & ! [v0] : ? [v1] : ~ big_f(v0, v1) % 4.11/1.85 | % 4.11/1.85 | Applying alpha-rule on (1) yields: % 4.11/1.85 | (2) ! [v0] : (big_f(all_0_0_0, v0) | ! [v1] : big_f(v0, v1)) % 4.11/1.85 | (3) ! [v0] : ? [v1] : ~ big_f(v0, v1) % 4.11/1.85 | % 4.11/1.85 | Introducing new symbol ex_2_0_1 defined by: % 4.11/1.85 | (4) ex_2_0_1 = all_0_0_0 % 4.11/1.85 | % 4.11/1.85 | Instantiating formula (3) with ex_2_0_1 yields: % 4.11/1.85 | (5) ? [v0] : ~ big_f(ex_2_0_1, v0) % 4.11/1.85 | % 4.11/1.85 | Instantiating (5) with all_3_0_2 yields: % 4.11/1.85 | (6) ~ big_f(ex_2_0_1, all_3_0_2) % 4.11/1.85 | % 4.11/1.85 | Introducing new symbol ex_11_0_3 defined by: % 4.11/1.85 | (7) ex_11_0_3 = all_3_0_2 % 4.11/1.85 | % 4.11/1.85 | Instantiating formula (2) with ex_11_0_3 yields: % 4.11/1.85 | (8) big_f(all_0_0_0, ex_11_0_3) | ! [v0] : big_f(ex_11_0_3, v0) % 4.11/1.85 | % 4.11/1.85 +-Applying beta-rule and splitting (8), into two cases. % 4.11/1.85 |-Branch one: % 4.11/1.85 | (9) big_f(all_0_0_0, ex_11_0_3) % 4.11/1.85 | % 4.11/1.85 | From (7) and (9) follows: % 4.11/1.85 | (10) big_f(all_0_0_0, all_3_0_2) % 4.11/1.85 | % 4.11/1.85 | From (4) and (6) follows: % 4.11/1.85 | (11) ~ big_f(all_0_0_0, all_3_0_2) % 4.11/1.85 | % 4.11/1.85 | Using (10) and (11) yields: % 4.11/1.85 | (12) $false % 4.11/1.85 | % 4.11/1.85 |-The branch is then unsatisfiable % 4.11/1.85 |-Branch two: % 4.11/1.85 | (13) ! [v0] : big_f(ex_11_0_3, v0) % 4.11/1.85 | % 4.11/1.85 | Introducing new symbol ex_14_0_4 defined by: % 4.11/1.85 | (14) ex_14_0_4 = all_3_0_2 % 4.11/1.85 | % 4.11/1.85 | Instantiating formula (3) with ex_14_0_4 yields: % 4.11/1.85 | (15) ? [v0] : ~ big_f(ex_14_0_4, v0) % 4.11/1.85 | % 4.11/1.85 | Instantiating (15) with all_15_0_5 yields: % 4.11/1.85 | (16) ~ big_f(ex_14_0_4, all_15_0_5) % 4.11/1.85 | % 4.11/1.85 | Introducing new symbol ex_26_0_7 defined by: % 4.11/1.85 | (17) ex_26_0_7 = all_15_0_5 % 4.11/1.85 | % 4.11/1.85 | Instantiating formula (13) with ex_26_0_7 yields: % 4.11/1.85 | (18) big_f(ex_11_0_3, ex_26_0_7) % 4.11/1.85 | % 4.11/1.85 | From (7)(17) and (18) follows: % 4.11/1.85 | (19) big_f(all_3_0_2, all_15_0_5) % 4.11/1.85 | % 4.11/1.85 | From (14) and (16) follows: % 4.11/1.85 | (20) ~ big_f(all_3_0_2, all_15_0_5) % 4.11/1.85 | % 4.11/1.85 | Using (19) and (20) yields: % 4.11/1.85 | (12) $false % 4.11/1.85 | % 4.11/1.85 |-The branch is then unsatisfiable % 4.11/1.85 % SZS output end Proof for theBenchmark % 4.11/1.85 % 4.11/1.85 1279ms %------------------------------------------------------------------------------