TSTP Solution File: SWC351+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC351+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n028.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:50:59 EDT 2023
% Result : Theorem 22.50s 3.76s
% Output : Proof 31.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC351+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n028.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 : Mon Aug 28 18:39:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.60 ________ _____
% 0.20/0.60 ___ __ \_________(_)________________________________
% 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60
% 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60 (2023-06-19)
% 0.20/0.60
% 0.20/0.60 (c) Philipp Rümmer, 2009-2023
% 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60 Amanda Stjerna.
% 0.20/0.60 Free software under BSD-3-Clause.
% 0.20/0.60
% 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60
% 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 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 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 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 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 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
% 5.26/1.45 Prover 1: Preprocessing ...
% 5.26/1.45 Prover 4: Preprocessing ...
% 5.26/1.48 Prover 0: Preprocessing ...
% 5.26/1.48 Prover 2: Preprocessing ...
% 5.26/1.48 Prover 3: Preprocessing ...
% 5.26/1.48 Prover 5: Preprocessing ...
% 5.26/1.49 Prover 6: Preprocessing ...
% 15.02/2.83 Prover 2: Proving ...
% 15.02/2.84 Prover 5: Constructing countermodel ...
% 15.60/2.89 Prover 6: Proving ...
% 16.37/2.94 Prover 1: Constructing countermodel ...
% 16.37/2.94 Prover 3: Constructing countermodel ...
% 20.73/3.55 Prover 4: Constructing countermodel ...
% 22.50/3.75 Prover 3: proved (3128ms)
% 22.50/3.75
% 22.50/3.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.50/3.76
% 22.50/3.76 Prover 5: stopped
% 22.50/3.76 Prover 2: stopped
% 22.50/3.76 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 22.50/3.76 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 22.50/3.76 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 22.50/3.76 Prover 6: stopped
% 22.50/3.77 Prover 0: Proving ...
% 22.50/3.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 22.70/3.77 Prover 0: stopped
% 22.70/3.79 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 25.59/4.15 Prover 7: Preprocessing ...
% 25.59/4.16 Prover 8: Preprocessing ...
% 25.59/4.19 Prover 13: Preprocessing ...
% 25.59/4.21 Prover 10: Preprocessing ...
% 25.59/4.23 Prover 11: Preprocessing ...
% 27.01/4.39 Prover 7: Constructing countermodel ...
% 27.01/4.40 Prover 10: Constructing countermodel ...
% 28.07/4.48 Prover 13: Constructing countermodel ...
% 28.99/4.60 Prover 10: Found proof (size 7)
% 28.99/4.60 Prover 10: proved (845ms)
% 28.99/4.60 Prover 7: stopped
% 28.99/4.60 Prover 13: stopped
% 28.99/4.60 Prover 4: stopped
% 28.99/4.60 Prover 1: stopped
% 28.99/4.61 Prover 8: Warning: ignoring some quantifiers
% 29.21/4.62 Prover 8: Constructing countermodel ...
% 29.26/4.64 Prover 8: stopped
% 31.53/5.21 Prover 11: Constructing countermodel ...
% 31.53/5.23 Prover 11: stopped
% 31.53/5.23
% 31.53/5.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.53/5.23
% 31.53/5.24 % SZS output start Proof for theBenchmark
% 31.53/5.24 Assumptions after simplification:
% 31.53/5.24 ---------------------------------
% 31.53/5.24
% 31.53/5.24 (ax5)
% 31.91/5.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v1, v2) = v0) | ~ $i(v2) |
% 31.91/5.28 ~ $i(v1) | ~ $i(v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssList(v0) |
% 31.91/5.28 frontsegP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~
% 31.91/5.28 frontsegP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : (app(v1,
% 31.91/5.28 v2) = v0 & $i(v2) & ssList(v2)))
% 31.91/5.28
% 31.91/5.28 (co1)
% 31.91/5.28 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2)
% 31.91/5.28 & $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) &
% 31.91/5.28 ssList(v0) & neq(v1, nil) & ~ frontsegP(v1, v0) & ! [v3: $i] : ! [v4: $i]
% 31.91/5.28 : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v6, nil)
% 31.91/5.28 = v7) | ~ (cons(v3, nil) = v4) | ~ (app(v8, v7) = v0) | ~ (app(v4,
% 31.91/5.28 v5) = v2) | ~ $i(v8) | ~ $i(v6) | ~ $i(v5) | ~ $i(v3) | ~ lt(v6,
% 31.91/5.28 v3) | ~ ssList(v8) | ~ ssList(v5) | ~ ssItem(v6) | ~ ssItem(v3)) & (
% 31.91/5.28 ~ (v0 = nil) | v1 = nil))
% 31.91/5.28
% 31.91/5.28 Further assumptions not needed in the proof:
% 31.91/5.28 --------------------------------------------
% 31.91/5.28 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 31.91/5.28 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 31.91/5.28 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 31.91/5.28 ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57,
% 31.91/5.28 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69,
% 31.91/5.28 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80,
% 31.91/5.28 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92,
% 31.91/5.28 ax93, ax94, ax95
% 31.91/5.28
% 31.91/5.28 Those formulas are unsatisfiable:
% 31.91/5.28 ---------------------------------
% 31.91/5.28
% 31.91/5.28 Begin of proof
% 31.91/5.29 |
% 31.91/5.29 | ALPHA: (ax5) implies:
% 31.91/5.29 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v1, v2) = v0) | ~
% 31.91/5.29 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ ssList(v2) | ~ ssList(v1) | ~
% 31.91/5.29 | ssList(v0) | frontsegP(v0, v1))
% 31.91/5.29 |
% 31.91/5.29 | ALPHA: (co1) implies:
% 31.96/5.29 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2) &
% 31.96/5.29 | $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) &
% 31.96/5.29 | ssList(v0) & neq(v1, nil) & ~ frontsegP(v1, v0) & ! [v3: $i] : !
% 31.96/5.29 | [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : (
% 31.96/5.29 | ~ (cons(v6, nil) = v7) | ~ (cons(v3, nil) = v4) | ~ (app(v8, v7)
% 31.96/5.29 | = v0) | ~ (app(v4, v5) = v2) | ~ $i(v8) | ~ $i(v6) | ~ $i(v5)
% 31.96/5.29 | | ~ $i(v3) | ~ lt(v6, v3) | ~ ssList(v8) | ~ ssList(v5) | ~
% 31.96/5.29 | ssItem(v6) | ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = nil))
% 31.96/5.29 |
% 31.96/5.29 | DELTA: instantiating (2) with fresh symbols all_91_0, all_91_1, all_91_2
% 31.96/5.29 | gives:
% 31.96/5.29 | (3) app(all_91_2, all_91_0) = all_91_1 & $i(all_91_0) & $i(all_91_1) &
% 31.96/5.29 | $i(all_91_2) & strictorderedP(all_91_2) & ssList(all_91_0) &
% 31.96/5.29 | ssList(all_91_1) & ssList(all_91_2) & neq(all_91_1, nil) & ~
% 31.96/5.29 | frontsegP(all_91_1, all_91_2) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i]
% 31.96/5.29 | : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) = v4) |
% 31.96/5.29 | ~ (cons(v0, nil) = v1) | ~ (app(v5, v4) = all_91_2) | ~ (app(v1,
% 31.96/5.29 | v2) = all_91_0) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) |
% 31.96/5.29 | ~ lt(v3, v0) | ~ ssList(v5) | ~ ssList(v2) | ~ ssItem(v3) | ~
% 31.96/5.29 | ssItem(v0)) & ( ~ (all_91_2 = nil) | all_91_1 = nil)
% 31.96/5.29 |
% 31.96/5.29 | ALPHA: (3) implies:
% 31.96/5.30 | (4) ~ frontsegP(all_91_1, all_91_2)
% 31.96/5.30 | (5) ssList(all_91_2)
% 31.96/5.30 | (6) ssList(all_91_1)
% 31.96/5.30 | (7) ssList(all_91_0)
% 31.96/5.30 | (8) $i(all_91_2)
% 31.96/5.30 | (9) $i(all_91_1)
% 31.96/5.30 | (10) $i(all_91_0)
% 31.96/5.30 | (11) app(all_91_2, all_91_0) = all_91_1
% 31.96/5.30 |
% 31.96/5.30 | GROUND_INST: instantiating (1) with all_91_1, all_91_2, all_91_0, simplifying
% 31.96/5.30 | with (4), (5), (6), (7), (8), (9), (10), (11) gives:
% 31.96/5.30 | (12) $false
% 31.96/5.30 |
% 31.96/5.30 | CLOSE: (12) is inconsistent.
% 31.96/5.30 |
% 31.96/5.30 End of proof
% 31.96/5.30 % SZS output end Proof for theBenchmark
% 31.96/5.30
% 31.96/5.30 4696ms
%------------------------------------------------------------------------------