TSTP Solution File: SWC381+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC381+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 : n023.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:08 EDT 2023
% Result : Theorem 20.07s 3.36s
% Output : Proof 28.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC381+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n023.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 15:16:40 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.55/0.62 ________ _____
% 0.55/0.62 ___ __ \_________(_)________________________________
% 0.55/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.55/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.55/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.55/0.62
% 0.55/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.55/0.62 (2023-06-19)
% 0.55/0.62
% 0.55/0.62 (c) Philipp Rümmer, 2009-2023
% 0.55/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.55/0.62 Amanda Stjerna.
% 0.55/0.62 Free software under BSD-3-Clause.
% 0.55/0.62
% 0.55/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.55/0.62
% 0.55/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.64 Running up to 7 provers in parallel.
% 0.68/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.68/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.68/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.68/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.68/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.68/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.68/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.01/1.44 Prover 4: Preprocessing ...
% 5.54/1.45 Prover 1: Preprocessing ...
% 5.74/1.49 Prover 5: Preprocessing ...
% 5.74/1.49 Prover 3: Preprocessing ...
% 5.74/1.49 Prover 2: Preprocessing ...
% 5.74/1.49 Prover 0: Preprocessing ...
% 5.74/1.49 Prover 6: Preprocessing ...
% 14.79/2.66 Prover 2: Proving ...
% 14.85/2.70 Prover 5: Constructing countermodel ...
% 15.48/2.81 Prover 1: Constructing countermodel ...
% 16.15/2.84 Prover 6: Proving ...
% 16.97/2.97 Prover 3: Constructing countermodel ...
% 19.73/3.35 Prover 3: proved (2702ms)
% 19.73/3.36
% 20.07/3.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.07/3.36
% 20.07/3.36 Prover 5: stopped
% 20.07/3.37 Prover 2: stopped
% 20.07/3.37 Prover 6: stopped
% 20.07/3.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 20.07/3.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 20.07/3.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 20.07/3.38 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 21.55/3.57 Prover 0: Proving ...
% 21.55/3.58 Prover 4: Constructing countermodel ...
% 21.55/3.59 Prover 11: Preprocessing ...
% 21.55/3.59 Prover 0: stopped
% 21.55/3.61 Prover 7: Preprocessing ...
% 21.55/3.61 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 21.55/3.61 Prover 8: Preprocessing ...
% 22.03/3.66 Prover 10: Preprocessing ...
% 22.37/3.73 Prover 13: Preprocessing ...
% 23.32/3.81 Prover 7: Constructing countermodel ...
% 23.83/3.86 Prover 10: Constructing countermodel ...
% 24.70/3.98 Prover 8: Warning: ignoring some quantifiers
% 24.70/3.99 Prover 8: Constructing countermodel ...
% 24.70/4.02 Prover 13: Constructing countermodel ...
% 25.60/4.11 Prover 10: Found proof (size 6)
% 25.60/4.11 Prover 10: proved (740ms)
% 25.60/4.12 Prover 4: stopped
% 25.60/4.12 Prover 13: stopped
% 25.60/4.12 Prover 7: stopped
% 25.60/4.12 Prover 1: stopped
% 25.60/4.12 Prover 8: stopped
% 27.59/4.53 Prover 11: Constructing countermodel ...
% 27.69/4.56 Prover 11: stopped
% 27.69/4.56
% 27.69/4.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.69/4.56
% 27.69/4.56 % SZS output start Proof for theBenchmark
% 27.69/4.57 Assumptions after simplification:
% 27.69/4.57 ---------------------------------
% 27.69/4.57
% 27.69/4.57 (co1)
% 27.69/4.62 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (cons(v2, nil) = v0 &
% 27.69/4.62 $i(v2) & $i(v1) & $i(v0) & memberP(v1, v2) & ssList(v1) & ssList(v0) &
% 27.69/4.62 neq(v1, nil) & ssItem(v2) & ! [v3: $i] : ( ~ (cons(v3, nil) = v0) | ~
% 27.69/4.62 $i(v3) | ~ memberP(v1, v3) | ~ ssItem(v3)))
% 27.69/4.62
% 27.69/4.62 Further assumptions not needed in the proof:
% 27.69/4.62 --------------------------------------------
% 27.69/4.62 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 27.69/4.62 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 27.69/4.62 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44,
% 27.69/4.62 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56,
% 27.69/4.62 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68,
% 27.69/4.62 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8,
% 27.69/4.62 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91,
% 27.69/4.62 ax92, ax93, ax94, ax95
% 27.69/4.62
% 27.69/4.62 Those formulas are unsatisfiable:
% 27.69/4.62 ---------------------------------
% 27.69/4.62
% 27.69/4.62 Begin of proof
% 28.02/4.62 |
% 28.02/4.62 | ALPHA: (co1) implies:
% 28.02/4.63 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (cons(v2, nil) = v0 & $i(v2)
% 28.02/4.63 | & $i(v1) & $i(v0) & memberP(v1, v2) & ssList(v1) & ssList(v0) &
% 28.02/4.63 | neq(v1, nil) & ssItem(v2) & ! [v3: $i] : ( ~ (cons(v3, nil) = v0) |
% 28.02/4.63 | ~ $i(v3) | ~ memberP(v1, v3) | ~ ssItem(v3)))
% 28.02/4.63 |
% 28.02/4.63 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2
% 28.02/4.63 | gives:
% 28.02/4.63 | (2) cons(all_91_0, nil) = all_91_2 & $i(all_91_0) & $i(all_91_1) &
% 28.02/4.63 | $i(all_91_2) & memberP(all_91_1, all_91_0) & ssList(all_91_1) &
% 28.02/4.63 | ssList(all_91_2) & neq(all_91_1, nil) & ssItem(all_91_0) & ! [v0: $i]
% 28.02/4.63 | : ( ~ (cons(v0, nil) = all_91_2) | ~ $i(v0) | ~ memberP(all_91_1, v0)
% 28.02/4.63 | | ~ ssItem(v0))
% 28.02/4.63 |
% 28.02/4.63 | ALPHA: (2) implies:
% 28.02/4.63 | (3) ssItem(all_91_0)
% 28.02/4.63 | (4) memberP(all_91_1, all_91_0)
% 28.02/4.63 | (5) $i(all_91_0)
% 28.02/4.64 | (6) cons(all_91_0, nil) = all_91_2
% 28.02/4.64 | (7) ! [v0: $i] : ( ~ (cons(v0, nil) = all_91_2) | ~ $i(v0) | ~
% 28.02/4.64 | memberP(all_91_1, v0) | ~ ssItem(v0))
% 28.02/4.64 |
% 28.02/4.64 | GROUND_INST: instantiating (7) with all_91_0, simplifying with (3), (4), (5),
% 28.02/4.64 | (6) gives:
% 28.02/4.64 | (8) $false
% 28.02/4.64 |
% 28.02/4.64 | CLOSE: (8) is inconsistent.
% 28.02/4.64 |
% 28.02/4.64 End of proof
% 28.02/4.64 % SZS output end Proof for theBenchmark
% 28.02/4.64
% 28.02/4.64 4018ms
%------------------------------------------------------------------------------