TSTP Solution File: SYN407+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n007.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 : 300s
% DateTime : Fri Sep 1 03:27:34 EDT 2023
% Result : Theorem 3.14s 1.13s
% Output : Proof 3.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Aug 26 18:36:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.73/0.95 Prover 1: Preprocessing ...
% 1.73/0.95 Prover 4: Preprocessing ...
% 2.28/1.01 Prover 6: Preprocessing ...
% 2.28/1.01 Prover 0: Preprocessing ...
% 2.28/1.01 Prover 3: Preprocessing ...
% 2.28/1.01 Prover 2: Preprocessing ...
% 2.28/1.01 Prover 5: Preprocessing ...
% 2.28/1.06 Prover 5: Constructing countermodel ...
% 2.28/1.06 Prover 2: Constructing countermodel ...
% 2.28/1.06 Prover 1: Constructing countermodel ...
% 2.28/1.06 Prover 3: Constructing countermodel ...
% 2.28/1.07 Prover 6: Proving ...
% 2.91/1.09 Prover 4: Constructing countermodel ...
% 3.09/1.11 Prover 0: Proving ...
% 3.14/1.13 Prover 5: proved (486ms)
% 3.14/1.13 Prover 2: proved (489ms)
% 3.14/1.13
% 3.14/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.14/1.13
% 3.14/1.13
% 3.14/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.14/1.13
% 3.14/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.14/1.14 Prover 3: stopped
% 3.14/1.14 Prover 6: stopped
% 3.14/1.14 Prover 1: gave up
% 3.14/1.15 Prover 0: stopped
% 3.14/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.14/1.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.14/1.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.14/1.16 Prover 7: Preprocessing ...
% 3.14/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.14/1.16 Prover 11: Preprocessing ...
% 3.14/1.16 Prover 7: Constructing countermodel ...
% 3.14/1.16 Prover 13: Preprocessing ...
% 3.14/1.16 Prover 10: Preprocessing ...
% 3.14/1.16 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 3.14/1.16 Prover 8: Preprocessing ...
% 3.14/1.17 Prover 13: Constructing countermodel ...
% 3.14/1.18 Prover 16: Preprocessing ...
% 3.14/1.18 Prover 10: Constructing countermodel ...
% 3.14/1.19 Prover 16: Constructing countermodel ...
% 3.14/1.19 Prover 8: Warning: ignoring some quantifiers
% 3.14/1.19 Prover 13: Found proof (size 5)
% 3.14/1.19 Prover 13: proved (48ms)
% 3.14/1.20 Prover 16: stopped
% 3.14/1.20 Prover 4: stopped
% 3.14/1.20 Prover 10: Found proof (size 5)
% 3.14/1.20 Prover 10: proved (52ms)
% 3.14/1.20 Prover 7: Found proof (size 5)
% 3.14/1.20 Prover 7: proved (61ms)
% 3.14/1.20 Prover 8: Constructing countermodel ...
% 3.14/1.20 Prover 8: stopped
% 3.14/1.21 Prover 11: Constructing countermodel ...
% 3.14/1.22 Prover 11: stopped
% 3.14/1.22
% 3.14/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.14/1.22
% 3.14/1.22 % SZS output start Proof for theBenchmark
% 3.14/1.22 Assumptions after simplification:
% 3.14/1.22 ---------------------------------
% 3.14/1.22
% 3.14/1.22 (kalish241)
% 3.14/1.23 ? [v0: $i] : ($i(v0) & f(v0) & ~ g(v0) & ! [v1: $i] : ( ~ $i(v1) | ~ h(v1)
% 3.14/1.23 | ~ f(v1)) & ! [v1: $i] : ( ~ $i(v1) | ~ f(v1) | h(v1) | g(v1)))
% 3.14/1.23
% 3.14/1.23 Those formulas are unsatisfiable:
% 3.14/1.23 ---------------------------------
% 3.14/1.23
% 3.14/1.23 Begin of proof
% 3.14/1.23 |
% 3.14/1.23 | DELTA: instantiating (kalish241) with fresh symbol all_2_0 gives:
% 3.14/1.24 | (1) $i(all_2_0) & f(all_2_0) & ~ g(all_2_0) & ! [v0: $i] : ( ~ $i(v0) |
% 3.14/1.24 | ~ h(v0) | ~ f(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ f(v0) | h(v0) |
% 3.14/1.24 | g(v0))
% 3.14/1.24 |
% 3.14/1.24 | ALPHA: (1) implies:
% 3.14/1.24 | (2) ~ g(all_2_0)
% 3.14/1.24 | (3) f(all_2_0)
% 3.14/1.24 | (4) $i(all_2_0)
% 3.14/1.24 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ f(v0) | h(v0) | g(v0))
% 3.14/1.24 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ h(v0) | ~ f(v0))
% 3.14/1.24 |
% 3.14/1.24 | GROUND_INST: instantiating (5) with all_2_0, simplifying with (2), (3), (4)
% 3.14/1.24 | gives:
% 3.14/1.24 | (7) h(all_2_0)
% 3.14/1.24 |
% 3.14/1.24 | GROUND_INST: instantiating (6) with all_2_0, simplifying with (3), (4), (7)
% 3.14/1.24 | gives:
% 3.14/1.24 | (8) $false
% 3.14/1.24 |
% 3.14/1.24 | CLOSE: (8) is inconsistent.
% 3.14/1.24 |
% 3.14/1.24 End of proof
% 3.14/1.24 % SZS output end Proof for theBenchmark
% 3.14/1.24
% 3.14/1.24 621ms
%------------------------------------------------------------------------------