TSTP Solution File: SWC050+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC050+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 : n007.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:49:23 EDT 2023
% Result : Theorem 20.41s 3.46s
% Output : Proof 28.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC050+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n007.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 : Mon Aug 28 17:31:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.61/0.59 ________ _____
% 0.61/0.59 ___ __ \_________(_)________________________________
% 0.61/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.61/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.61/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.61/0.59
% 0.61/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.61/0.59 (2023-06-19)
% 0.61/0.59
% 0.61/0.59 (c) Philipp Rümmer, 2009-2023
% 0.61/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.61/0.59 Amanda Stjerna.
% 0.61/0.59 Free software under BSD-3-Clause.
% 0.61/0.59
% 0.61/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.61/0.59
% 0.61/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.61/0.61 Running up to 7 provers in parallel.
% 0.67/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.21/1.45 Prover 4: Preprocessing ...
% 5.21/1.46 Prover 1: Preprocessing ...
% 5.89/1.48 Prover 6: Preprocessing ...
% 5.89/1.48 Prover 5: Preprocessing ...
% 5.89/1.48 Prover 0: Preprocessing ...
% 5.89/1.48 Prover 3: Preprocessing ...
% 5.89/1.48 Prover 2: Preprocessing ...
% 15.15/2.77 Prover 2: Proving ...
% 15.86/2.86 Prover 5: Constructing countermodel ...
% 16.50/2.95 Prover 1: Constructing countermodel ...
% 16.50/2.95 Prover 6: Proving ...
% 16.50/2.96 Prover 3: Constructing countermodel ...
% 20.41/3.46 Prover 3: proved (2841ms)
% 20.41/3.46
% 20.41/3.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.41/3.46
% 20.41/3.46 Prover 5: stopped
% 20.41/3.46 Prover 6: stopped
% 20.41/3.46 Prover 2: stopped
% 20.41/3.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 20.41/3.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 20.41/3.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 20.41/3.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 21.14/3.58 Prover 4: Constructing countermodel ...
% 22.70/3.74 Prover 7: Preprocessing ...
% 22.70/3.74 Prover 11: Preprocessing ...
% 22.70/3.76 Prover 0: Proving ...
% 22.70/3.77 Prover 0: stopped
% 22.70/3.77 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 22.70/3.78 Prover 10: Preprocessing ...
% 23.43/3.81 Prover 8: Preprocessing ...
% 24.10/3.92 Prover 13: Preprocessing ...
% 24.78/3.99 Prover 10: Constructing countermodel ...
% 24.88/4.01 Prover 7: Constructing countermodel ...
% 26.34/4.18 Prover 10: Found proof (size 6)
% 26.34/4.18 Prover 10: proved (705ms)
% 26.34/4.18 Prover 1: stopped
% 26.34/4.18 Prover 4: stopped
% 26.34/4.18 Prover 7: stopped
% 26.34/4.21 Prover 13: Constructing countermodel ...
% 26.34/4.22 Prover 8: Warning: ignoring some quantifiers
% 26.34/4.23 Prover 13: stopped
% 26.34/4.23 Prover 8: Constructing countermodel ...
% 26.34/4.24 Prover 8: stopped
% 28.29/4.63 Prover 11: Constructing countermodel ...
% 28.29/4.65 Prover 11: stopped
% 28.29/4.65
% 28.29/4.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.29/4.65
% 28.29/4.66 % SZS output start Proof for theBenchmark
% 28.29/4.67 Assumptions after simplification:
% 28.29/4.67 ---------------------------------
% 28.29/4.67
% 28.29/4.67 (co1)
% 28.29/4.68 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0)
% 28.29/4.68 & rearsegP(v1, v2) & rearsegP(v0, v2) & ssList(v2) & ssList(v1) & ssList(v0)
% 28.29/4.68 & neq(v2, nil) & neq(v1, nil) & ! [v3: $i] : ( ~ $i(v3) | ~ rearsegP(v1,
% 28.29/4.68 v3) | ~ rearsegP(v0, v3) | ~ ssList(v3) | ~ neq(v3, nil)))
% 28.29/4.68
% 28.29/4.68 Further assumptions not needed in the proof:
% 28.29/4.68 --------------------------------------------
% 28.29/4.68 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 28.29/4.68 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 28.29/4.68 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 28.29/4.68 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 28.29/4.68 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 28.29/4.68 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8,
% 28.29/4.68 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91,
% 28.29/4.68 ax92, ax93, ax94, ax95
% 28.29/4.68
% 28.29/4.68 Those formulas are unsatisfiable:
% 28.29/4.68 ---------------------------------
% 28.29/4.68
% 28.29/4.68 Begin of proof
% 28.29/4.68 |
% 28.29/4.68 | ALPHA: (co1) implies:
% 28.29/4.69 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) &
% 28.29/4.69 | rearsegP(v1, v2) & rearsegP(v0, v2) & ssList(v2) & ssList(v1) &
% 28.29/4.69 | ssList(v0) & neq(v2, nil) & neq(v1, nil) & ! [v3: $i] : ( ~ $i(v3) |
% 28.29/4.69 | ~ rearsegP(v1, v3) | ~ rearsegP(v0, v3) | ~ ssList(v3) | ~
% 28.29/4.69 | neq(v3, nil)))
% 28.29/4.69 |
% 28.29/4.69 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2
% 28.29/4.69 | gives:
% 28.29/4.69 | (2) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & rearsegP(all_91_1,
% 28.29/4.69 | all_91_0) & rearsegP(all_91_2, all_91_0) & ssList(all_91_0) &
% 28.29/4.69 | ssList(all_91_1) & ssList(all_91_2) & neq(all_91_0, nil) &
% 28.29/4.69 | neq(all_91_1, nil) & ! [v0: $i] : ( ~ $i(v0) | ~ rearsegP(all_91_1,
% 28.29/4.69 | v0) | ~ rearsegP(all_91_2, v0) | ~ ssList(v0) | ~ neq(v0, nil))
% 28.29/4.69 |
% 28.29/4.69 | ALPHA: (2) implies:
% 28.29/4.70 | (3) neq(all_91_0, nil)
% 28.29/4.70 | (4) ssList(all_91_0)
% 28.29/4.70 | (5) rearsegP(all_91_2, all_91_0)
% 28.29/4.70 | (6) rearsegP(all_91_1, all_91_0)
% 28.29/4.70 | (7) $i(all_91_0)
% 28.29/4.70 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ rearsegP(all_91_1, v0) | ~
% 28.29/4.70 | rearsegP(all_91_2, v0) | ~ ssList(v0) | ~ neq(v0, nil))
% 28.29/4.70 |
% 28.29/4.70 | GROUND_INST: instantiating (8) with all_91_0, simplifying with (3), (4), (5),
% 28.29/4.70 | (6), (7) gives:
% 28.29/4.70 | (9) $false
% 28.29/4.70 |
% 28.29/4.70 | CLOSE: (9) is inconsistent.
% 28.29/4.70 |
% 28.29/4.70 End of proof
% 28.29/4.70 % SZS output end Proof for theBenchmark
% 28.29/4.70
% 28.29/4.70 4108ms
%------------------------------------------------------------------------------