TSTP Solution File: SYN412+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN412+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 : n026.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:35 EDT 2023
% Result : Theorem 2.72s 1.14s
% Output : Proof 3.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN412+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.34 % CPULimit : 300
% 0.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Sat Aug 26 17:29:33 EDT 2023
% 0.20/0.34 % 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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.63/0.95 Prover 1: Preprocessing ...
% 1.63/0.95 Prover 4: Preprocessing ...
% 1.63/0.99 Prover 6: Preprocessing ...
% 1.63/0.99 Prover 2: Preprocessing ...
% 1.63/0.99 Prover 0: Preprocessing ...
% 1.63/0.99 Prover 3: Preprocessing ...
% 1.63/0.99 Prover 5: Preprocessing ...
% 2.20/1.05 Prover 6: Proving ...
% 2.20/1.05 Prover 5: Proving ...
% 2.20/1.05 Prover 2: Proving ...
% 2.20/1.05 Prover 4: Constructing countermodel ...
% 2.20/1.06 Prover 3: Constructing countermodel ...
% 2.20/1.06 Prover 0: Proving ...
% 2.20/1.06 Prover 1: Constructing countermodel ...
% 2.72/1.14 Prover 3: proved (488ms)
% 2.72/1.14
% 2.72/1.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/1.14
% 2.72/1.14 Prover 5: stopped
% 2.72/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.72/1.14 Prover 6: stopped
% 2.72/1.15 Prover 2: stopped
% 2.72/1.15 Prover 0: stopped
% 2.72/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.72/1.16 Prover 7: Preprocessing ...
% 2.72/1.16 Prover 8: Preprocessing ...
% 2.72/1.16 Prover 7: Warning: ignoring some quantifiers
% 2.72/1.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.72/1.16 Prover 7: Constructing countermodel ...
% 2.72/1.16 Prover 1: Found proof (size 7)
% 2.72/1.16 Prover 4: Found proof (size 7)
% 2.72/1.16 Prover 1: proved (516ms)
% 2.72/1.16 Prover 4: proved (507ms)
% 2.72/1.16 Prover 7: stopped
% 2.72/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.72/1.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.72/1.16 Prover 11: Preprocessing ...
% 2.72/1.17 Prover 13: Preprocessing ...
% 2.72/1.17 Prover 8: Warning: ignoring some quantifiers
% 2.72/1.17 Prover 8: Constructing countermodel ...
% 2.72/1.17 Prover 8: stopped
% 2.72/1.17 Prover 10: Preprocessing ...
% 2.72/1.17 Prover 13: Warning: ignoring some quantifiers
% 2.72/1.18 Prover 13: Constructing countermodel ...
% 2.72/1.18 Prover 13: stopped
% 2.72/1.18 Prover 10: Warning: ignoring some quantifiers
% 2.72/1.18 Prover 10: Constructing countermodel ...
% 2.72/1.18 Prover 11: Constructing countermodel ...
% 2.72/1.18 Prover 10: stopped
% 2.72/1.18 Prover 11: stopped
% 2.72/1.18
% 2.72/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/1.18
% 2.72/1.19 % SZS output start Proof for theBenchmark
% 2.72/1.19 Assumptions after simplification:
% 2.72/1.19 ---------------------------------
% 2.72/1.19
% 2.72/1.19 (kalish255)
% 3.36/1.23 ? [v0: $i] : ? [v1: any] : (f(v0, v0) = v1 & $i(v0) & ! [v2: $i] : ! [v3:
% 3.36/1.23 int] : (v3 = 0 | v1 = 0 | ~ (f(v0, v2) = v3) | ~ $i(v2)) & ! [v2: $i] :
% 3.36/1.23 ( ~ (v1 = 0) | ~ (f(v0, v2) = 0) | ~ $i(v2)))
% 3.36/1.23
% 3.36/1.23 Those formulas are unsatisfiable:
% 3.36/1.23 ---------------------------------
% 3.36/1.23
% 3.36/1.23 Begin of proof
% 3.36/1.23 |
% 3.36/1.23 | DELTA: instantiating (kalish255) with fresh symbols all_3_0, all_3_1 gives:
% 3.36/1.23 | (1) f(all_3_1, all_3_1) = all_3_0 & $i(all_3_1) & ! [v0: $i] : ! [v1:
% 3.36/1.23 | int] : (v1 = 0 | all_3_0 = 0 | ~ (f(all_3_1, v0) = v1) | ~ $i(v0))
% 3.36/1.23 | & ! [v0: $i] : ( ~ (all_3_0 = 0) | ~ (f(all_3_1, v0) = 0) | ~
% 3.36/1.23 | $i(v0))
% 3.36/1.23 |
% 3.36/1.23 | ALPHA: (1) implies:
% 3.36/1.23 | (2) $i(all_3_1)
% 3.36/1.24 | (3) f(all_3_1, all_3_1) = all_3_0
% 3.36/1.24 | (4) ! [v0: $i] : ( ~ (all_3_0 = 0) | ~ (f(all_3_1, v0) = 0) | ~ $i(v0))
% 3.36/1.24 | (5) ! [v0: $i] : ! [v1: int] : (v1 = 0 | all_3_0 = 0 | ~ (f(all_3_1, v0)
% 3.36/1.24 | = v1) | ~ $i(v0))
% 3.36/1.24 |
% 3.36/1.24 | GROUND_INST: instantiating (5) with all_3_1, all_3_0, simplifying with (2),
% 3.36/1.24 | (3) gives:
% 3.36/1.24 | (6) all_3_0 = 0
% 3.36/1.24 |
% 3.36/1.24 | REDUCE: (3), (6) imply:
% 3.36/1.24 | (7) f(all_3_1, all_3_1) = 0
% 3.36/1.24 |
% 3.36/1.24 | GROUND_INST: instantiating (4) with all_3_1, simplifying with (2), (7) gives:
% 3.36/1.24 | (8) ~ (all_3_0 = 0)
% 3.36/1.24 |
% 3.36/1.24 | REDUCE: (6), (8) imply:
% 3.36/1.24 | (9) $false
% 3.36/1.24 |
% 3.36/1.24 | CLOSE: (9) is inconsistent.
% 3.36/1.24 |
% 3.36/1.24 End of proof
% 3.36/1.24 % SZS output end Proof for theBenchmark
% 3.36/1.24
% 3.36/1.24 618ms
%------------------------------------------------------------------------------