TSTP Solution File: DAT334_23 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n021.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 : Wed Aug 30 22:19:45 EDT 2023
% Result : Theorem 4.11s 1.25s
% Output : Proof 4.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n021.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 : Thu Aug 24 14:49:25 EDT 2023
% 0.13/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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 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 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 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 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
% 2.05/0.99 Prover 1: Preprocessing ...
% 2.05/0.99 Prover 4: Preprocessing ...
% 2.05/1.04 Prover 5: Preprocessing ...
% 2.05/1.04 Prover 3: Preprocessing ...
% 2.05/1.04 Prover 2: Preprocessing ...
% 2.05/1.04 Prover 0: Preprocessing ...
% 2.05/1.04 Prover 6: Preprocessing ...
% 3.04/1.14 Prover 2: Proving ...
% 3.04/1.14 Prover 5: Proving ...
% 3.04/1.14 Prover 1: Warning: ignoring some quantifiers
% 3.40/1.15 Prover 3: Warning: ignoring some quantifiers
% 3.40/1.16 Prover 1: Constructing countermodel ...
% 3.40/1.16 Prover 3: Constructing countermodel ...
% 3.40/1.16 Prover 6: Proving ...
% 3.40/1.19 Prover 4: Warning: ignoring some quantifiers
% 3.40/1.20 Prover 4: Constructing countermodel ...
% 3.40/1.21 Prover 0: Proving ...
% 3.40/1.25 Prover 2: proved (608ms)
% 4.11/1.25
% 4.11/1.25 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.11/1.25
% 4.11/1.25 Prover 5: proved (609ms)
% 4.11/1.25
% 4.11/1.25 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.11/1.25
% 4.11/1.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.11/1.25 Prover 0: stopped
% 4.11/1.26 Prover 3: stopped
% 4.11/1.26 Prover 6: stopped
% 4.11/1.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.11/1.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.11/1.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.11/1.26 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.11/1.27 Prover 1: gave up
% 4.11/1.28 Prover 10: Preprocessing ...
% 4.11/1.28 Prover 11: Preprocessing ...
% 4.11/1.28 Prover 8: Preprocessing ...
% 4.11/1.28 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 4.11/1.29 Prover 13: Preprocessing ...
% 4.11/1.29 Prover 7: Preprocessing ...
% 4.48/1.30 Prover 16: Preprocessing ...
% 4.48/1.30 Prover 10: Warning: ignoring some quantifiers
% 4.48/1.31 Prover 7: Warning: ignoring some quantifiers
% 4.48/1.32 Prover 7: Constructing countermodel ...
% 4.48/1.32 Prover 10: Constructing countermodel ...
% 4.48/1.32 Prover 13: Warning: ignoring some quantifiers
% 4.48/1.32 Prover 13: Constructing countermodel ...
% 4.48/1.33 Prover 8: Warning: ignoring some quantifiers
% 4.48/1.33 Prover 8: Constructing countermodel ...
% 4.48/1.33 Prover 16: Warning: ignoring some quantifiers
% 4.48/1.34 Prover 16: Constructing countermodel ...
% 4.84/1.37 Prover 10: Found proof (size 9)
% 4.84/1.37 Prover 10: proved (110ms)
% 4.84/1.37 Prover 7: Found proof (size 9)
% 4.84/1.37 Prover 7: proved (117ms)
% 4.84/1.37 Prover 13: Found proof (size 9)
% 4.84/1.37 Prover 13: proved (109ms)
% 4.84/1.37 Prover 4: stopped
% 4.84/1.37 Prover 11: Warning: ignoring some quantifiers
% 4.84/1.37 Prover 8: stopped
% 4.84/1.37 Prover 16: stopped
% 4.84/1.38 Prover 11: Constructing countermodel ...
% 4.84/1.38 Prover 11: stopped
% 4.84/1.38
% 4.84/1.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.84/1.38
% 4.84/1.38 % SZS output start Proof for theBenchmark
% 4.84/1.39 Assumptions after simplification:
% 4.84/1.39 ---------------------------------
% 4.84/1.39
% 4.84/1.39 (db)
% 4.84/1.39 $ki_world($ki_local_world) & $i(psych) & $i(math) & $i(john) & $i(mary) &
% 4.84/1.39 $i(sue) & $i(cs) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~
% 4.84/1.39 $ki_accessible($ki_local_world, v0) | teach(v0, john, math)) & ! [v0:
% 4.84/1.39 $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) |
% 4.84/1.39 teach(v0, mary, psych)) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~
% 4.84/1.39 $ki_accessible($ki_local_world, v0) | teach(v0, sue, psych)) & ! [v0:
% 4.84/1.39 $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible($ki_local_world, v0) | ?
% 4.84/1.39 [v1: $i] : ($i(v1) & $ki_exists_in_world_$i(v0, v1) & teach(v0, v1, cs)))
% 4.84/1.39
% 4.84/1.39 (verify)
% 4.84/1.40 $ki_world($ki_local_world) & $i(cs) & ? [v0: $ki_world] : ($ki_world(v0) &
% 4.84/1.40 $ki_accessible($ki_local_world, v0) & ! [v1: $i] : ( ~ $i(v1) | ~
% 4.84/1.40 $ki_exists_in_world_$i(v0, v1) | ~ teach(v0, v1, cs)))
% 4.84/1.40
% 4.84/1.40 Further assumptions not needed in the proof:
% 4.84/1.40 --------------------------------------------
% 4.84/1.40 $ki_exists_in_world_$i_const, $ki_exists_in_world_$i_nonempty, mrel_universal
% 4.84/1.40
% 4.84/1.40 Those formulas are unsatisfiable:
% 4.84/1.40 ---------------------------------
% 4.84/1.40
% 4.84/1.40 Begin of proof
% 4.84/1.40 |
% 4.84/1.40 | ALPHA: (verify) implies:
% 4.84/1.40 | (1) ? [v0: $ki_world] : ($ki_world(v0) & $ki_accessible($ki_local_world,
% 4.84/1.40 | v0) & ! [v1: $i] : ( ~ $i(v1) | ~ $ki_exists_in_world_$i(v0, v1)
% 4.84/1.40 | | ~ teach(v0, v1, cs)))
% 4.84/1.40 |
% 4.84/1.40 | ALPHA: (db) implies:
% 4.84/1.40 | (2) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~
% 4.84/1.40 | $ki_accessible($ki_local_world, v0) | ? [v1: $i] : ($i(v1) &
% 4.84/1.40 | $ki_exists_in_world_$i(v0, v1) & teach(v0, v1, cs)))
% 4.84/1.40 |
% 4.84/1.40 | DELTA: instantiating (1) with fresh symbol all_9_0 gives:
% 4.84/1.40 | (3) $ki_world(all_9_0) & $ki_accessible($ki_local_world, all_9_0) & ! [v0:
% 4.84/1.40 | $i] : ( ~ $i(v0) | ~ $ki_exists_in_world_$i(all_9_0, v0) | ~
% 4.84/1.40 | teach(all_9_0, v0, cs))
% 4.84/1.40 |
% 4.84/1.40 | ALPHA: (3) implies:
% 4.84/1.40 | (4) $ki_accessible($ki_local_world, all_9_0)
% 4.84/1.40 | (5) $ki_world(all_9_0)
% 4.84/1.40 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ $ki_exists_in_world_$i(all_9_0, v0) | ~
% 4.84/1.41 | teach(all_9_0, v0, cs))
% 4.84/1.41 |
% 4.84/1.41 | GROUND_INST: instantiating (2) with all_9_0, simplifying with (4), (5) gives:
% 4.84/1.41 | (7) ? [v0: $i] : ($i(v0) & $ki_exists_in_world_$i(all_9_0, v0) &
% 4.84/1.41 | teach(all_9_0, v0, cs))
% 4.84/1.41 |
% 4.84/1.41 | DELTA: instantiating (7) with fresh symbol all_18_0 gives:
% 4.84/1.41 | (8) $i(all_18_0) & $ki_exists_in_world_$i(all_9_0, all_18_0) &
% 4.84/1.41 | teach(all_9_0, all_18_0, cs)
% 4.84/1.41 |
% 4.84/1.41 | ALPHA: (8) implies:
% 4.84/1.41 | (9) teach(all_9_0, all_18_0, cs)
% 4.84/1.41 | (10) $ki_exists_in_world_$i(all_9_0, all_18_0)
% 4.84/1.41 | (11) $i(all_18_0)
% 4.84/1.41 |
% 4.84/1.41 | GROUND_INST: instantiating (6) with all_18_0, simplifying with (9), (10), (11)
% 4.84/1.41 | gives:
% 4.84/1.41 | (12) $false
% 4.84/1.41 |
% 4.84/1.41 | CLOSE: (12) is inconsistent.
% 4.84/1.41 |
% 4.84/1.41 End of proof
% 4.84/1.41 % SZS output end Proof for theBenchmark
% 4.84/1.41
% 4.84/1.41 788ms
%------------------------------------------------------------------------------