%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN339+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n006.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:33 EDT 2022 % Result : Theorem 3.07s 1.47s % Output : Proof 3.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN339+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n006.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 14:19:35 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.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.07/0.86 Prover 0: Preprocessing ... % 1.28/0.90 Prover 0: Warning: ignoring some quantifiers % 1.33/0.91 Prover 0: Constructing countermodel ... % 1.37/1.00 Prover 0: gave up % 1.37/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.37/1.02 Prover 1: Preprocessing ... % 1.65/1.04 Prover 1: Warning: ignoring some quantifiers % 1.65/1.05 Prover 1: Constructing countermodel ... % 1.65/1.05 Prover 1: gave up % 1.65/1.05 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.65/1.06 Prover 2: Preprocessing ... % 1.65/1.08 Prover 2: Warning: ignoring some quantifiers % 1.65/1.08 Prover 2: Constructing countermodel ... % 1.98/1.10 Prover 2: gave up % 1.98/1.10 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.98/1.10 Prover 3: Preprocessing ... % 1.98/1.11 Prover 3: Warning: ignoring some quantifiers % 1.98/1.11 Prover 3: Constructing countermodel ... % 1.98/1.12 Prover 3: gave up % 1.98/1.12 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 1.98/1.13 Prover 4: Preprocessing ... % 1.98/1.15 Prover 4: Warning: ignoring some quantifiers % 1.98/1.15 Prover 4: Constructing countermodel ... % 2.29/1.19 Prover 4: gave up % 2.31/1.19 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.31/1.20 Prover 5: Preprocessing ... % 2.31/1.21 Prover 5: Warning: ignoring some quantifiers % 2.31/1.21 Prover 5: Constructing countermodel ... % 2.31/1.21 Prover 5: gave up % 2.31/1.21 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.31/1.22 Prover 6: Preprocessing ... % 2.40/1.23 Prover 6: Warning: ignoring some quantifiers % 2.41/1.23 Prover 6: Constructing countermodel ... % 2.41/1.24 Prover 6: gave up % 2.41/1.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.41/1.24 Prover 7: Preprocessing ... % 2.41/1.25 Prover 7: Proving ... % 3.07/1.47 Prover 7: proved (234ms) % 3.07/1.47 % 3.07/1.47 % SZS status Theorem for theBenchmark % 3.07/1.47 % 3.07/1.47 Generating proof ... found it (size 13) % 3.62/1.72 % 3.62/1.72 % SZS output start Proof for theBenchmark % 3.62/1.72 Assumed formulas after preprocessing and simplification: % 3.62/1.72 | (0) ! [v0] : ? [v1] : ( ! [v2] : ~ big_f(v1, v2, v2) & ! [v2] : big_f(v0, v1, v2)) % 3.62/1.72 | Instantiating formula (0) with ex_0_0_0 yields: % 3.62/1.72 | (1) ? [v0] : ( ! [v1] : ~ big_f(v0, v1, v1) & ! [v1] : big_f(ex_0_0_0, v0, v1)) % 3.62/1.72 | % 3.62/1.72 | Instantiating (1) with all_1_0_1 yields: % 3.62/1.72 | (2) ! [v0] : ~ big_f(all_1_0_1, v0, v0) & ! [v0] : big_f(ex_0_0_0, all_1_0_1, v0) % 3.62/1.72 | % 3.62/1.72 | Applying alpha-rule on (2) yields: % 3.62/1.72 | (3) ! [v0] : ~ big_f(all_1_0_1, v0, v0) % 3.62/1.72 | (4) ! [v0] : big_f(ex_0_0_0, all_1_0_1, v0) % 3.62/1.72 | % 3.62/1.72 | Introducing new symbol ex_5_0_2 defined by: % 3.62/1.72 | (5) ex_5_0_2 = all_1_0_1 % 3.62/1.72 | % 3.62/1.72 | Instantiating formula (0) with ex_5_0_2 yields: % 3.62/1.72 | (6) ? [v0] : ( ! [v1] : ~ big_f(v0, v1, v1) & ! [v1] : big_f(ex_5_0_2, v0, v1)) % 3.62/1.72 | % 3.62/1.72 | Instantiating (6) with all_6_0_3 yields: % 3.62/1.72 | (7) ! [v0] : ~ big_f(all_6_0_3, v0, v0) & ! [v0] : big_f(ex_5_0_2, all_6_0_3, v0) % 3.62/1.72 | % 3.62/1.72 | Applying alpha-rule on (7) yields: % 3.62/1.72 | (8) ! [v0] : ~ big_f(all_6_0_3, v0, v0) % 3.62/1.72 | (9) ! [v0] : big_f(ex_5_0_2, all_6_0_3, v0) % 3.62/1.72 | % 3.62/1.72 | Introducing new symbol ex_32_0_7 defined by: % 3.62/1.72 | (10) ex_32_0_7 = all_6_0_3 % 3.62/1.72 | % 3.62/1.72 | Instantiating formula (9) with ex_32_0_7 yields: % 3.62/1.72 | (11) big_f(ex_5_0_2, all_6_0_3, ex_32_0_7) % 3.62/1.72 | % 3.62/1.72 | Instantiating formula (3) with all_6_0_3 yields: % 3.62/1.72 | (12) ~ big_f(all_1_0_1, all_6_0_3, all_6_0_3) % 3.62/1.73 | % 3.62/1.73 | From (5)(10) and (11) follows: % 3.62/1.73 | (13) big_f(all_1_0_1, all_6_0_3, all_6_0_3) % 3.62/1.73 | % 3.62/1.73 | Using (13) and (12) yields: % 3.62/1.73 | (14) $false % 3.62/1.73 | % 3.62/1.73 |-The branch is then unsatisfiable % 3.62/1.73 % SZS output end Proof for theBenchmark % 3.62/1.73 % 3.62/1.73 1110ms %------------------------------------------------------------------------------