%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN371+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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:53 EDT 2022 % Result : Theorem 2.29s 1.22s % Output : Proof 2.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN371+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n017.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 19:30:34 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.58 ____ _ % 0.19/0.58 ___ / __ \_____(_)___ ________ __________ % 0.19/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic % 0.19/0.58 (ePrincess v.1.0) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2015 % 0.19/0.58 (c) Peter Backeman, 2014-2015 % 0.19/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.58 Bug reports to peter@backeman.se % 0.19/0.58 % 0.19/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.74/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.28/0.89 Prover 0: Preprocessing ... % 1.36/0.93 Prover 0: Warning: ignoring some quantifiers % 1.40/0.95 Prover 0: Constructing countermodel ... % 1.57/1.03 Prover 0: gave up % 1.57/1.03 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.57/1.05 Prover 1: Preprocessing ... % 1.85/1.09 Prover 1: Constructing countermodel ... % 1.85/1.09 Prover 1: gave up % 1.85/1.09 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.85/1.10 Prover 2: Preprocessing ... % 1.85/1.12 Prover 2: Warning: ignoring some quantifiers % 1.85/1.12 Prover 2: Constructing countermodel ... % 1.85/1.14 Prover 2: gave up % 1.85/1.14 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.85/1.15 Prover 3: Preprocessing ... % 1.85/1.16 Prover 3: Warning: ignoring some quantifiers % 1.85/1.16 Prover 3: Constructing countermodel ... % 1.85/1.17 Prover 3: gave up % 1.85/1.17 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 2.21/1.18 Prover 4: Preprocessing ... % 2.29/1.20 Prover 4: Warning: ignoring some quantifiers % 2.29/1.20 Prover 4: Constructing countermodel ... % 2.29/1.22 Prover 4: proved (44ms) % 2.29/1.22 % 2.29/1.22 No countermodel exists, formula is valid % 2.29/1.22 % SZS status Theorem for theBenchmark % 2.29/1.22 % 2.29/1.22 Generating proof ... Warning: ignoring some quantifiers % 2.40/1.32 found it (size 8) % 2.40/1.32 % 2.40/1.32 % SZS output start Proof for theBenchmark % 2.40/1.32 Assumed formulas after preprocessing and simplification: % 2.40/1.32 | (0) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (big_r(v3, v2) = v1) | ~ (big_r(v3, v2) = v0)) & ! [v0] : ! [v1] : ( ~ (big_r(v0, v0) = v1) | ? [v2] : ? [v3] : (v1 = 0 & ~ (v3 = 0) & big_r(v2, v2) = v3)) & ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & big_r(v1, v1) = v2 & big_r(v0, v0) = 0) & ( ! [v0] : ! [v1] : (v1 = 0 | ~ (big_r(v0, v0) = v1)) | ! [v0] : ~ (big_r(v0, v0) = 0)) % 2.59/1.35 | Applying alpha-rule on (0) yields: % 2.59/1.35 | (1) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (big_r(v3, v2) = v1) | ~ (big_r(v3, v2) = v0)) % 2.59/1.35 | (2) ! [v0] : ! [v1] : ( ~ (big_r(v0, v0) = v1) | ? [v2] : ? [v3] : (v1 = 0 & ~ (v3 = 0) & big_r(v2, v2) = v3)) % 2.59/1.35 | (3) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & big_r(v1, v1) = v2 & big_r(v0, v0) = 0) % 2.59/1.35 | (4) ! [v0] : ! [v1] : (v1 = 0 | ~ (big_r(v0, v0) = v1)) | ! [v0] : ~ (big_r(v0, v0) = 0) % 2.59/1.35 | % 2.59/1.35 | Instantiating (3) with all_1_0_0, all_1_1_1, all_1_2_2 yields: % 2.59/1.35 | (5) ~ (all_1_0_0 = 0) & big_r(all_1_1_1, all_1_1_1) = all_1_0_0 & big_r(all_1_2_2, all_1_2_2) = 0 % 2.59/1.35 | % 2.59/1.35 | Applying alpha-rule on (5) yields: % 2.59/1.35 | (6) ~ (all_1_0_0 = 0) % 2.59/1.35 | (7) big_r(all_1_1_1, all_1_1_1) = all_1_0_0 % 2.59/1.35 | (8) big_r(all_1_2_2, all_1_2_2) = 0 % 2.59/1.35 | % 2.59/1.35 | Instantiating formula (2) with all_1_0_0, all_1_1_1 and discharging atoms big_r(all_1_1_1, all_1_1_1) = all_1_0_0, yields: % 2.59/1.35 | (9) ? [v0] : ? [v1] : (all_1_0_0 = 0 & ~ (v1 = 0) & big_r(v0, v0) = v1) % 2.59/1.36 | % 2.59/1.36 | Instantiating (9) with all_10_0_5, all_10_1_6 yields: % 2.59/1.36 | (10) all_1_0_0 = 0 & ~ (all_10_0_5 = 0) & big_r(all_10_1_6, all_10_1_6) = all_10_0_5 % 2.59/1.36 | % 2.59/1.36 | Applying alpha-rule on (10) yields: % 2.59/1.36 | (11) all_1_0_0 = 0 % 2.59/1.36 | (12) ~ (all_10_0_5 = 0) % 2.59/1.36 | (13) big_r(all_10_1_6, all_10_1_6) = all_10_0_5 % 2.59/1.36 | % 2.59/1.36 | Equations (11) can reduce 6 to: % 2.59/1.36 | (14) $false % 2.59/1.36 | % 2.59/1.36 |-The branch is then unsatisfiable % 2.59/1.36 % SZS output end Proof for theBenchmark % 2.59/1.36 % 2.59/1.36 765ms %------------------------------------------------------------------------------