TSTP Solution File: SYN376+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n003.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:25 EDT 2023
% Result : Theorem 2.86s 1.13s
% Output : Proof 3.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN376+1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n003.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 : 300
% 0.12/0.34 % DateTime : Sat Aug 26 18:39:39 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.60 ________ _____
% 0.19/0.60 ___ __ \_________(_)________________________________
% 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.69/0.94 Prover 1: Preprocessing ...
% 1.69/0.95 Prover 4: Preprocessing ...
% 1.99/0.98 Prover 6: Preprocessing ...
% 1.99/0.98 Prover 0: Preprocessing ...
% 1.99/0.98 Prover 3: Preprocessing ...
% 1.99/0.98 Prover 2: Preprocessing ...
% 1.99/0.98 Prover 5: Preprocessing ...
% 2.59/1.05 Prover 3: Constructing countermodel ...
% 2.59/1.05 Prover 4: Constructing countermodel ...
% 2.59/1.05 Prover 2: Proving ...
% 2.59/1.05 Prover 5: Proving ...
% 2.59/1.05 Prover 6: Proving ...
% 2.59/1.05 Prover 1: Constructing countermodel ...
% 2.59/1.05 Prover 0: Proving ...
% 2.86/1.13 Prover 3: proved (500ms)
% 2.86/1.13
% 2.86/1.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.86/1.13
% 2.86/1.13 Prover 5: stopped
% 2.86/1.14 Prover 6: stopped
% 2.86/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.86/1.14 Prover 2: stopped
% 3.26/1.16 Prover 0: proved (512ms)
% 3.26/1.16
% 3.26/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.16
% 3.26/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.26/1.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.26/1.16 Prover 7: Preprocessing ...
% 3.26/1.16 Prover 7: Warning: ignoring some quantifiers
% 3.26/1.16 Prover 7: Constructing countermodel ...
% 3.26/1.16 Prover 8: Preprocessing ...
% 3.26/1.16 Prover 10: Preprocessing ...
% 3.26/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.26/1.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.26/1.17 Prover 4: Found proof (size 9)
% 3.26/1.17 Prover 4: proved (534ms)
% 3.26/1.17 Prover 1: Found proof (size 14)
% 3.26/1.17 Prover 1: proved (543ms)
% 3.26/1.17 Prover 7: stopped
% 3.26/1.17 Prover 11: Preprocessing ...
% 3.26/1.17 Prover 13: Preprocessing ...
% 3.26/1.18 Prover 8: Warning: ignoring some quantifiers
% 3.26/1.18 Prover 8: Constructing countermodel ...
% 3.26/1.18 Prover 10: Warning: ignoring some quantifiers
% 3.26/1.18 Prover 13: Warning: ignoring some quantifiers
% 3.26/1.18 Prover 8: stopped
% 3.26/1.18 Prover 13: Constructing countermodel ...
% 3.26/1.18 Prover 13: stopped
% 3.26/1.18 Prover 10: Constructing countermodel ...
% 3.26/1.19 Prover 10: stopped
% 3.26/1.20 Prover 11: Constructing countermodel ...
% 3.26/1.20 Prover 11: stopped
% 3.26/1.20
% 3.26/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.20
% 3.53/1.20 % SZS output start Proof for theBenchmark
% 3.53/1.20 Assumptions after simplification:
% 3.53/1.20 ---------------------------------
% 3.53/1.21
% 3.53/1.21 (x2127)
% 3.53/1.24 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ? [v3: $i] : ? [v4: any] : ( ~
% 3.53/1.24 (v2 = 0) & big_p(v3) = v4 & big_p(v1) = v2 & big_p(v0) = 0 & $i(v3) & $i(v1)
% 3.53/1.24 & $i(v0) & ! [v5: $i] : ! [v6: int] : ( ~ (v4 = 0) | v6 = 0 | ~
% 3.53/1.24 (big_p(v5) = v6) | ~ $i(v5)) & ! [v5: $i] : (v4 = 0 | ~ (big_p(v5) = 0)
% 3.53/1.24 | ~ $i(v5)))
% 3.53/1.24
% 3.53/1.24 Those formulas are unsatisfiable:
% 3.53/1.24 ---------------------------------
% 3.53/1.24
% 3.53/1.24 Begin of proof
% 3.53/1.24 |
% 3.53/1.25 | DELTA: instantiating (x2127) with fresh symbols all_3_0, all_3_1, all_3_2,
% 3.53/1.25 | all_3_3, all_3_4 gives:
% 3.53/1.25 | (1) ~ (all_3_2 = 0) & big_p(all_3_1) = all_3_0 & big_p(all_3_3) = all_3_2
% 3.53/1.25 | & big_p(all_3_4) = 0 & $i(all_3_1) & $i(all_3_3) & $i(all_3_4) & !
% 3.53/1.25 | [v0: $i] : ! [v1: int] : ( ~ (all_3_0 = 0) | v1 = 0 | ~ (big_p(v0) =
% 3.53/1.25 | v1) | ~ $i(v0)) & ! [v0: $i] : (all_3_0 = 0 | ~ (big_p(v0) = 0)
% 3.53/1.25 | | ~ $i(v0))
% 3.53/1.25 |
% 3.53/1.25 | ALPHA: (1) implies:
% 3.53/1.25 | (2) ~ (all_3_2 = 0)
% 3.53/1.25 | (3) $i(all_3_4)
% 3.53/1.25 | (4) $i(all_3_3)
% 3.53/1.25 | (5) big_p(all_3_4) = 0
% 3.53/1.25 | (6) big_p(all_3_3) = all_3_2
% 3.53/1.25 | (7) ! [v0: $i] : (all_3_0 = 0 | ~ (big_p(v0) = 0) | ~ $i(v0))
% 3.53/1.26 | (8) ! [v0: $i] : ! [v1: int] : ( ~ (all_3_0 = 0) | v1 = 0 | ~ (big_p(v0)
% 3.53/1.26 | = v1) | ~ $i(v0))
% 3.53/1.26 |
% 3.53/1.26 | GROUND_INST: instantiating (7) with all_3_4, simplifying with (3), (5) gives:
% 3.53/1.26 | (9) all_3_0 = 0
% 3.53/1.26 |
% 3.53/1.26 | GROUND_INST: instantiating (8) with all_3_3, all_3_2, simplifying with (4),
% 3.53/1.26 | (6) gives:
% 3.53/1.26 | (10) ~ (all_3_0 = 0) | all_3_2 = 0
% 3.53/1.26 |
% 3.53/1.26 | BETA: splitting (10) gives:
% 3.53/1.26 |
% 3.53/1.26 | Case 1:
% 3.53/1.26 | |
% 3.53/1.26 | | (11) ~ (all_3_0 = 0)
% 3.53/1.26 | |
% 3.53/1.26 | | REDUCE: (9), (11) imply:
% 3.53/1.26 | | (12) $false
% 3.53/1.26 | |
% 3.53/1.26 | | CLOSE: (12) is inconsistent.
% 3.53/1.26 | |
% 3.53/1.26 | Case 2:
% 3.53/1.26 | |
% 3.53/1.26 | | (13) all_3_2 = 0
% 3.53/1.26 | |
% 3.53/1.26 | | REDUCE: (2), (13) imply:
% 3.53/1.26 | | (14) $false
% 3.53/1.26 | |
% 3.53/1.26 | | CLOSE: (14) is inconsistent.
% 3.53/1.26 | |
% 3.53/1.26 | End of split
% 3.53/1.26 |
% 3.53/1.26 End of proof
% 3.53/1.26 % SZS output end Proof for theBenchmark
% 3.53/1.26
% 3.53/1.26 654ms
%------------------------------------------------------------------------------