%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET043+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n008.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 : Tue Jul 19 00:16:36 EDT 2022 % Result : Theorem 3.20s 1.50s % Output : Proof 3.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET043+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n008.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 : Sat Jul 9 20:09:38 EDT 2022 % 0.12/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.77/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.87 Prover 0: Preprocessing ... % 1.26/0.90 Prover 0: Warning: ignoring some quantifiers % 1.34/0.92 Prover 0: Constructing countermodel ... % 1.38/1.01 Prover 0: gave up % 1.38/1.01 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.64/1.03 Prover 1: Preprocessing ... % 1.64/1.07 Prover 1: Constructing countermodel ... % 1.64/1.08 Prover 1: gave up % 1.64/1.08 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.64/1.08 Prover 2: Preprocessing ... % 1.94/1.11 Prover 2: Warning: ignoring some quantifiers % 1.94/1.12 Prover 2: Constructing countermodel ... % 1.94/1.13 Prover 2: gave up % 1.94/1.14 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.94/1.14 Prover 3: Preprocessing ... % 1.94/1.15 Prover 3: Warning: ignoring some quantifiers % 1.94/1.15 Prover 3: Constructing countermodel ... % 1.94/1.16 Prover 3: gave up % 1.94/1.16 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 1.94/1.17 Prover 4: Preprocessing ... % 2.35/1.21 Prover 4: Warning: ignoring some quantifiers % 2.35/1.21 Prover 4: Constructing countermodel ... % 2.68/1.31 Prover 4: gave up % 2.68/1.31 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.68/1.31 Prover 5: Preprocessing ... % 2.68/1.33 Prover 5: Constructing countermodel ... % 2.68/1.33 Prover 5: gave up % 2.68/1.33 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.68/1.34 Prover 6: Preprocessing ... % 2.68/1.35 Prover 6: Warning: ignoring some quantifiers % 2.68/1.35 Prover 6: Constructing countermodel ... % 2.68/1.36 Prover 6: gave up % 2.68/1.36 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 2.68/1.37 Prover 7: Preprocessing ... % 2.90/1.37 Prover 7: Proving ... % 3.20/1.50 Prover 7: proved (138ms) % 3.20/1.50 % 3.20/1.50 % SZS status Theorem for theBenchmark % 3.20/1.50 % 3.20/1.50 Generating proof ... found it (size 13) % 3.49/1.63 % 3.49/1.63 % SZS output start Proof for theBenchmark % 3.49/1.63 Assumed formulas after preprocessing and simplification: % 3.49/1.63 | (0) ? [v0] : ( ! [v1] : ( ~ element(v1, v1) | ~ element(v1, v0)) & ! [v1] : (element(v1, v1) | element(v1, v0))) % 3.49/1.63 | Instantiating (0) with all_0_0_0 yields: % 3.49/1.63 | (1) ! [v0] : ( ~ element(v0, v0) | ~ element(v0, all_0_0_0)) & ! [v0] : (element(v0, v0) | element(v0, all_0_0_0)) % 3.49/1.63 | % 3.49/1.63 | Applying alpha-rule on (1) yields: % 3.49/1.63 | (2) ! [v0] : ( ~ element(v0, v0) | ~ element(v0, all_0_0_0)) % 3.49/1.63 | (3) ! [v0] : (element(v0, v0) | element(v0, all_0_0_0)) % 3.49/1.63 | % 3.49/1.63 | Introducing new symbol ex_4_0_1 defined by: % 3.49/1.63 | (4) ex_4_0_1 = all_0_0_0 % 3.49/1.63 | % 3.49/1.63 | Instantiating formula (3) with ex_4_0_1 yields: % 3.49/1.63 | (5) element(ex_4_0_1, ex_4_0_1) | element(ex_4_0_1, all_0_0_0) % 3.49/1.63 | % 3.49/1.63 +-Applying beta-rule and splitting (5), into two cases. % 3.49/1.63 |-Branch one: % 3.49/1.63 | (6) element(ex_4_0_1, ex_4_0_1) % 3.49/1.63 | % 3.49/1.63 | Instantiating formula (2) with all_0_0_0 yields: % 3.49/1.63 | (7) ~ element(all_0_0_0, all_0_0_0) % 3.49/1.63 | % 3.49/1.63 | From (4)(4) and (6) follows: % 3.49/1.63 | (8) element(all_0_0_0, all_0_0_0) % 3.49/1.63 | % 3.49/1.63 | Using (8) and (7) yields: % 3.49/1.63 | (9) $false % 3.49/1.63 | % 3.49/1.63 |-The branch is then unsatisfiable % 3.49/1.63 |-Branch two: % 3.49/1.63 | (10) element(ex_4_0_1, all_0_0_0) % 3.49/1.63 | % 3.49/1.63 | Instantiating formula (2) with all_0_0_0 yields: % 3.49/1.63 | (7) ~ element(all_0_0_0, all_0_0_0) % 3.49/1.63 | % 3.49/1.64 | From (4) and (10) follows: % 3.49/1.64 | (8) element(all_0_0_0, all_0_0_0) % 3.49/1.64 | % 3.49/1.64 | Using (8) and (7) yields: % 3.49/1.64 | (9) $false % 3.49/1.64 | % 3.49/1.64 |-The branch is then unsatisfiable % 3.49/1.64 % SZS output end Proof for theBenchmark % 3.49/1.64 % 3.49/1.64 1043ms %------------------------------------------------------------------------------