TSTP Solution File: SWC408+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC408+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 : n020.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:18 EDT 2023
% Result : Theorem 22.80s 3.83s
% Output : Proof 28.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC408+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.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 17:42:28 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.60/0.63 ________ _____
% 0.60/0.63 ___ __ \_________(_)________________________________
% 0.60/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.60/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.60/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.60/0.63
% 0.60/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.60/0.63 (2023-06-19)
% 0.60/0.63
% 0.60/0.63 (c) Philipp Rümmer, 2009-2023
% 0.60/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.60/0.63 Amanda Stjerna.
% 0.60/0.63 Free software under BSD-3-Clause.
% 0.60/0.63
% 0.60/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.60/0.63
% 0.60/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.60/0.65 Running up to 7 provers in parallel.
% 0.60/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.60/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.60/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.60/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.60/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.60/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.60/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.86/1.41 Prover 1: Preprocessing ...
% 4.86/1.43 Prover 4: Preprocessing ...
% 5.51/1.45 Prover 5: Preprocessing ...
% 5.51/1.45 Prover 6: Preprocessing ...
% 5.51/1.45 Prover 0: Preprocessing ...
% 5.51/1.45 Prover 3: Preprocessing ...
% 5.51/1.47 Prover 2: Preprocessing ...
% 14.86/2.76 Prover 5: Constructing countermodel ...
% 15.38/2.77 Prover 2: Proving ...
% 15.38/2.83 Prover 1: Constructing countermodel ...
% 16.50/2.93 Prover 6: Proving ...
% 16.50/2.95 Prover 3: Constructing countermodel ...
% 22.18/3.69 Prover 4: Constructing countermodel ...
% 22.80/3.83 Prover 3: proved (3168ms)
% 22.80/3.83
% 22.80/3.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.80/3.83
% 22.80/3.83 Prover 6: stopped
% 22.80/3.84 Prover 2: stopped
% 22.80/3.84 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 22.80/3.84 Prover 5: stopped
% 22.80/3.85 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 22.80/3.85 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 22.80/3.85 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 23.64/3.91 Prover 0: Proving ...
% 23.64/3.92 Prover 0: stopped
% 24.12/3.94 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 24.33/3.99 Prover 8: Preprocessing ...
% 24.33/4.00 Prover 10: Preprocessing ...
% 25.10/4.07 Prover 11: Preprocessing ...
% 25.10/4.07 Prover 7: Preprocessing ...
% 25.10/4.10 Prover 13: Preprocessing ...
% 25.95/4.21 Prover 10: Constructing countermodel ...
% 27.15/4.37 Prover 7: Constructing countermodel ...
% 27.59/4.44 Prover 10: Found proof (size 6)
% 27.59/4.44 Prover 13: Constructing countermodel ...
% 27.59/4.44 Prover 10: proved (597ms)
% 27.59/4.44 Prover 4: stopped
% 27.59/4.44 Prover 1: stopped
% 27.59/4.44 Prover 11: stopped
% 27.59/4.45 Prover 7: stopped
% 27.59/4.46 Prover 13: stopped
% 27.59/4.47 Prover 8: Warning: ignoring some quantifiers
% 27.59/4.48 Prover 8: Constructing countermodel ...
% 27.59/4.49 Prover 8: stopped
% 27.59/4.49
% 27.59/4.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.59/4.49
% 27.59/4.49 % SZS output start Proof for theBenchmark
% 27.59/4.50 Assumptions after simplification:
% 27.59/4.50 ---------------------------------
% 27.59/4.50
% 27.59/4.50 (ax36)
% 28.34/4.53 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3)
% 28.34/4.53 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v3, v0) | ~ ssList(v2) |
% 28.34/4.53 ~ ssList(v1) | ~ ssItem(v0) | memberP(v2, v0) | memberP(v1, v0)) & ! [v0:
% 28.34/4.53 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3) | ~
% 28.34/4.53 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v2, v0) | ~ ssList(v2) | ~
% 28.34/4.53 ssList(v1) | ~ ssItem(v0) | memberP(v3, v0)) & ! [v0: $i] : ! [v1: $i] :
% 28.34/4.53 ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~
% 28.34/4.53 $i(v0) | ~ memberP(v1, v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssItem(v0)
% 28.34/4.53 | memberP(v3, v0))
% 28.34/4.53
% 28.34/4.53 (co1)
% 28.34/4.53 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v1, v1) = v0 & $i(v2) & $i(v1)
% 28.34/4.53 & $i(v0) & memberP(v1, v2) & ssList(v1) & ssList(v0) & ssItem(v2) & ~
% 28.34/4.53 memberP(v0, v2))
% 28.34/4.53
% 28.34/4.53 Further assumptions not needed in the proof:
% 28.34/4.53 --------------------------------------------
% 28.34/4.53 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 28.34/4.53 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 28.34/4.53 ax33, ax34, ax35, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45,
% 28.34/4.53 ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57,
% 28.34/4.53 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69,
% 28.34/4.53 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80,
% 28.34/4.53 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92,
% 28.34/4.53 ax93, ax94, ax95
% 28.34/4.53
% 28.34/4.53 Those formulas are unsatisfiable:
% 28.34/4.53 ---------------------------------
% 28.34/4.53
% 28.34/4.53 Begin of proof
% 28.34/4.53 |
% 28.34/4.53 | ALPHA: (ax36) implies:
% 28.34/4.53 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1,
% 28.34/4.53 | v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v2,
% 28.34/4.53 | v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssItem(v0) | memberP(v3,
% 28.34/4.53 | v0))
% 28.34/4.53 |
% 28.34/4.53 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1, all_91_2
% 28.34/4.53 | gives:
% 28.34/4.53 | (2) app(all_91_1, all_91_1) = all_91_2 & $i(all_91_0) & $i(all_91_1) &
% 28.34/4.53 | $i(all_91_2) & memberP(all_91_1, all_91_0) & ssList(all_91_1) &
% 28.34/4.53 | ssList(all_91_2) & ssItem(all_91_0) & ~ memberP(all_91_2, all_91_0)
% 28.34/4.53 |
% 28.34/4.53 | ALPHA: (2) implies:
% 28.34/4.54 | (3) ~ memberP(all_91_2, all_91_0)
% 28.34/4.54 | (4) ssItem(all_91_0)
% 28.34/4.54 | (5) ssList(all_91_1)
% 28.34/4.54 | (6) memberP(all_91_1, all_91_0)
% 28.34/4.54 | (7) $i(all_91_1)
% 28.34/4.54 | (8) $i(all_91_0)
% 28.34/4.54 | (9) app(all_91_1, all_91_1) = all_91_2
% 28.34/4.54 |
% 28.34/4.54 | GROUND_INST: instantiating (1) with all_91_0, all_91_1, all_91_1, all_91_2,
% 28.34/4.54 | simplifying with (3), (4), (5), (6), (7), (8), (9) gives:
% 28.34/4.54 | (10) $false
% 28.34/4.54 |
% 28.34/4.54 | CLOSE: (10) is inconsistent.
% 28.34/4.54 |
% 28.34/4.54 End of proof
% 28.34/4.54 % SZS output end Proof for theBenchmark
% 28.34/4.54
% 28.34/4.54 3905ms
%------------------------------------------------------------------------------