%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN323+1 : TPTP v8.1.0. Released v2.0.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:01:22 EDT 2022 % Result : Theorem 1.44s 0.97s % Output : Proof 1.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN323+1 : TPTP v8.1.0. Released v2.0.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n005.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 19:23:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.57 ____ _ % 0.18/0.57 ___ / __ \_____(_)___ ________ __________ % 0.18/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.57 % 0.18/0.57 A Theorem Prover for First-Order Logic % 0.18/0.57 (ePrincess v.1.0) % 0.18/0.57 % 0.18/0.57 (c) Philipp Rümmer, 2009-2015 % 0.18/0.57 (c) Peter Backeman, 2014-2015 % 0.18/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.57 Bug reports to peter@backeman.se % 0.18/0.57 % 0.18/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.57 % 0.18/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.13/0.83 Prover 0: Preprocessing ... % 1.33/0.88 Prover 0: Warning: ignoring some quantifiers % 1.33/0.89 Prover 0: Constructing countermodel ... % 1.44/0.97 Prover 0: proved (352ms) % 1.44/0.97 % 1.44/0.97 No countermodel exists, formula is valid % 1.44/0.97 % SZS status Theorem for theBenchmark % 1.44/0.97 % 1.44/0.97 Generating proof ... Warning: ignoring some quantifiers % 1.93/1.10 found it (size 10) % 1.93/1.10 % 1.93/1.10 % SZS output start Proof for theBenchmark % 1.93/1.10 Assumed formulas after preprocessing and simplification: % 1.93/1.10 | (0) ! [v0] : ! [v1] : ( ~ big_g(v1, v0) | ~ big_f(v0, v1)) & ! [v0] : ! [v1] : ( ~ big_g(v1, v0) | big_f(v1, v0)) & ! [v0] : ! [v1] : ( ~ big_f(v0, v1) | big_g(v1, v0)) & ? [v0] : ? [v1] : (big_g(v1, v0) | big_f(v1, v0)) % 1.93/1.11 | Applying alpha-rule on (0) yields: % 1.93/1.11 | (1) ! [v0] : ! [v1] : ( ~ big_g(v1, v0) | ~ big_f(v0, v1)) % 1.93/1.11 | (2) ! [v0] : ! [v1] : ( ~ big_g(v1, v0) | big_f(v1, v0)) % 1.93/1.11 | (3) ! [v0] : ! [v1] : ( ~ big_f(v0, v1) | big_g(v1, v0)) % 1.93/1.11 | (4) ? [v0] : ? [v1] : (big_g(v1, v0) | big_f(v1, v0)) % 1.93/1.11 | % 1.93/1.11 | Instantiating (4) with all_1_0_0, all_1_1_1 yields: % 1.93/1.11 | (5) big_g(all_1_0_0, all_1_1_1) | big_f(all_1_0_0, all_1_1_1) % 1.93/1.11 | % 1.93/1.11 +-Applying beta-rule and splitting (5), into two cases. % 1.93/1.11 |-Branch one: % 1.93/1.11 | (6) big_g(all_1_0_0, all_1_1_1) % 1.93/1.11 | % 1.93/1.11 | Instantiating formula (2) with all_1_0_0, all_1_1_1 and discharging atoms big_g(all_1_0_0, all_1_1_1), yields: % 1.93/1.11 | (7) big_f(all_1_0_0, all_1_1_1) % 1.93/1.11 | % 1.93/1.11 | Instantiating formula (3) with all_1_1_1, all_1_0_0 and discharging atoms big_f(all_1_0_0, all_1_1_1), yields: % 1.93/1.11 | (8) big_g(all_1_1_1, all_1_0_0) % 1.93/1.11 | % 1.93/1.11 | Instantiating formula (1) with all_1_1_1, all_1_0_0 and discharging atoms big_g(all_1_1_1, all_1_0_0), big_f(all_1_0_0, all_1_1_1), yields: % 1.93/1.11 | (9) $false % 1.93/1.11 | % 1.93/1.11 |-The branch is then unsatisfiable % 1.93/1.11 |-Branch two: % 1.93/1.11 | (10) ~ big_g(all_1_0_0, all_1_1_1) % 1.93/1.11 | (7) big_f(all_1_0_0, all_1_1_1) % 1.93/1.11 | % 1.93/1.12 | Instantiating formula (3) with all_1_1_1, all_1_0_0 and discharging atoms big_f(all_1_0_0, all_1_1_1), yields: % 1.93/1.12 | (8) big_g(all_1_1_1, all_1_0_0) % 1.93/1.12 | % 1.93/1.12 | Instantiating formula (1) with all_1_1_1, all_1_0_0 and discharging atoms big_g(all_1_1_1, all_1_0_0), big_f(all_1_0_0, all_1_1_1), yields: % 1.93/1.12 | (9) $false % 1.93/1.12 | % 1.93/1.12 |-The branch is then unsatisfiable % 1.93/1.12 % SZS output end Proof for theBenchmark % 1.93/1.12 % 1.93/1.12 535ms %------------------------------------------------------------------------------