TSTP Solution File: LCL682+1.001 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LCL682+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 : n027.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:12:27 EDT 2023
% Result : Theorem 4.95s 1.42s
% Output : Proof 5.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL682+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 19:23:48 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.60 ________ _____
% 0.21/0.60 ___ __ \_________(_)________________________________
% 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.60
% 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.60 (2023-06-19)
% 0.21/0.60
% 0.21/0.60 (c) Philipp Rümmer, 2009-2023
% 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.60 Amanda Stjerna.
% 0.21/0.60 Free software under BSD-3-Clause.
% 0.21/0.60
% 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.60
% 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.63 Running up to 7 provers in parallel.
% 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.39/1.04 Prover 4: Preprocessing ...
% 2.39/1.04 Prover 1: Preprocessing ...
% 2.39/1.08 Prover 2: Preprocessing ...
% 2.39/1.08 Prover 6: Preprocessing ...
% 2.39/1.08 Prover 5: Preprocessing ...
% 2.39/1.08 Prover 0: Preprocessing ...
% 2.39/1.08 Prover 3: Preprocessing ...
% 3.35/1.22 Prover 5: Proving ...
% 3.35/1.23 Prover 2: Proving ...
% 3.86/1.28 Prover 6: Proving ...
% 3.86/1.29 Prover 1: Constructing countermodel ...
% 3.86/1.30 Prover 3: Constructing countermodel ...
% 3.86/1.30 Prover 0: Proving ...
% 3.86/1.32 Prover 4: Constructing countermodel ...
% 4.95/1.42 Prover 0: proved (783ms)
% 4.95/1.42
% 4.95/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.95/1.42
% 4.95/1.42 Prover 6: stopped
% 4.95/1.42 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.95/1.43 Prover 2: stopped
% 4.95/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.95/1.43 Prover 5: stopped
% 4.95/1.43 Prover 3: stopped
% 4.95/1.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.95/1.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.95/1.43 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.95/1.45 Prover 7: Preprocessing ...
% 5.16/1.46 Prover 11: Preprocessing ...
% 5.16/1.46 Prover 13: Preprocessing ...
% 5.16/1.47 Prover 10: Preprocessing ...
% 5.16/1.47 Prover 8: Preprocessing ...
% 5.16/1.47 Prover 7: Warning: ignoring some quantifiers
% 5.16/1.47 Prover 7: Constructing countermodel ...
% 5.16/1.47 Prover 13: Warning: ignoring some quantifiers
% 5.16/1.48 Prover 13: Constructing countermodel ...
% 5.16/1.48 Prover 10: Warning: ignoring some quantifiers
% 5.16/1.48 Prover 10: Constructing countermodel ...
% 5.16/1.51 Prover 13: Found proof (size 4)
% 5.16/1.51 Prover 13: proved (83ms)
% 5.16/1.51 Prover 4: stopped
% 5.16/1.52 Prover 1: stopped
% 5.16/1.52 Prover 7: stopped
% 5.16/1.52 Prover 10: Found proof (size 4)
% 5.16/1.52 Prover 10: proved (88ms)
% 5.69/1.54 Prover 8: Warning: ignoring some quantifiers
% 5.69/1.55 Prover 8: Constructing countermodel ...
% 5.69/1.55 Prover 11: Constructing countermodel ...
% 5.69/1.55 Prover 8: stopped
% 5.69/1.55 Prover 11: stopped
% 5.69/1.55
% 5.69/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.69/1.55
% 5.69/1.55 % SZS output start Proof for theBenchmark
% 5.69/1.56 Assumptions after simplification:
% 5.69/1.56 ---------------------------------
% 5.69/1.56
% 5.69/1.56 (main)
% 5.69/1.57 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 5.69/1.57 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v8) & $i(v7) & $i(v6) &
% 5.69/1.57 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & r1(v7, v8) & r1(v5,
% 5.69/1.57 v6) & r1(v3, v4) & r1(v1, v2) & r1(v0, v7) & r1(v0, v5) & r1(v0, v3) &
% 5.69/1.57 r1(v0, v1) & ~ p11(v2) & ~ p13(v6) & ~ p15(v8) & ~ p12(v4) & ! [v9: $i]
% 5.69/1.57 : ! [v10: $i] : ( ~ $i(v10) | ~ $i(v9) | ~ r1(v9, v10) | ~ r1(v0, v9) |
% 5.69/1.57 p14(v10)) & ! [v9: $i] : ! [v10: $i] : ( ~ $i(v10) | ~ $i(v9) | ~
% 5.69/1.57 r1(v9, v10) | ~ r1(v0, v9) | p12(v10)) & ! [v9: $i] : ! [v10: $i] : ( ~
% 5.69/1.57 $i(v10) | ~ $i(v9) | ~ r1(v9, v10) | ~ r1(v0, v9) | p16(v10)))
% 5.69/1.57
% 5.69/1.57 Further assumptions not needed in the proof:
% 5.69/1.57 --------------------------------------------
% 5.69/1.57 reflexivity, transitivity
% 5.69/1.57
% 5.69/1.57 Those formulas are unsatisfiable:
% 5.69/1.57 ---------------------------------
% 5.69/1.57
% 5.69/1.57 Begin of proof
% 5.69/1.57 |
% 5.69/1.57 | DELTA: instantiating (main) with fresh symbols all_4_0, all_4_1, all_4_2,
% 5.69/1.57 | all_4_3, all_4_4, all_4_5, all_4_6, all_4_7, all_4_8 gives:
% 5.94/1.57 | (1) $i(all_4_0) & $i(all_4_1) & $i(all_4_2) & $i(all_4_3) & $i(all_4_4) &
% 5.94/1.57 | $i(all_4_5) & $i(all_4_6) & $i(all_4_7) & $i(all_4_8) & r1(all_4_1,
% 5.94/1.57 | all_4_0) & r1(all_4_3, all_4_2) & r1(all_4_5, all_4_4) & r1(all_4_7,
% 5.94/1.57 | all_4_6) & r1(all_4_8, all_4_1) & r1(all_4_8, all_4_3) & r1(all_4_8,
% 5.94/1.58 | all_4_5) & r1(all_4_8, all_4_7) & ~ p11(all_4_6) & ~ p13(all_4_2) &
% 5.94/1.58 | ~ p15(all_4_0) & ~ p12(all_4_4) & ! [v0: $i] : ! [v1: $i] : ( ~
% 5.94/1.58 | $i(v1) | ~ $i(v0) | ~ r1(v0, v1) | ~ r1(all_4_8, v0) | p14(v1)) &
% 5.94/1.58 | ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ r1(v0, v1) | ~
% 5.94/1.58 | r1(all_4_8, v0) | p12(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) |
% 5.94/1.58 | ~ $i(v0) | ~ r1(v0, v1) | ~ r1(all_4_8, v0) | p16(v1))
% 5.94/1.58 |
% 5.94/1.58 | ALPHA: (1) implies:
% 5.94/1.58 | (2) ~ p12(all_4_4)
% 5.94/1.58 | (3) r1(all_4_8, all_4_5)
% 5.94/1.58 | (4) r1(all_4_5, all_4_4)
% 5.94/1.58 | (5) $i(all_4_5)
% 5.94/1.58 | (6) $i(all_4_4)
% 5.94/1.58 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ r1(v0, v1) | ~
% 5.94/1.58 | r1(all_4_8, v0) | p12(v1))
% 5.94/1.58 |
% 5.94/1.58 | GROUND_INST: instantiating (7) with all_4_5, all_4_4, simplifying with (2),
% 5.94/1.58 | (3), (4), (5), (6) gives:
% 5.94/1.58 | (8) $false
% 5.94/1.58 |
% 5.94/1.58 | CLOSE: (8) is inconsistent.
% 5.94/1.58 |
% 5.94/1.58 End of proof
% 5.94/1.58 % SZS output end Proof for theBenchmark
% 5.94/1.58
% 5.94/1.58 978ms
%------------------------------------------------------------------------------