%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC401+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 : n029.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:15 EDT 2023 % Result : Theorem 141.13s 18.83s % Output : Proof 141.27s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWC401+1 : TPTP v8.1.2. Released v2.4.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon Aug 28 17:38:26 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.64/0.61 Running up to 7 provers in parallel. % 0.64/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.64/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.64/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.64/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.64/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.64/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.64/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.43/1.58 Prover 1: Preprocessing ... % 6.43/1.61 Prover 4: Preprocessing ... % 6.43/1.61 Prover 0: Preprocessing ... % 6.43/1.61 Prover 2: Preprocessing ... % 6.43/1.61 Prover 3: Preprocessing ... % 6.43/1.61 Prover 6: Preprocessing ... % 6.43/1.62 Prover 5: Preprocessing ... % 16.75/2.90 Prover 2: Proving ... % 16.75/2.97 Prover 5: Constructing countermodel ... % 17.74/3.04 Prover 1: Constructing countermodel ... % 17.74/3.04 Prover 3: Constructing countermodel ... % 18.46/3.16 Prover 6: Proving ... % 26.11/4.14 Prover 4: Constructing countermodel ... % 27.94/4.39 Prover 0: Proving ... % 74.70/10.35 Prover 2: stopped % 74.70/10.35 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 75.13/10.43 Prover 7: Preprocessing ... % 77.02/10.65 Prover 7: Constructing countermodel ... % 103.07/13.96 Prover 5: stopped % 103.37/13.99 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 104.30/14.12 Prover 8: Preprocessing ... % 106.24/14.37 Prover 8: Warning: ignoring some quantifiers % 106.24/14.39 Prover 8: Constructing countermodel ... % 118.59/15.97 Prover 1: stopped % 119.01/15.98 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 119.78/16.10 Prover 9: Preprocessing ... % 124.90/16.76 Prover 9: Constructing countermodel ... % 133.63/17.86 Prover 6: stopped % 133.63/17.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 134.32/17.96 Prover 10: Preprocessing ... % 135.36/18.09 Prover 10: Constructing countermodel ... % 140.64/18.82 Prover 10: Found proof (size 19) % 140.64/18.83 Prover 10: proved (960ms) % 141.13/18.83 Prover 9: stopped % 141.13/18.83 Prover 7: stopped % 141.13/18.83 Prover 0: stopped % 141.13/18.83 Prover 8: stopped % 141.13/18.83 Prover 3: stopped % 141.13/18.83 Prover 4: stopped % 141.13/18.83 % 141.13/18.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 141.13/18.83 % 141.13/18.84 % SZS output start Proof for theBenchmark % 141.13/18.84 Assumptions after simplification: % 141.13/18.84 --------------------------------- % 141.13/18.84 % 141.13/18.84 (ax17) % 141.13/18.84 $i(nil) & ssList(nil) % 141.13/18.84 % 141.13/18.84 (ax26) % 141.27/18.87 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v0, v1) = v2) | ~ $i(v1) | % 141.27/18.87 ~ $i(v0) | ~ ssList(v1) | ~ ssList(v0) | ssList(v2)) % 141.27/18.87 % 141.27/18.87 (ax36) % 141.27/18.87 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3) % 141.27/18.87 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v3, v0) | ~ ssList(v2) | % 141.27/18.87 ~ ssList(v1) | ~ ssItem(v0) | memberP(v2, v0) | memberP(v1, v0)) & ! [v0: % 141.27/18.87 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3) | ~ % 141.27/18.87 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v2, v0) | ~ ssList(v2) | ~ % 141.27/18.87 ssList(v1) | ~ ssItem(v0) | memberP(v3, v0)) & ! [v0: $i] : ! [v1: $i] : % 141.27/18.87 ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 141.27/18.87 $i(v0) | ~ memberP(v1, v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssItem(v0) % 141.27/18.87 | memberP(v3, v0)) % 141.27/18.87 % 141.27/18.87 (ax58) % 141.27/18.88 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 141.27/18.88 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 141.27/18.88 % 141.27/18.88 (ax7) % 141.27/18.88 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 141.27/18.88 (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~ % 141.27/18.88 $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ ssList(v1) | ~ % 141.27/18.88 ssList(v0) | segmentP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 141.27/18.88 $i(v0) | ~ segmentP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : % 141.27/18.88 ? [v3: $i] : ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) & % 141.27/18.88 $i(v3) & $i(v2) & ssList(v4) & ssList(v2))) % 141.27/18.88 % 141.27/18.88 (co1) % 141.27/18.88 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 141.27/18.88 totalorderedP(v0) & segmentP(v1, v0) & memberP(v0, v2) & ssList(v1) & % 141.27/18.88 ssList(v0) & ssItem(v2) & ~ memberP(v1, v2) & ! [v3: $i] : ( ~ $i(v3) | ~ % 141.27/18.88 totalorderedP(v3) | ~ segmentP(v3, v0) | ~ segmentP(v1, v3) | ~ % 141.27/18.88 ssList(v3) | ~ neq(v0, v3))) % 141.27/18.88 % 141.27/18.88 Further assumptions not needed in the proof: % 141.27/18.88 -------------------------------------------- % 141.27/18.88 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21, % 141.27/18.88 ax22, ax23, ax24, ax25, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 141.27/18.88 ax35, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, % 141.27/18.88 ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax6, % 141.27/18.88 ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax70, ax71, ax72, % 141.27/18.88 ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, ax84, % 141.27/18.88 ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95 % 141.27/18.88 % 141.27/18.88 Those formulas are unsatisfiable: % 141.27/18.88 --------------------------------- % 141.27/18.88 % 141.27/18.88 Begin of proof % 141.27/18.88 | % 141.27/18.88 | ALPHA: (ax7) implies: % 141.27/18.88 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ segmentP(v0, % 141.27/18.88 | v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : ? [v3: $i] : % 141.27/18.88 | ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) & $i(v3) & % 141.27/18.88 | $i(v2) & ssList(v4) & ssList(v2))) % 141.27/18.88 | % 141.27/18.88 | ALPHA: (ax17) implies: % 141.27/18.88 | (2) ssList(nil) % 141.27/18.88 | % 141.27/18.88 | ALPHA: (ax36) implies: % 141.27/18.89 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, % 141.27/18.89 | v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v1, % 141.27/18.89 | v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssItem(v0) | memberP(v3, % 141.27/18.89 | v0)) % 141.27/18.89 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (app(v1, % 141.27/18.89 | v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ memberP(v2, % 141.27/18.89 | v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssItem(v0) | memberP(v3, % 141.27/18.89 | v0)) % 141.27/18.89 | % 141.27/18.89 | ALPHA: (ax58) implies: % 141.27/18.89 | (5) ~ ssList(nil) | segmentP(nil, nil) % 141.27/18.89 | % 141.27/18.89 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1, all_91_2 % 141.27/18.89 | gives: % 141.27/18.89 | (6) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & totalorderedP(all_91_2) & % 141.27/18.89 | segmentP(all_91_1, all_91_2) & memberP(all_91_2, all_91_0) & % 141.27/18.89 | ssList(all_91_1) & ssList(all_91_2) & ssItem(all_91_0) & ~ % 141.27/18.89 | memberP(all_91_1, all_91_0) & ! [v0: $i] : ( ~ $i(v0) | ~ % 141.27/18.89 | totalorderedP(v0) | ~ segmentP(v0, all_91_2) | ~ segmentP(all_91_1, % 141.27/18.89 | v0) | ~ ssList(v0) | ~ neq(all_91_2, v0)) % 141.27/18.89 | % 141.27/18.89 | ALPHA: (6) implies: % 141.27/18.89 | (7) ~ memberP(all_91_1, all_91_0) % 141.27/18.89 | (8) ssItem(all_91_0) % 141.27/18.89 | (9) ssList(all_91_2) % 141.27/18.89 | (10) ssList(all_91_1) % 141.27/18.89 | (11) memberP(all_91_2, all_91_0) % 141.27/18.89 | (12) segmentP(all_91_1, all_91_2) % 141.27/18.89 | (13) $i(all_91_2) % 141.27/18.89 | (14) $i(all_91_1) % 141.27/18.89 | (15) $i(all_91_0) % 141.27/18.89 | % 141.27/18.89 | BETA: splitting (5) gives: % 141.27/18.89 | % 141.27/18.89 | Case 1: % 141.27/18.89 | | % 141.27/18.89 | | (16) ~ ssList(nil) % 141.27/18.89 | | % 141.27/18.89 | | PRED_UNIFY: (2), (16) imply: % 141.27/18.89 | | (17) $false % 141.27/18.89 | | % 141.27/18.89 | | CLOSE: (17) is inconsistent. % 141.27/18.89 | | % 141.27/18.89 | Case 2: % 141.27/18.89 | | % 141.27/18.89 | | % 141.27/18.89 | | GROUND_INST: instantiating (1) with all_91_1, all_91_2, simplifying with % 141.27/18.89 | | (9), (10), (12), (13), (14) gives: % 141.27/18.89 | | (18) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v1, v2) = all_91_1 & % 141.27/18.89 | | app(v0, all_91_2) = v1 & $i(v2) & $i(v1) & $i(v0) & ssList(v2) & % 141.27/18.89 | | ssList(v0)) % 141.27/18.89 | | % 141.27/18.89 | | DELTA: instantiating (18) with fresh symbols all_116_0, all_116_1, all_116_2 % 141.27/18.89 | | gives: % 141.27/18.89 | | (19) app(all_116_1, all_116_0) = all_91_1 & app(all_116_2, all_91_2) = % 141.27/18.89 | | all_116_1 & $i(all_116_0) & $i(all_116_1) & $i(all_116_2) & % 141.27/18.89 | | ssList(all_116_0) & ssList(all_116_2) % 141.27/18.89 | | % 141.27/18.89 | | ALPHA: (19) implies: % 141.27/18.90 | | (20) ssList(all_116_2) % 141.27/18.90 | | (21) ssList(all_116_0) % 141.27/18.90 | | (22) $i(all_116_2) % 141.27/18.90 | | (23) $i(all_116_1) % 141.27/18.90 | | (24) $i(all_116_0) % 141.27/18.90 | | (25) app(all_116_2, all_91_2) = all_116_1 % 141.27/18.90 | | (26) app(all_116_1, all_116_0) = all_91_1 % 141.27/18.90 | | % 141.27/18.90 | | GROUND_INST: instantiating (4) with all_91_0, all_116_2, all_91_2, % 141.27/18.90 | | all_116_1, simplifying with (8), (9), (11), (13), (15), (20), % 141.27/18.90 | | (22), (25) gives: % 141.27/18.90 | | (27) memberP(all_116_1, all_91_0) % 141.27/18.90 | | % 141.27/18.90 | | GROUND_INST: instantiating (ax26) with all_116_2, all_91_2, all_116_1, % 141.27/18.90 | | simplifying with (9), (13), (20), (22), (25) gives: % 141.27/18.90 | | (28) ssList(all_116_1) % 141.27/18.90 | | % 141.27/18.90 | | GROUND_INST: instantiating (3) with all_91_0, all_116_1, all_116_0, % 141.27/18.90 | | all_91_1, simplifying with (7), (8), (15), (21), (23), (24), % 141.27/18.90 | | (26), (27), (28) gives: % 141.27/18.90 | | (29) $false % 141.27/18.90 | | % 141.27/18.90 | | CLOSE: (29) is inconsistent. % 141.27/18.90 | | % 141.27/18.90 | End of split % 141.27/18.90 | % 141.27/18.90 End of proof % 141.27/18.90 % SZS output end Proof for theBenchmark % 141.27/18.90 % 141.27/18.90 18302ms %------------------------------------------------------------------------------