TSTP Solution File: SWC333+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC333+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 : n014.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:50:53 EDT 2023
% Result : Theorem 19.07s 3.48s
% Output : Proof 28.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 14:57:45 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.74/1.41 Prover 1: Preprocessing ...
% 4.74/1.41 Prover 4: Preprocessing ...
% 4.74/1.46 Prover 5: Preprocessing ...
% 4.74/1.46 Prover 3: Preprocessing ...
% 4.74/1.46 Prover 2: Preprocessing ...
% 4.74/1.46 Prover 0: Preprocessing ...
% 4.74/1.47 Prover 6: Preprocessing ...
% 14.85/2.80 Prover 2: Proving ...
% 14.85/2.87 Prover 5: Constructing countermodel ...
% 14.85/2.88 Prover 1: Constructing countermodel ...
% 15.89/2.93 Prover 3: Constructing countermodel ...
% 15.89/2.94 Prover 6: Proving ...
% 19.07/3.48 Prover 3: proved (2834ms)
% 19.07/3.48
% 19.07/3.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.07/3.48
% 19.07/3.48 Prover 5: stopped
% 20.08/3.49 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 20.08/3.49 Prover 6: stopped
% 20.08/3.49 Prover 2: stopped
% 20.08/3.49 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 20.08/3.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 20.08/3.49 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 22.09/3.73 Prover 7: Preprocessing ...
% 22.09/3.74 Prover 4: Constructing countermodel ...
% 22.09/3.77 Prover 11: Preprocessing ...
% 22.49/3.77 Prover 0: Proving ...
% 22.49/3.77 Prover 8: Preprocessing ...
% 22.49/3.79 Prover 10: Preprocessing ...
% 22.49/3.80 Prover 0: stopped
% 22.49/3.80 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 23.33/3.91 Prover 13: Preprocessing ...
% 24.37/4.11 Prover 7: Constructing countermodel ...
% 24.37/4.13 Prover 10: Constructing countermodel ...
% 25.41/4.23 Prover 13: Constructing countermodel ...
% 26.64/4.35 Prover 10: Found proof (size 5)
% 26.64/4.35 Prover 10: proved (863ms)
% 26.64/4.35 Prover 1: stopped
% 26.64/4.35 Prover 4: stopped
% 26.64/4.35 Prover 7: stopped
% 26.64/4.36 Prover 13: stopped
% 26.64/4.40 Prover 8: Warning: ignoring some quantifiers
% 27.13/4.41 Prover 8: Constructing countermodel ...
% 27.13/4.42 Prover 8: stopped
% 28.36/4.72 Prover 11: Constructing countermodel ...
% 28.36/4.74 Prover 11: stopped
% 28.36/4.74
% 28.36/4.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.36/4.74
% 28.36/4.75 % SZS output start Proof for theBenchmark
% 28.36/4.76 Assumptions after simplification:
% 28.36/4.76 ---------------------------------
% 28.36/4.76
% 28.36/4.76 (co1)
% 28.36/4.76 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) &
% 28.36/4.76 totalorderedP(v2) & totalorderedP(v0) & segmentP(v2, v0) & segmentP(v1, v2)
% 28.36/4.76 & segmentP(v1, v0) & ssList(v2) & ssList(v1) & ssList(v0) & neq(v0, v2) & !
% 28.36/4.76 [v3: $i] : ( ~ $i(v3) | ~ totalorderedP(v3) | ~ segmentP(v3, v0) | ~
% 28.36/4.76 segmentP(v1, v3) | ~ ssList(v3) | ~ neq(v0, v3)))
% 28.36/4.76
% 28.36/4.76 Further assumptions not needed in the proof:
% 28.36/4.76 --------------------------------------------
% 28.36/4.76 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 28.36/4.76 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 28.36/4.77 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 28.36/4.77 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 28.36/4.77 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 28.36/4.77 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8,
% 28.36/4.77 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91,
% 28.36/4.77 ax92, ax93, ax94, ax95
% 28.36/4.77
% 28.36/4.77 Those formulas are unsatisfiable:
% 28.36/4.77 ---------------------------------
% 28.36/4.77
% 28.36/4.77 Begin of proof
% 28.36/4.77 |
% 28.36/4.77 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1, all_91_2
% 28.36/4.77 | gives:
% 28.36/4.77 | (1) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & totalorderedP(all_91_0) &
% 28.36/4.77 | totalorderedP(all_91_2) & segmentP(all_91_0, all_91_2) &
% 28.36/4.77 | segmentP(all_91_1, all_91_0) & segmentP(all_91_1, all_91_2) &
% 28.36/4.77 | ssList(all_91_0) & ssList(all_91_1) & ssList(all_91_2) & neq(all_91_2,
% 28.36/4.77 | all_91_0) & ! [v0: $i] : ( ~ $i(v0) | ~ totalorderedP(v0) | ~
% 28.36/4.77 | segmentP(v0, all_91_2) | ~ segmentP(all_91_1, v0) | ~ ssList(v0) |
% 28.36/4.77 | ~ neq(all_91_2, v0))
% 28.36/4.77 |
% 28.36/4.77 | ALPHA: (1) implies:
% 28.36/4.77 | (2) neq(all_91_2, all_91_0)
% 28.36/4.77 | (3) ssList(all_91_0)
% 28.36/4.77 | (4) segmentP(all_91_1, all_91_0)
% 28.36/4.77 | (5) segmentP(all_91_0, all_91_2)
% 28.36/4.77 | (6) totalorderedP(all_91_0)
% 28.36/4.77 | (7) $i(all_91_0)
% 28.36/4.78 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ totalorderedP(v0) | ~ segmentP(v0,
% 28.36/4.78 | all_91_2) | ~ segmentP(all_91_1, v0) | ~ ssList(v0) | ~
% 28.36/4.78 | neq(all_91_2, v0))
% 28.36/4.78 |
% 28.36/4.78 | GROUND_INST: instantiating (8) with all_91_0, simplifying with (2), (3), (4),
% 28.36/4.78 | (5), (6), (7) gives:
% 28.36/4.78 | (9) $false
% 28.36/4.78 |
% 28.36/4.78 | CLOSE: (9) is inconsistent.
% 28.36/4.78 |
% 28.36/4.78 End of proof
% 28.36/4.78 % SZS output end Proof for theBenchmark
% 28.36/4.78
% 28.36/4.78 4159ms
%------------------------------------------------------------------------------