%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN972+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n005.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:06:11 EDT 2022 % Result : Theorem 2.99s 1.54s % Output : Proof 3.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN972+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n005.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 : Mon Jul 11 17:26:07 EDT 2022 % 0.13/0.35 % CPUTime : % 0.62/0.64 ____ _ % 0.62/0.64 ___ / __ \_____(_)___ ________ __________ % 0.62/0.64 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.62/0.64 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.62/0.64 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.62/0.64 % 0.62/0.64 A Theorem Prover for First-Order Logic % 0.62/0.65 (ePrincess v.1.0) % 0.62/0.65 % 0.62/0.65 (c) Philipp Rümmer, 2009-2015 % 0.62/0.65 (c) Peter Backeman, 2014-2015 % 0.62/0.65 (contributions by Angelo Brillout, Peter Baumgartner) % 0.62/0.65 Free software under GNU Lesser General Public License (LGPL). % 0.62/0.65 Bug reports to peter@backeman.se % 0.62/0.65 % 0.62/0.65 For more information, visit http://user.uu.se/~petba168/breu/ % 0.62/0.65 % 0.62/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.76/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.30/0.94 Prover 0: Preprocessing ... % 1.42/0.98 Prover 0: Warning: ignoring some quantifiers % 1.42/0.99 Prover 0: Constructing countermodel ... % 1.55/1.08 Prover 0: gave up % 1.55/1.08 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.67/1.10 Prover 1: Preprocessing ... % 1.85/1.13 Prover 1: Constructing countermodel ... % 1.85/1.14 Prover 1: gave up % 1.85/1.14 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.85/1.15 Prover 2: Preprocessing ... % 1.97/1.17 Prover 2: Warning: ignoring some quantifiers % 1.97/1.17 Prover 2: Constructing countermodel ... % 1.97/1.20 Prover 2: gave up % 1.97/1.20 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.97/1.20 Prover 3: Preprocessing ... % 1.97/1.21 Prover 3: Warning: ignoring some quantifiers % 1.97/1.21 Prover 3: Constructing countermodel ... % 1.97/1.22 Prover 3: gave up % 2.20/1.23 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.20/1.23 Prover 4: Preprocessing ... % 2.31/1.27 Prover 4: Warning: ignoring some quantifiers % 2.31/1.28 Prover 4: Constructing countermodel ... % 2.45/1.35 Prover 4: gave up % 2.45/1.35 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.45/1.35 Prover 5: Preprocessing ... % 2.45/1.37 Prover 5: Constructing countermodel ... % 2.53/1.37 Prover 5: gave up % 2.53/1.37 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.53/1.38 Prover 6: Preprocessing ... % 2.53/1.39 Prover 6: Warning: ignoring some quantifiers % 2.53/1.39 Prover 6: Constructing countermodel ... % 2.53/1.40 Prover 6: gave up % 2.53/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.53/1.40 Prover 7: Preprocessing ... % 2.53/1.41 Prover 7: Proving ... % 2.99/1.54 Prover 7: proved (140ms) % 2.99/1.54 % 2.99/1.54 % SZS status Theorem for theBenchmark % 2.99/1.54 % 2.99/1.54 Generating proof ... found it (size 9) % 3.10/1.64 % 3.10/1.64 % SZS output start Proof for theBenchmark % 3.10/1.64 Assumed formulas after preprocessing and simplification: % 3.10/1.64 | (0) ? [v0] : ! [v1] : ~ p(v1, v0) & ? [v0] : ! [v1] : p(v0, v1) % 3.10/1.64 | Applying alpha-rule on (0) yields: % 3.10/1.64 | (1) ? [v0] : ! [v1] : ~ p(v1, v0) % 3.10/1.64 | (2) ? [v0] : ! [v1] : p(v0, v1) % 3.10/1.64 | % 3.10/1.64 | Instantiating (2) with all_0_0_0 yields: % 3.10/1.64 | (3) ! [v0] : p(all_0_0_0, v0) % 3.10/1.64 | % 3.10/1.64 | Instantiating (1) with all_1_0_1 yields: % 3.10/1.64 | (4) ! [v0] : ~ p(v0, all_1_0_1) % 3.10/1.64 | % 3.10/1.64 | Introducing new symbol ex_5_0_2 defined by: % 3.10/1.64 | (5) ex_5_0_2 = all_1_0_1 % 3.10/1.64 | % 3.10/1.65 | Instantiating formula (3) with ex_5_0_2 yields: % 3.10/1.65 | (6) p(all_0_0_0, ex_5_0_2) % 3.10/1.65 | % 3.10/1.65 | Instantiating formula (4) with all_0_0_0 yields: % 3.10/1.65 | (7) ~ p(all_0_0_0, all_1_0_1) % 3.10/1.65 | % 3.10/1.65 | From (5) and (6) follows: % 3.10/1.65 | (8) p(all_0_0_0, all_1_0_1) % 3.10/1.65 | % 3.10/1.65 | Using (8) and (7) yields: % 3.10/1.65 | (9) $false % 3.10/1.65 | % 3.10/1.65 |-The branch is then unsatisfiable % 3.10/1.65 % SZS output end Proof for theBenchmark % 3.10/1.65 % 3.10/1.65 992ms %------------------------------------------------------------------------------