%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN731+1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n028.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:04:46 EDT 2022 % Result : Theorem 2.80s 1.40s % Output : Proof 3.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN731+1 : TPTP v8.1.0. Released v2.5.0. % 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n028.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 18:39:59 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.59 ____ _ % 0.20/0.59 ___ / __ \_____(_)___ ________ __________ % 0.20/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.20/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.20/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic % 0.20/0.59 (ePrincess v.1.0) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2015 % 0.20/0.59 (c) Peter Backeman, 2014-2015 % 0.20/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.20/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.20/0.59 Bug reports to peter@backeman.se % 0.20/0.59 % 0.20/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.73/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.30/0.89 Prover 0: Preprocessing ... % 1.38/0.92 Prover 0: Warning: ignoring some quantifiers % 1.42/0.93 Prover 0: Constructing countermodel ... % 1.62/1.02 Prover 0: gave up % 1.62/1.02 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.62/1.04 Prover 1: Preprocessing ... % 1.62/1.07 Prover 1: Warning: ignoring some quantifiers % 1.62/1.07 Prover 1: Constructing countermodel ... % 1.89/1.10 Prover 1: gave up % 1.89/1.10 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.89/1.11 Prover 2: Preprocessing ... % 1.89/1.13 Prover 2: Warning: ignoring some quantifiers % 1.89/1.13 Prover 2: Constructing countermodel ... % 1.89/1.15 Prover 2: gave up % 1.89/1.15 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.89/1.16 Prover 3: Preprocessing ... % 1.89/1.16 Prover 3: Warning: ignoring some quantifiers % 1.89/1.16 Prover 3: Constructing countermodel ... % 2.27/1.18 Prover 3: gave up % 2.27/1.18 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.27/1.18 Prover 4: Preprocessing ... % 2.36/1.20 Prover 4: Warning: ignoring some quantifiers % 2.36/1.20 Prover 4: Constructing countermodel ... % 2.46/1.24 Prover 4: gave up % 2.46/1.24 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.46/1.24 Prover 5: Preprocessing ... % 2.46/1.25 Prover 5: Warning: ignoring some quantifiers % 2.46/1.26 Prover 5: Constructing countermodel ... % 2.46/1.27 Prover 5: gave up % 2.46/1.27 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.46/1.27 Prover 6: Preprocessing ... % 2.46/1.28 Prover 6: Warning: ignoring some quantifiers % 2.46/1.28 Prover 6: Constructing countermodel ... % 2.46/1.30 Prover 6: gave up % 2.46/1.30 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.66/1.30 Prover 7: Preprocessing ... % 2.66/1.31 Prover 7: Proving ... % 2.80/1.40 Prover 7: proved (96ms) % 2.80/1.40 % 2.80/1.40 % SZS status Theorem for theBenchmark % 2.80/1.40 % 2.80/1.40 Generating proof ... found it (size 10) % 3.06/1.52 % 3.06/1.52 % SZS output start Proof for theBenchmark % 3.06/1.52 Assumed formulas after preprocessing and simplification: % 3.06/1.52 | (0) ! [v0] : ! [v1] : ~ p(v1, v1, v0) & ! [v0] : ! [v1] : ? [v2] : p(v0, v1, v2) % 3.06/1.52 | Applying alpha-rule on (0) yields: % 3.06/1.52 | (1) ! [v0] : ! [v1] : ~ p(v1, v1, v0) % 3.06/1.52 | (2) ! [v0] : ! [v1] : ? [v2] : p(v0, v1, v2) % 3.06/1.52 | % 3.06/1.52 | Introducing new symbol ex_2_1_1 defined by: % 3.06/1.52 | (3) ex_2_1_1 = arbitrary_constant % 3.06/1.52 | % 3.06/1.52 | Introducing new symbol ex_2_0_0 defined by: % 3.06/1.52 | (4) ex_2_0_0 = arbitrary_constant % 3.06/1.52 | % 3.06/1.52 | Instantiating formula (2) with ex_2_0_0, ex_2_1_1 yields: % 3.06/1.52 | (5) ? [v0] : p(ex_2_1_1, ex_2_0_0, v0) % 3.06/1.52 | % 3.06/1.52 | Instantiating (5) with all_3_0_2 yields: % 3.06/1.52 | (6) p(ex_2_1_1, ex_2_0_0, all_3_0_2) % 3.06/1.52 | % 3.06/1.52 | Instantiating formula (1) with ex_2_1_1, all_3_0_2 yields: % 3.06/1.52 | (7) ~ p(ex_2_1_1, ex_2_1_1, all_3_0_2) % 3.06/1.52 | % 3.06/1.52 | From (3)(4) and (6) follows: % 3.12/1.53 | (8) p(arbitrary_constant, arbitrary_constant, all_3_0_2) % 3.12/1.53 | % 3.12/1.53 | From (3)(3) and (7) follows: % 3.12/1.53 | (9) ~ p(arbitrary_constant, arbitrary_constant, all_3_0_2) % 3.12/1.53 | % 3.12/1.53 | Using (8) and (9) yields: % 3.12/1.53 | (10) $false % 3.12/1.53 | % 3.12/1.53 |-The branch is then unsatisfiable % 3.12/1.53 % SZS output end Proof for theBenchmark % 3.12/1.53 % 3.12/1.53 925ms %------------------------------------------------------------------------------