TSTP Solution File: SWB002+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n015.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 : Thu Aug 31 20:11:32 EDT 2023
% Result : Theorem 2.51s 1.12s
% Output : Proof 3.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB002+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n015.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.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 07:39:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.64/0.93 Prover 1: Preprocessing ...
% 1.64/0.93 Prover 4: Preprocessing ...
% 2.04/0.98 Prover 5: Preprocessing ...
% 2.04/0.98 Prover 6: Preprocessing ...
% 2.04/0.98 Prover 2: Preprocessing ...
% 2.04/0.98 Prover 0: Preprocessing ...
% 2.04/0.98 Prover 3: Preprocessing ...
% 2.27/1.04 Prover 2: Constructing countermodel ...
% 2.27/1.04 Prover 4: Constructing countermodel ...
% 2.51/1.04 Prover 1: Constructing countermodel ...
% 2.51/1.04 Prover 3: Constructing countermodel ...
% 2.51/1.04 Prover 5: Constructing countermodel ...
% 2.51/1.04 Prover 6: Proving ...
% 2.51/1.05 Prover 0: Proving ...
% 2.51/1.12 Prover 2: proved (486ms)
% 2.51/1.12 Prover 5: proved (480ms)
% 2.51/1.12
% 2.51/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.51/1.12
% 2.51/1.12
% 2.51/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.51/1.12
% 2.51/1.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.51/1.12 Prover 0: stopped
% 2.51/1.13 Prover 6: stopped
% 2.51/1.13 Prover 3: stopped
% 3.03/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.03/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.03/1.14 Prover 7: Preprocessing ...
% 3.03/1.14 Prover 8: Preprocessing ...
% 3.03/1.14 Prover 11: Preprocessing ...
% 3.03/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.03/1.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.03/1.15 Prover 7: Constructing countermodel ...
% 3.03/1.15 Prover 10: Preprocessing ...
% 3.03/1.16 Prover 13: Preprocessing ...
% 3.03/1.17 Prover 11: Constructing countermodel ...
% 3.03/1.17 Prover 8: Warning: ignoring some quantifiers
% 3.03/1.17 Prover 10: Constructing countermodel ...
% 3.03/1.17 Prover 8: Constructing countermodel ...
% 3.03/1.17 Prover 13: Constructing countermodel ...
% 3.03/1.18 Prover 1: Found proof (size 10)
% 3.03/1.18 Prover 1: proved (559ms)
% 3.03/1.19 Prover 13: stopped
% 3.03/1.19 Prover 8: stopped
% 3.03/1.19 Prover 11: stopped
% 3.03/1.19 Prover 10: Found proof (size 6)
% 3.03/1.19 Prover 7: Found proof (size 6)
% 3.03/1.19 Prover 10: proved (43ms)
% 3.03/1.19 Prover 4: Found proof (size 10)
% 3.03/1.19 Prover 7: proved (66ms)
% 3.03/1.19 Prover 4: proved (552ms)
% 3.03/1.19
% 3.03/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/1.19
% 3.39/1.19 % SZS output start Proof for theBenchmark
% 3.39/1.19 Assumptions after simplification:
% 3.39/1.19 ---------------------------------
% 3.39/1.19
% 3.39/1.19 (testcase_conclusion_fullish_002_Existential_Blank_Nodes)
% 3.39/1.23 $i(uri_ex_q) & $i(uri_ex_p) & ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q,
% 3.39/1.23 v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) &
% 3.39/1.23 iext(uri_ex_p, v0, v1) = v2))
% 3.39/1.23
% 3.39/1.23 (testcase_premise_fullish_002_Existential_Blank_Nodes)
% 3.39/1.23 $i(uri_ex_s) & $i(uri_ex_q) & $i(uri_ex_p) & ? [v0: $i] : (iext(uri_ex_q, v0,
% 3.39/1.23 uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0))
% 3.39/1.23
% 3.39/1.23 (function-axioms)
% 3.39/1.24 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 3.39/1.24 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4,
% 3.39/1.24 v3, v2) = v0))
% 3.39/1.24
% 3.39/1.24 Those formulas are unsatisfiable:
% 3.39/1.24 ---------------------------------
% 3.39/1.24
% 3.39/1.24 Begin of proof
% 3.39/1.24 |
% 3.39/1.24 | ALPHA: (testcase_premise_fullish_002_Existential_Blank_Nodes) implies:
% 3.39/1.24 | (1) $i(uri_ex_s)
% 3.39/1.24 | (2) ? [v0: $i] : (iext(uri_ex_q, v0, uri_ex_s) = 0 & iext(uri_ex_p,
% 3.39/1.24 | uri_ex_s, v0) = 0 & $i(v0))
% 3.39/1.24 |
% 3.39/1.24 | ALPHA: (testcase_conclusion_fullish_002_Existential_Blank_Nodes) implies:
% 3.39/1.24 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q, v1, v0) = 0) | ~
% 3.39/1.24 | $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & iext(uri_ex_p, v0,
% 3.39/1.24 | v1) = v2))
% 3.39/1.24 |
% 3.39/1.24 | DELTA: instantiating (2) with fresh symbol all_5_0 gives:
% 3.39/1.25 | (4) iext(uri_ex_q, all_5_0, uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s,
% 3.39/1.25 | all_5_0) = 0 & $i(all_5_0)
% 3.39/1.25 |
% 3.39/1.25 | ALPHA: (4) implies:
% 3.39/1.25 | (5) $i(all_5_0)
% 3.39/1.25 | (6) iext(uri_ex_p, uri_ex_s, all_5_0) = 0
% 3.39/1.25 | (7) iext(uri_ex_q, all_5_0, uri_ex_s) = 0
% 3.39/1.25 |
% 3.39/1.25 | GROUND_INST: instantiating (3) with uri_ex_s, all_5_0, simplifying with (1),
% 3.39/1.25 | (5), (7) gives:
% 3.39/1.25 | (8) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_ex_p, uri_ex_s, all_5_0) = v0)
% 3.39/1.25 |
% 3.39/1.25 | DELTA: instantiating (8) with fresh symbol all_12_0 gives:
% 3.39/1.25 | (9) ~ (all_12_0 = 0) & iext(uri_ex_p, uri_ex_s, all_5_0) = all_12_0
% 3.39/1.25 |
% 3.39/1.25 | ALPHA: (9) implies:
% 3.39/1.25 | (10) ~ (all_12_0 = 0)
% 3.39/1.25 | (11) iext(uri_ex_p, uri_ex_s, all_5_0) = all_12_0
% 3.39/1.25 |
% 3.58/1.25 | GROUND_INST: instantiating (function-axioms) with 0, all_12_0, all_5_0,
% 3.58/1.25 | uri_ex_s, uri_ex_p, simplifying with (6), (11) gives:
% 3.58/1.25 | (12) all_12_0 = 0
% 3.58/1.25 |
% 3.58/1.25 | REDUCE: (10), (12) imply:
% 3.58/1.25 | (13) $false
% 3.58/1.25 |
% 3.58/1.25 | CLOSE: (13) is inconsistent.
% 3.58/1.25 |
% 3.58/1.25 End of proof
% 3.58/1.25 % SZS output end Proof for theBenchmark
% 3.58/1.25
% 3.58/1.25 644ms
%------------------------------------------------------------------------------