TSTP Solution File: SWC082+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC082+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 : n002.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:33 EDT 2023
% Result : Theorem 27.28s 4.65s
% Output : Proof 41.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Aug 28 16:11:04 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.17/0.59 ________ _____
% 0.17/0.59 ___ __ \_________(_)________________________________
% 0.17/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.59
% 0.17/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.59 (2023-06-19)
% 0.17/0.59
% 0.17/0.59 (c) Philipp Rümmer, 2009-2023
% 0.17/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.59 Amanda Stjerna.
% 0.17/0.59 Free software under BSD-3-Clause.
% 0.17/0.59
% 0.17/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.59
% 0.17/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.17/0.61 Running up to 7 provers in parallel.
% 0.71/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.91/1.56 Prover 1: Preprocessing ...
% 5.91/1.58 Prover 4: Preprocessing ...
% 5.91/1.60 Prover 0: Preprocessing ...
% 5.91/1.60 Prover 5: Preprocessing ...
% 5.91/1.60 Prover 2: Preprocessing ...
% 5.91/1.60 Prover 6: Preprocessing ...
% 5.91/1.60 Prover 3: Preprocessing ...
% 21.52/3.67 Prover 2: Proving ...
% 22.11/3.74 Prover 5: Constructing countermodel ...
% 22.11/3.80 Prover 1: Constructing countermodel ...
% 22.77/3.86 Prover 3: Constructing countermodel ...
% 22.77/3.93 Prover 6: Proving ...
% 27.28/4.64 Prover 3: proved (4001ms)
% 27.28/4.64
% 27.28/4.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.28/4.65
% 27.28/4.65 Prover 5: stopped
% 27.28/4.65 Prover 2: stopped
% 27.28/4.65 Prover 6: stopped
% 28.51/4.66 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 28.51/4.66 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 28.51/4.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 28.51/4.67 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 30.65/4.88 Prover 4: Constructing countermodel ...
% 31.66/5.02 Prover 8: Preprocessing ...
% 31.66/5.06 Prover 11: Preprocessing ...
% 31.66/5.08 Prover 7: Preprocessing ...
% 31.66/5.08 Prover 10: Preprocessing ...
% 32.88/5.24 Prover 0: Proving ...
% 32.88/5.27 Prover 0: stopped
% 33.58/5.30 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 34.82/5.49 Prover 7: Constructing countermodel ...
% 35.19/5.55 Prover 10: Constructing countermodel ...
% 35.61/5.55 Prover 13: Preprocessing ...
% 36.77/5.73 Prover 8: Warning: ignoring some quantifiers
% 37.14/5.75 Prover 8: Constructing countermodel ...
% 38.36/5.92 Prover 10: Found proof (size 6)
% 38.36/5.92 Prover 10: proved (1256ms)
% 38.36/5.92 Prover 7: stopped
% 38.36/5.92 Prover 8: stopped
% 38.36/5.92 Prover 4: stopped
% 38.36/5.92 Prover 13: Constructing countermodel ...
% 38.36/5.92 Prover 1: stopped
% 38.70/5.96 Prover 13: stopped
% 41.41/6.76 Prover 11: Constructing countermodel ...
% 41.83/6.82 Prover 11: stopped
% 41.83/6.82
% 41.83/6.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 41.83/6.82
% 41.83/6.83 % SZS output start Proof for theBenchmark
% 41.83/6.83 Assumptions after simplification:
% 41.83/6.83 ---------------------------------
% 41.83/6.83
% 41.83/6.83 (co1)
% 41.83/6.84 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0)
% 41.83/6.85 & segmentP(v1, v2) & segmentP(v0, v2) & ssList(v2) & ssList(v1) & ssList(v0)
% 41.83/6.85 & neq(v2, nil) & neq(v1, nil) & ! [v3: $i] : ( ~ $i(v3) | ~ segmentP(v1,
% 41.83/6.85 v3) | ~ segmentP(v0, v3) | ~ ssList(v3) | ~ neq(v3, nil)) & ( ~ (v1 =
% 41.83/6.85 nil) | v0 = nil))
% 41.83/6.85
% 41.83/6.85 Further assumptions not needed in the proof:
% 41.83/6.85 --------------------------------------------
% 41.83/6.85 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 41.83/6.85 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 41.83/6.85 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 41.83/6.85 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 41.83/6.85 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 41.83/6.85 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8,
% 41.83/6.85 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91,
% 41.83/6.85 ax92, ax93, ax94, ax95
% 41.83/6.85
% 41.83/6.85 Those formulas are unsatisfiable:
% 41.83/6.85 ---------------------------------
% 41.83/6.85
% 41.83/6.85 Begin of proof
% 41.83/6.85 |
% 41.83/6.85 | ALPHA: (co1) implies:
% 41.83/6.85 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) &
% 41.83/6.85 | segmentP(v1, v2) & segmentP(v0, v2) & ssList(v2) & ssList(v1) &
% 41.83/6.85 | ssList(v0) & neq(v2, nil) & neq(v1, nil) & ! [v3: $i] : ( ~ $i(v3) |
% 41.83/6.85 | ~ segmentP(v1, v3) | ~ segmentP(v0, v3) | ~ ssList(v3) | ~
% 41.83/6.85 | neq(v3, nil)) & ( ~ (v1 = nil) | v0 = nil))
% 41.83/6.85 |
% 41.83/6.86 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2
% 41.83/6.86 | gives:
% 41.83/6.86 | (2) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & segmentP(all_91_1,
% 41.83/6.86 | all_91_0) & segmentP(all_91_2, all_91_0) & ssList(all_91_0) &
% 41.83/6.86 | ssList(all_91_1) & ssList(all_91_2) & neq(all_91_0, nil) &
% 41.83/6.86 | neq(all_91_1, nil) & ! [v0: $i] : ( ~ $i(v0) | ~ segmentP(all_91_1,
% 41.83/6.86 | v0) | ~ segmentP(all_91_2, v0) | ~ ssList(v0) | ~ neq(v0, nil))
% 41.83/6.86 | & ( ~ (all_91_1 = nil) | all_91_2 = nil)
% 41.83/6.86 |
% 41.83/6.86 | ALPHA: (2) implies:
% 41.83/6.86 | (3) neq(all_91_0, nil)
% 41.83/6.86 | (4) ssList(all_91_0)
% 41.83/6.86 | (5) segmentP(all_91_2, all_91_0)
% 41.83/6.86 | (6) segmentP(all_91_1, all_91_0)
% 41.83/6.86 | (7) $i(all_91_0)
% 41.83/6.86 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ segmentP(all_91_1, v0) | ~
% 41.83/6.86 | segmentP(all_91_2, v0) | ~ ssList(v0) | ~ neq(v0, nil))
% 41.83/6.86 |
% 41.83/6.87 | GROUND_INST: instantiating (8) with all_91_0, simplifying with (3), (4), (5),
% 41.83/6.87 | (6), (7) gives:
% 41.83/6.87 | (9) $false
% 41.83/6.87 |
% 41.83/6.87 | CLOSE: (9) is inconsistent.
% 41.83/6.87 |
% 41.83/6.87 End of proof
% 41.83/6.87 % SZS output end Proof for theBenchmark
% 41.83/6.87
% 41.83/6.87 6275ms
%------------------------------------------------------------------------------