%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN384+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n022.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 05:01:59 EDT 2022 % Result : Theorem 2.63s 1.46s % Output : Proof 3.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN384+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n022.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 13:29:55 EDT 2022 % 0.12/0.34 % CPUTime : % 0.59/0.60 ____ _ % 0.59/0.60 ___ / __ \_____(_)___ ________ __________ % 0.59/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.60 % 0.59/0.60 A Theorem Prover for First-Order Logic % 0.59/0.60 (ePrincess v.1.0) % 0.59/0.60 % 0.59/0.60 (c) Philipp Rümmer, 2009-2015 % 0.59/0.60 (c) Peter Backeman, 2014-2015 % 0.59/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.60 Bug reports to peter@backeman.se % 0.59/0.60 % 0.59/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.60 % 0.59/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.67/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.26/0.92 Prover 0: Preprocessing ... % 1.30/0.95 Prover 0: Warning: ignoring some quantifiers % 1.30/0.97 Prover 0: Constructing countermodel ... % 1.47/1.05 Prover 0: gave up % 1.47/1.05 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.47/1.06 Prover 1: Preprocessing ... % 1.77/1.10 Prover 1: Constructing countermodel ... % 1.77/1.11 Prover 1: gave up % 1.77/1.11 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.77/1.12 Prover 2: Preprocessing ... % 1.77/1.13 Prover 2: Warning: ignoring some quantifiers % 1.77/1.13 Prover 2: Constructing countermodel ... % 1.77/1.15 Prover 2: gave up % 1.77/1.15 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.77/1.16 Prover 3: Preprocessing ... % 1.77/1.17 Prover 3: Warning: ignoring some quantifiers % 1.77/1.17 Prover 3: Constructing countermodel ... % 1.77/1.18 Prover 3: gave up % 1.77/1.18 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 1.77/1.18 Prover 4: Preprocessing ... % 2.16/1.20 Prover 4: Warning: ignoring some quantifiers % 2.16/1.20 Prover 4: Constructing countermodel ... % 2.23/1.25 Prover 4: gave up % 2.23/1.25 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.23/1.25 Prover 5: Preprocessing ... % 2.23/1.26 Prover 5: Constructing countermodel ... % 2.23/1.26 Prover 5: gave up % 2.23/1.26 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.23/1.27 Prover 6: Preprocessing ... % 2.23/1.28 Prover 6: Warning: ignoring some quantifiers % 2.23/1.28 Prover 6: Constructing countermodel ... % 2.23/1.29 Prover 6: gave up % 2.23/1.29 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.23/1.29 Prover 7: Preprocessing ... % 2.23/1.30 Prover 7: Proving ... % 2.63/1.46 Prover 7: proved (172ms) % 2.63/1.46 % 2.63/1.46 % SZS status Theorem for theBenchmark % 2.63/1.46 % 2.63/1.46 Generating proof ... found it (size 14) % 3.24/1.63 % 3.24/1.63 % SZS output start Proof for theBenchmark % 3.24/1.63 Assumed formulas after preprocessing and simplification: % 3.24/1.63 | (0) ? [v0] : ! [v1] : ! [v2] : ? [v3] : (big_p(v1, v2, v0) & ~ big_p(v3, v1, v1)) % 3.24/1.63 | Instantiating (0) with all_0_0_0 yields: % 3.24/1.63 | (1) ! [v0] : ! [v1] : ? [v2] : (big_p(v0, v1, all_0_0_0) & ~ big_p(v2, v0, v0)) % 3.24/1.63 | % 3.24/1.63 | Introducing new symbol ex_2_1_2 defined by: % 3.24/1.63 | (2) ex_2_1_2 = all_0_0_0 % 3.24/1.63 | % 3.24/1.63 | Instantiating formula (1) with ex_2_0_1, ex_2_1_2 yields: % 3.24/1.63 | (3) ? [v0] : (big_p(ex_2_1_2, ex_2_0_1, all_0_0_0) & ~ big_p(v0, ex_2_1_2, ex_2_1_2)) % 3.24/1.63 | % 3.24/1.63 | Instantiating (3) with all_3_0_3 yields: % 3.24/1.63 | (4) big_p(ex_2_1_2, ex_2_0_1, all_0_0_0) & ~ big_p(all_3_0_3, ex_2_1_2, ex_2_1_2) % 3.24/1.64 | % 3.24/1.64 | Applying alpha-rule on (4) yields: % 3.24/1.64 | (5) big_p(ex_2_1_2, ex_2_0_1, all_0_0_0) % 3.24/1.64 | (6) ~ big_p(all_3_0_3, ex_2_1_2, ex_2_1_2) % 3.24/1.64 | % 3.24/1.64 | Introducing new symbol ex_11_1_5 defined by: % 3.24/1.64 | (7) ex_11_1_5 = all_3_0_3 % 3.24/1.64 | % 3.24/1.64 | Introducing new symbol ex_11_0_4 defined by: % 3.24/1.64 | (8) ex_11_0_4 = all_0_0_0 % 3.24/1.64 | % 3.24/1.64 | Instantiating formula (1) with ex_11_0_4, ex_11_1_5 yields: % 3.24/1.64 | (9) ? [v0] : (big_p(ex_11_1_5, ex_11_0_4, all_0_0_0) & ~ big_p(v0, ex_11_1_5, ex_11_1_5)) % 3.24/1.64 | % 3.24/1.64 | Instantiating (9) with all_12_0_6 yields: % 3.24/1.64 | (10) big_p(ex_11_1_5, ex_11_0_4, all_0_0_0) & ~ big_p(all_12_0_6, ex_11_1_5, ex_11_1_5) % 3.24/1.64 | % 3.24/1.64 | Applying alpha-rule on (10) yields: % 3.24/1.64 | (11) big_p(ex_11_1_5, ex_11_0_4, all_0_0_0) % 3.24/1.64 | (12) ~ big_p(all_12_0_6, ex_11_1_5, ex_11_1_5) % 3.24/1.64 | % 3.24/1.64 | From (7)(8) and (11) follows: % 3.24/1.64 | (13) big_p(all_3_0_3, all_0_0_0, all_0_0_0) % 3.24/1.64 | % 3.24/1.64 | From (2)(2) and (6) follows: % 3.24/1.64 | (14) ~ big_p(all_3_0_3, all_0_0_0, all_0_0_0) % 3.24/1.64 | % 3.24/1.64 | Using (13) and (14) yields: % 3.24/1.64 | (15) $false % 3.24/1.64 | % 3.24/1.64 |-The branch is then unsatisfiable % 3.24/1.64 % SZS output end Proof for theBenchmark % 3.24/1.64 % 3.24/1.64 1022ms %------------------------------------------------------------------------------