TSTP Solution File: SWC405+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC405+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 : n013.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:51:16 EDT 2023
% Result : Theorem 22.77s 3.80s
% Output : Proof 32.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC405+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 : n013.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 16:42:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.72/0.69 ________ _____
% 0.72/0.69 ___ __ \_________(_)________________________________
% 0.72/0.69 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.72/0.69 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.72/0.69 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.72/0.69
% 0.72/0.69 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.72/0.69 (2023-06-19)
% 0.72/0.69
% 0.72/0.69 (c) Philipp Rümmer, 2009-2023
% 0.72/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.72/0.69 Amanda Stjerna.
% 0.72/0.69 Free software under BSD-3-Clause.
% 0.72/0.69
% 0.72/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.72/0.69
% 0.72/0.69 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.72/0.70 Running up to 7 provers in parallel.
% 0.72/0.71 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.72/0.71 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.72/0.71 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.72/0.71 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.72/0.71 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.72/0.71 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.72/0.71 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.84/1.58 Prover 1: Preprocessing ...
% 5.84/1.61 Prover 4: Preprocessing ...
% 5.84/1.63 Prover 3: Preprocessing ...
% 5.84/1.63 Prover 5: Preprocessing ...
% 5.84/1.64 Prover 0: Preprocessing ...
% 5.84/1.64 Prover 2: Preprocessing ...
% 5.84/1.64 Prover 6: Preprocessing ...
% 16.83/3.01 Prover 2: Proving ...
% 16.83/3.05 Prover 5: Constructing countermodel ...
% 17.29/3.13 Prover 1: Constructing countermodel ...
% 18.06/3.19 Prover 3: Constructing countermodel ...
% 18.31/3.21 Prover 6: Proving ...
% 22.77/3.80 Prover 3: proved (3088ms)
% 22.77/3.80
% 22.77/3.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.77/3.80
% 22.77/3.80 Prover 5: stopped
% 22.77/3.81 Prover 2: stopped
% 22.77/3.83 Prover 6: stopped
% 22.77/3.84 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 22.77/3.84 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 22.77/3.84 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 22.77/3.85 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 23.44/3.94 Prover 7: Preprocessing ...
% 24.41/4.03 Prover 10: Preprocessing ...
% 24.61/4.05 Prover 11: Preprocessing ...
% 24.61/4.06 Prover 8: Preprocessing ...
% 25.80/4.22 Prover 4: Constructing countermodel ...
% 26.79/4.34 Prover 7: Constructing countermodel ...
% 26.79/4.40 Prover 10: Constructing countermodel ...
% 28.70/4.59 Prover 0: Proving ...
% 29.00/4.61 Prover 0: stopped
% 29.00/4.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 29.27/4.64 Prover 8: Warning: ignoring some quantifiers
% 29.27/4.65 Prover 8: Constructing countermodel ...
% 29.27/4.69 Prover 10: Found proof (size 5)
% 29.27/4.69 Prover 10: proved (865ms)
% 29.27/4.69 Prover 7: stopped
% 29.27/4.69 Prover 1: stopped
% 29.27/4.69 Prover 4: stopped
% 29.27/4.70 Prover 8: stopped
% 29.27/4.72 Prover 13: Preprocessing ...
% 29.94/4.77 Prover 13: stopped
% 32.06/5.24 Prover 11: Constructing countermodel ...
% 32.06/5.27 Prover 11: stopped
% 32.06/5.27
% 32.06/5.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.06/5.27
% 32.06/5.27 % SZS output start Proof for theBenchmark
% 32.06/5.27 Assumptions after simplification:
% 32.06/5.27 ---------------------------------
% 32.06/5.27
% 32.06/5.27 (co1)
% 32.06/5.28 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) &
% 32.06/5.28 memberP(v0, v2) & ssList(v1) & ssList(v0) & ssItem(v2) & ~ memberP(v1, v2)
% 32.06/5.28 & ! [v3: $i] : ( ~ $i(v3) | ~ memberP(v1, v3) | ~ ssItem(v3) |
% 32.06/5.28 memberP(v0, v3)) & ! [v3: $i] : ( ~ $i(v3) | ~ memberP(v0, v3) | ~
% 32.06/5.28 ssItem(v3) | memberP(v1, v3)))
% 32.06/5.28
% 32.06/5.28 Further assumptions not needed in the proof:
% 32.06/5.28 --------------------------------------------
% 32.06/5.28 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 32.06/5.28 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 32.06/5.28 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 32.06/5.28 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 32.06/5.28 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 32.06/5.28 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8,
% 32.06/5.28 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91,
% 32.06/5.28 ax92, ax93, ax94, ax95
% 32.06/5.28
% 32.06/5.28 Those formulas are unsatisfiable:
% 32.06/5.28 ---------------------------------
% 32.06/5.28
% 32.06/5.28 Begin of proof
% 32.06/5.28 |
% 32.06/5.28 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1, all_91_2
% 32.06/5.28 | gives:
% 32.06/5.29 | (1) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & memberP(all_91_2,
% 32.06/5.29 | all_91_0) & ssList(all_91_1) & ssList(all_91_2) & ssItem(all_91_0) &
% 32.06/5.29 | ~ memberP(all_91_1, all_91_0) & ! [v0: $i] : ( ~ $i(v0) | ~
% 32.06/5.29 | memberP(all_91_1, v0) | ~ ssItem(v0) | memberP(all_91_2, v0)) & !
% 32.06/5.29 | [v0: $i] : ( ~ $i(v0) | ~ memberP(all_91_2, v0) | ~ ssItem(v0) |
% 32.06/5.29 | memberP(all_91_1, v0))
% 32.06/5.29 |
% 32.06/5.29 | ALPHA: (1) implies:
% 32.06/5.29 | (2) ~ memberP(all_91_1, all_91_0)
% 32.06/5.29 | (3) ssItem(all_91_0)
% 32.06/5.29 | (4) memberP(all_91_2, all_91_0)
% 32.06/5.29 | (5) $i(all_91_0)
% 32.06/5.29 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ memberP(all_91_2, v0) | ~ ssItem(v0) |
% 32.06/5.29 | memberP(all_91_1, v0))
% 32.06/5.29 |
% 32.06/5.29 | GROUND_INST: instantiating (6) with all_91_0, simplifying with (2), (3), (4),
% 32.06/5.29 | (5) gives:
% 32.06/5.29 | (7) $false
% 32.06/5.29 |
% 32.06/5.29 | CLOSE: (7) is inconsistent.
% 32.06/5.29 |
% 32.06/5.29 End of proof
% 32.06/5.29 % SZS output end Proof for theBenchmark
% 32.06/5.29
% 32.06/5.29 4602ms
%------------------------------------------------------------------------------