TSTP Solution File: LCL646+1.001 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.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 : Thu Aug 31 08:11:58 EDT 2023
% Result : Theorem 3.92s 1.22s
% Output : Proof 4.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 00:53:23 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/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.13/0.96 Prover 1: Preprocessing ...
% 2.13/0.96 Prover 4: Preprocessing ...
% 2.13/1.01 Prover 5: Preprocessing ...
% 2.13/1.01 Prover 6: Preprocessing ...
% 2.13/1.01 Prover 3: Preprocessing ...
% 2.13/1.01 Prover 2: Preprocessing ...
% 2.13/1.01 Prover 0: Preprocessing ...
% 3.01/1.10 Prover 2: Constructing countermodel ...
% 3.01/1.11 Prover 5: Constructing countermodel ...
% 3.01/1.14 Prover 6: Proving ...
% 3.47/1.15 Prover 1: Constructing countermodel ...
% 3.47/1.15 Prover 3: Constructing countermodel ...
% 3.57/1.17 Prover 0: Proving ...
% 3.57/1.17 Prover 4: Constructing countermodel ...
% 3.92/1.21 Prover 5: proved (583ms)
% 3.92/1.21 Prover 3: proved (585ms)
% 3.92/1.22
% 3.92/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.22
% 3.92/1.22
% 3.92/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.22
% 3.92/1.22 Prover 2: proved (588ms)
% 3.92/1.22
% 3.92/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.22
% 3.92/1.22 Prover 0: stopped
% 3.92/1.23 Prover 6: stopped
% 3.92/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.92/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.92/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.92/1.23 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.92/1.23 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.92/1.24 Prover 8: Preprocessing ...
% 4.19/1.26 Prover 10: Preprocessing ...
% 4.19/1.26 Prover 13: Preprocessing ...
% 4.19/1.26 Prover 11: Preprocessing ...
% 4.19/1.26 Prover 7: Preprocessing ...
% 4.19/1.27 Prover 10: Constructing countermodel ...
% 4.19/1.28 Prover 7: Constructing countermodel ...
% 4.19/1.28 Prover 13: Constructing countermodel ...
% 4.19/1.30 Prover 8: Warning: ignoring some quantifiers
% 4.19/1.30 Prover 8: Constructing countermodel ...
% 4.19/1.31 Prover 10: Found proof (size 4)
% 4.19/1.31 Prover 10: proved (89ms)
% 4.19/1.31 Prover 7: Found proof (size 4)
% 4.19/1.31 Prover 7: proved (90ms)
% 4.19/1.31 Prover 13: stopped
% 4.19/1.31 Prover 8: stopped
% 4.19/1.31 Prover 4: stopped
% 4.19/1.32 Prover 1: stopped
% 4.19/1.34 Prover 11: Constructing countermodel ...
% 4.19/1.34 Prover 11: stopped
% 4.19/1.34
% 4.19/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.19/1.34
% 4.19/1.34 % SZS output start Proof for theBenchmark
% 4.19/1.34 Assumptions after simplification:
% 4.19/1.34 ---------------------------------
% 4.19/1.35
% 4.19/1.35 (main)
% 4.19/1.35 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ($i(v4)
% 4.19/1.35 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & r1(v0, v4) & r1(v0, v3) & r1(v0, v2) &
% 4.19/1.35 r1(v0, v1) & ~ p1(v1) & ~ p3(v3) & ~ p5(v4) & ~ p2(v2) & ! [v5: $i] : (
% 4.19/1.35 ~ $i(v5) | ~ r1(v0, v5) | p4(v5)) & ! [v5: $i] : ( ~ $i(v5) | ~ r1(v0,
% 4.19/1.35 v5) | p2(v5)) & ! [v5: $i] : ( ~ $i(v5) | ~ r1(v0, v5) | p6(v5)))
% 4.19/1.35
% 4.19/1.35 Those formulas are unsatisfiable:
% 4.19/1.35 ---------------------------------
% 4.19/1.35
% 4.19/1.35 Begin of proof
% 4.19/1.36 |
% 4.19/1.36 | DELTA: instantiating (main) with fresh symbols all_2_0, all_2_1, all_2_2,
% 4.19/1.36 | all_2_3, all_2_4 gives:
% 4.19/1.36 | (1) $i(all_2_0) & $i(all_2_1) & $i(all_2_2) & $i(all_2_3) & $i(all_2_4) &
% 4.19/1.36 | r1(all_2_4, all_2_0) & r1(all_2_4, all_2_1) & r1(all_2_4, all_2_2) &
% 4.19/1.36 | r1(all_2_4, all_2_3) & ~ p1(all_2_3) & ~ p3(all_2_1) & ~ p5(all_2_0)
% 4.19/1.36 | & ~ p2(all_2_2) & ! [v0: $i] : ( ~ $i(v0) | ~ r1(all_2_4, v0) |
% 4.19/1.36 | p4(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ r1(all_2_4, v0) | p2(v0)) &
% 4.19/1.36 | ! [v0: $i] : ( ~ $i(v0) | ~ r1(all_2_4, v0) | p6(v0))
% 4.19/1.36 |
% 4.19/1.36 | ALPHA: (1) implies:
% 4.19/1.36 | (2) ~ p2(all_2_2)
% 4.19/1.36 | (3) r1(all_2_4, all_2_2)
% 4.19/1.36 | (4) $i(all_2_2)
% 4.19/1.36 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ r1(all_2_4, v0) | p2(v0))
% 4.19/1.36 |
% 4.19/1.37 | GROUND_INST: instantiating (5) with all_2_2, simplifying with (2), (3), (4)
% 4.19/1.37 | gives:
% 4.19/1.37 | (6) $false
% 4.19/1.37 |
% 4.19/1.37 | CLOSE: (6) is inconsistent.
% 4.19/1.37 |
% 4.19/1.37 End of proof
% 4.19/1.37 % SZS output end Proof for theBenchmark
% 4.19/1.37
% 4.19/1.37 759ms
%------------------------------------------------------------------------------