TSTP Solution File: SWC339+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC339+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 : n024.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:54 EDT 2023
% Result : Theorem 25.36s 4.14s
% Output : Proof 36.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC339+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n024.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 15:57:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.61 ________ _____
% 0.19/0.61 ___ __ \_________(_)________________________________
% 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.87/1.37 Prover 4: Preprocessing ...
% 4.87/1.39 Prover 1: Preprocessing ...
% 4.87/1.41 Prover 6: Preprocessing ...
% 4.87/1.41 Prover 0: Preprocessing ...
% 4.87/1.41 Prover 2: Preprocessing ...
% 4.87/1.41 Prover 3: Preprocessing ...
% 4.87/1.41 Prover 5: Preprocessing ...
% 15.36/2.77 Prover 2: Proving ...
% 16.36/2.89 Prover 1: Constructing countermodel ...
% 16.36/2.91 Prover 5: Constructing countermodel ...
% 16.73/2.92 Prover 6: Proving ...
% 16.97/2.98 Prover 3: Constructing countermodel ...
% 24.24/3.92 Prover 4: Constructing countermodel ...
% 24.93/4.04 Prover 0: Proving ...
% 25.36/4.14 Prover 3: proved (3508ms)
% 25.36/4.14
% 25.36/4.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.36/4.14
% 25.36/4.15 Prover 5: stopped
% 25.36/4.15 Prover 6: stopped
% 25.36/4.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 25.36/4.15 Prover 2: stopped
% 25.36/4.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 25.36/4.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 25.36/4.16 Prover 0: stopped
% 26.00/4.17 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 26.00/4.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 27.60/4.39 Prover 8: Preprocessing ...
% 27.60/4.40 Prover 13: Preprocessing ...
% 27.60/4.40 Prover 7: Preprocessing ...
% 27.60/4.43 Prover 10: Preprocessing ...
% 27.60/4.44 Prover 11: Preprocessing ...
% 30.09/4.73 Prover 7: Constructing countermodel ...
% 30.09/4.75 Prover 10: Constructing countermodel ...
% 30.45/4.82 Prover 13: Constructing countermodel ...
% 31.95/5.05 Prover 10: Found proof (size 7)
% 31.95/5.06 Prover 10: proved (893ms)
% 31.95/5.06 Prover 1: stopped
% 31.95/5.06 Prover 13: stopped
% 31.95/5.06 Prover 4: stopped
% 31.95/5.06 Prover 7: stopped
% 32.88/5.12 Prover 8: Warning: ignoring some quantifiers
% 32.88/5.13 Prover 8: Constructing countermodel ...
% 32.88/5.14 Prover 8: stopped
% 35.59/5.81 Prover 11: Constructing countermodel ...
% 35.78/5.84 Prover 11: stopped
% 35.78/5.84
% 35.78/5.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 35.78/5.84
% 35.87/5.84 % SZS output start Proof for theBenchmark
% 35.87/5.85 Assumptions after simplification:
% 35.87/5.85 ---------------------------------
% 35.87/5.85
% 35.87/5.85 (ax7)
% 35.87/5.90 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 35.87/5.90 (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~
% 35.87/5.90 $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ ssList(v1) | ~
% 35.87/5.90 ssList(v0) | segmentP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~
% 35.87/5.90 $i(v0) | ~ segmentP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] :
% 35.87/5.90 ? [v3: $i] : ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) &
% 35.87/5.90 $i(v3) & $i(v2) & ssList(v4) & ssList(v2)))
% 35.87/5.90
% 35.87/5.90 (co1)
% 35.87/5.90 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i]
% 35.87/5.90 : (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 35.87/5.90 $i(v0) & totalorderedP(v0) & ssList(v4) & ssList(v2) & ssList(v1) &
% 35.87/5.90 ssList(v0) & ~ segmentP(v1, v0) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] :
% 35.87/5.90 ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | ~
% 35.87/5.90 (cons(v5, nil) = v6) | ~ (app(v10, v9) = v0) | ~ (app(v6, v7) = v4) | ~
% 35.87/5.90 $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ leq(v8, v5) | ~
% 35.87/5.90 ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ ssItem(v5)) & ! [v5: $i]
% 35.87/5.90 : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~
% 35.87/5.90 (cons(v8, nil) = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) |
% 35.87/5.90 ~ (app(v7, v6) = v2) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~
% 35.87/5.90 leq(v5, v8) | ~ ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~
% 35.87/5.90 ssItem(v5)) & ( ~ (v0 = nil) | v1 = nil))
% 35.87/5.90
% 35.87/5.90 Further assumptions not needed in the proof:
% 35.87/5.90 --------------------------------------------
% 35.87/5.91 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 35.87/5.91 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 35.87/5.91 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 35.87/5.91 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 35.87/5.91 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 35.87/5.91 ax69, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80,
% 35.87/5.91 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92,
% 35.87/5.91 ax93, ax94, ax95
% 35.87/5.91
% 35.87/5.91 Those formulas are unsatisfiable:
% 35.87/5.91 ---------------------------------
% 35.87/5.91
% 35.87/5.91 Begin of proof
% 35.87/5.91 |
% 35.87/5.91 | ALPHA: (ax7) implies:
% 35.87/5.91 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 35.87/5.91 | ~ (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2)
% 35.87/5.91 | | ~ $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~
% 35.87/5.91 | ssList(v1) | ~ ssList(v0) | segmentP(v0, v1))
% 35.87/5.91 |
% 35.87/5.91 | ALPHA: (co1) implies:
% 35.87/5.91 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] :
% 35.87/5.91 | (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) &
% 35.87/5.91 | $i(v1) & $i(v0) & totalorderedP(v0) & ssList(v4) & ssList(v2) &
% 35.87/5.91 | ssList(v1) & ssList(v0) & ~ segmentP(v1, v0) & ! [v5: $i] : ! [v6:
% 35.87/5.91 | $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~
% 35.87/5.91 | (cons(v8, nil) = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v10, v9) =
% 35.87/5.91 | v0) | ~ (app(v6, v7) = v4) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7)
% 35.87/5.91 | | ~ $i(v5) | ~ leq(v8, v5) | ~ ssList(v10) | ~ ssList(v7) | ~
% 35.87/5.91 | ssItem(v8) | ~ ssItem(v5)) & ! [v5: $i] : ! [v6: $i] : ! [v7:
% 35.87/5.91 | $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil)
% 35.87/5.91 | = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) | ~
% 35.87/5.91 | (app(v7, v6) = v2) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5)
% 35.87/5.91 | | ~ leq(v5, v8) | ~ ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) |
% 35.87/5.91 | ~ ssItem(v5)) & ( ~ (v0 = nil) | v1 = nil))
% 35.87/5.91 |
% 35.87/5.92 | DELTA: instantiating (2) with fresh symbols all_91_0, all_91_1, all_91_2,
% 35.87/5.92 | all_91_3, all_91_4 gives:
% 36.24/5.92 | (3) app(all_91_1, all_91_0) = all_91_3 & app(all_91_2, all_91_4) = all_91_1
% 36.24/5.92 | & $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) &
% 36.24/5.92 | $i(all_91_4) & totalorderedP(all_91_4) & ssList(all_91_0) &
% 36.24/5.92 | ssList(all_91_2) & ssList(all_91_3) & ssList(all_91_4) & ~
% 36.24/5.92 | segmentP(all_91_3, all_91_4) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i]
% 36.24/5.92 | : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) = v4) |
% 36.24/5.92 | ~ (cons(v0, nil) = v1) | ~ (app(v5, v4) = all_91_4) | ~ (app(v1,
% 36.24/5.92 | v2) = all_91_0) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) |
% 36.24/5.92 | ~ leq(v3, v0) | ~ ssList(v5) | ~ ssList(v2) | ~ ssItem(v3) | ~
% 36.24/5.92 | ssItem(v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] :
% 36.24/5.92 | ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) = v4) | ~ (cons(v0,
% 36.24/5.92 | nil) = v1) | ~ (app(v4, v5) = all_91_4) | ~ (app(v2, v1) =
% 36.24/5.92 | all_91_2) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ~
% 36.24/5.92 | leq(v0, v3) | ~ ssList(v5) | ~ ssList(v2) | ~ ssItem(v3) | ~
% 36.24/5.92 | ssItem(v0)) & ( ~ (all_91_4 = nil) | all_91_3 = nil)
% 36.24/5.92 |
% 36.24/5.92 | ALPHA: (3) implies:
% 36.24/5.92 | (4) ~ segmentP(all_91_3, all_91_4)
% 36.24/5.92 | (5) ssList(all_91_4)
% 36.24/5.92 | (6) ssList(all_91_3)
% 36.24/5.92 | (7) ssList(all_91_2)
% 36.24/5.92 | (8) ssList(all_91_0)
% 36.24/5.92 | (9) $i(all_91_4)
% 36.24/5.92 | (10) $i(all_91_3)
% 36.24/5.92 | (11) $i(all_91_2)
% 36.24/5.92 | (12) $i(all_91_0)
% 36.24/5.92 | (13) app(all_91_2, all_91_4) = all_91_1
% 36.24/5.92 | (14) app(all_91_1, all_91_0) = all_91_3
% 36.24/5.92 |
% 36.24/5.93 | GROUND_INST: instantiating (1) with all_91_3, all_91_4, all_91_2, all_91_1,
% 36.24/5.93 | all_91_0, simplifying with (4), (5), (6), (7), (8), (9), (10),
% 36.24/5.93 | (11), (12), (13), (14) gives:
% 36.24/5.93 | (15) $false
% 36.24/5.93 |
% 36.24/5.93 | CLOSE: (15) is inconsistent.
% 36.24/5.93 |
% 36.24/5.93 End of proof
% 36.24/5.93 % SZS output end Proof for theBenchmark
% 36.24/5.93
% 36.24/5.93 5318ms
%------------------------------------------------------------------------------