TSTP Solution File: SWC047+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC047+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 : n005.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:22 EDT 2023
% Result : Theorem 23.34s 3.94s
% Output : Proof 32.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC047+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n005.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 18:47:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 6.56/1.63 Prover 1: Preprocessing ...
% 6.56/1.64 Prover 4: Preprocessing ...
% 6.56/1.65 Prover 3: Preprocessing ...
% 6.56/1.65 Prover 6: Preprocessing ...
% 6.56/1.65 Prover 5: Preprocessing ...
% 6.56/1.65 Prover 0: Preprocessing ...
% 6.56/1.65 Prover 2: Preprocessing ...
% 16.06/2.93 Prover 2: Proving ...
% 16.06/2.96 Prover 6: Proving ...
% 16.57/2.98 Prover 5: Constructing countermodel ...
% 16.57/3.01 Prover 1: Constructing countermodel ...
% 16.57/3.03 Prover 3: Constructing countermodel ...
% 21.33/3.63 Prover 4: Constructing countermodel ...
% 23.34/3.94 Prover 3: proved (3299ms)
% 23.34/3.94
% 23.34/3.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 23.34/3.94
% 23.34/3.95 Prover 0: Proving ...
% 23.34/3.95 Prover 2: stopped
% 23.34/3.95 Prover 6: stopped
% 23.34/3.95 Prover 0: stopped
% 23.34/3.96 Prover 5: stopped
% 23.34/3.96 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 23.34/3.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 23.34/3.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 23.34/3.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 23.34/3.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 25.83/4.26 Prover 7: Preprocessing ...
% 26.30/4.27 Prover 11: Preprocessing ...
% 26.30/4.31 Prover 8: Preprocessing ...
% 26.30/4.31 Prover 13: Preprocessing ...
% 26.30/4.31 Prover 10: Preprocessing ...
% 27.65/4.56 Prover 7: Constructing countermodel ...
% 27.65/4.56 Prover 10: Constructing countermodel ...
% 29.34/4.71 Prover 13: Constructing countermodel ...
% 30.71/4.84 Prover 8: Warning: ignoring some quantifiers
% 30.71/4.86 Prover 8: Constructing countermodel ...
% 30.96/4.89 Prover 10: Found proof (size 14)
% 30.96/4.89 Prover 10: proved (940ms)
% 30.96/4.89 Prover 4: stopped
% 30.96/4.89 Prover 7: stopped
% 30.96/4.89 Prover 1: stopped
% 30.96/4.90 Prover 13: stopped
% 30.96/4.90 Prover 8: stopped
% 32.16/5.23 Prover 11: Constructing countermodel ...
% 32.44/5.25 Prover 11: stopped
% 32.44/5.26
% 32.44/5.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 32.44/5.26
% 32.44/5.26 % SZS output start Proof for theBenchmark
% 32.44/5.26 Assumptions after simplification:
% 32.44/5.26 ---------------------------------
% 32.44/5.26
% 32.44/5.26 (ax17)
% 32.44/5.27 $i(nil) & ssList(nil)
% 32.44/5.27
% 32.44/5.27 (ax49)
% 32.44/5.27 ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | rearsegP(v0, v0))
% 32.44/5.27
% 32.44/5.27 (ax58)
% 32.44/5.27 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~
% 32.44/5.27 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil))
% 32.44/5.27
% 32.44/5.27 (co1)
% 32.44/5.27 $i(nil) & ? [v0: $i] : ($i(v0) & ssList(v0) & neq(v0, nil) & ! [v1: $i] : (
% 32.44/5.27 ~ $i(v1) | ~ rearsegP(v0, v1) | ~ ssList(v1) | ~ neq(v1, nil)))
% 32.44/5.27
% 32.44/5.27 Further assumptions not needed in the proof:
% 32.44/5.27 --------------------------------------------
% 32.44/5.27 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21,
% 32.44/5.27 ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33,
% 32.44/5.27 ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45,
% 32.44/5.27 ax46, ax47, ax48, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59,
% 32.44/5.27 ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70,
% 32.44/5.27 ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82,
% 32.44/5.27 ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94,
% 32.44/5.27 ax95
% 32.44/5.27
% 32.44/5.27 Those formulas are unsatisfiable:
% 32.44/5.27 ---------------------------------
% 32.44/5.27
% 32.44/5.27 Begin of proof
% 32.44/5.28 |
% 32.44/5.28 | ALPHA: (ax17) implies:
% 32.44/5.28 | (1) ssList(nil)
% 32.44/5.28 |
% 32.44/5.28 | ALPHA: (ax58) implies:
% 32.44/5.28 | (2) ~ ssList(nil) | segmentP(nil, nil)
% 32.44/5.28 |
% 32.44/5.28 | ALPHA: (co1) implies:
% 32.44/5.28 | (3) ? [v0: $i] : ($i(v0) & ssList(v0) & neq(v0, nil) & ! [v1: $i] : ( ~
% 32.44/5.28 | $i(v1) | ~ rearsegP(v0, v1) | ~ ssList(v1) | ~ neq(v1, nil)))
% 32.44/5.28 |
% 32.44/5.28 | DELTA: instantiating (3) with fresh symbol all_91_0 gives:
% 32.44/5.28 | (4) $i(all_91_0) & ssList(all_91_0) & neq(all_91_0, nil) & ! [v0: $i] : (
% 32.44/5.28 | ~ $i(v0) | ~ rearsegP(all_91_0, v0) | ~ ssList(v0) | ~ neq(v0,
% 32.44/5.28 | nil))
% 32.44/5.28 |
% 32.44/5.28 | ALPHA: (4) implies:
% 32.44/5.28 | (5) neq(all_91_0, nil)
% 32.44/5.28 | (6) ssList(all_91_0)
% 32.44/5.28 | (7) $i(all_91_0)
% 32.44/5.28 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ rearsegP(all_91_0, v0) | ~ ssList(v0) |
% 32.44/5.28 | ~ neq(v0, nil))
% 32.44/5.28 |
% 32.44/5.28 | BETA: splitting (2) gives:
% 32.44/5.28 |
% 32.44/5.28 | Case 1:
% 32.44/5.28 | |
% 32.44/5.28 | | (9) ~ ssList(nil)
% 32.44/5.28 | |
% 32.44/5.28 | | PRED_UNIFY: (1), (9) imply:
% 32.44/5.28 | | (10) $false
% 32.44/5.28 | |
% 32.44/5.28 | | CLOSE: (10) is inconsistent.
% 32.44/5.28 | |
% 32.44/5.28 | Case 2:
% 32.44/5.28 | |
% 32.44/5.28 | |
% 32.44/5.28 | | GROUND_INST: instantiating (ax49) with all_91_0, simplifying with (6), (7)
% 32.44/5.28 | | gives:
% 32.44/5.29 | | (11) rearsegP(all_91_0, all_91_0)
% 32.44/5.29 | |
% 32.44/5.29 | | GROUND_INST: instantiating (8) with all_91_0, simplifying with (5), (6),
% 32.44/5.29 | | (7), (11) gives:
% 32.44/5.29 | | (12) $false
% 32.44/5.29 | |
% 32.44/5.29 | | CLOSE: (12) is inconsistent.
% 32.44/5.29 | |
% 32.44/5.29 | End of split
% 32.44/5.29 |
% 32.44/5.29 End of proof
% 32.44/5.29 % SZS output end Proof for theBenchmark
% 32.44/5.29
% 32.44/5.29 4676ms
%------------------------------------------------------------------------------