%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC217+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:50:17 EDT 2023 % Result : Theorem 26.10s 4.18s % Output : Proof 33.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC217+1 : TPTP v8.1.2. Released v2.4.0. % 0.06/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:22:25 EDT 2023 % 0.12/0.33 % CPUTime : % 0.50/0.59 ________ _____ % 0.50/0.59 ___ __ \_________(_)________________________________ % 0.50/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.50/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.50/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.50/0.59 % 0.50/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.50/0.59 (2023-06-19) % 0.50/0.59 % 0.50/0.59 (c) Philipp Rümmer, 2009-2023 % 0.50/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.50/0.59 Amanda Stjerna. % 0.50/0.59 Free software under BSD-3-Clause. % 0.50/0.59 % 0.50/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.50/0.59 % 0.50/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.50/0.60 Running up to 7 provers in parallel. % 0.50/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.50/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.50/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.50/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.50/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.50/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.50/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.81/1.46 Prover 1: Preprocessing ... % 5.81/1.49 Prover 4: Preprocessing ... % 5.81/1.51 Prover 5: Preprocessing ... % 5.81/1.51 Prover 2: Preprocessing ... % 5.81/1.52 Prover 3: Preprocessing ... % 5.81/1.52 Prover 6: Preprocessing ... % 5.81/1.52 Prover 0: Preprocessing ... % 14.73/2.68 Prover 2: Proving ... % 15.70/2.79 Prover 5: Constructing countermodel ... % 15.70/2.81 Prover 1: Constructing countermodel ... % 15.70/2.83 Prover 3: Constructing countermodel ... % 16.47/2.91 Prover 6: Proving ... % 21.37/3.57 Prover 4: Constructing countermodel ... % 22.10/3.63 Prover 0: Proving ... % 26.10/4.17 Prover 3: proved (3565ms) % 26.10/4.18 % 26.10/4.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 26.10/4.18 % 26.10/4.18 Prover 5: stopped % 26.10/4.19 Prover 2: stopped % 26.10/4.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 26.10/4.19 Prover 6: stopped % 26.10/4.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 26.10/4.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 26.10/4.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 26.10/4.22 Prover 0: stopped % 26.81/4.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 28.15/4.43 Prover 7: Preprocessing ... % 28.37/4.45 Prover 10: Preprocessing ... % 28.37/4.47 Prover 8: Preprocessing ... % 28.37/4.48 Prover 11: Preprocessing ... % 28.37/4.51 Prover 13: Preprocessing ... % 30.07/4.69 Prover 10: Constructing countermodel ... % 30.07/4.71 Prover 7: Constructing countermodel ... % 30.72/4.82 Prover 10: Found proof (size 13) % 30.72/4.82 Prover 10: proved (633ms) % 30.72/4.82 Prover 4: stopped % 30.72/4.82 Prover 1: stopped % 30.72/4.82 Prover 7: stopped % 30.72/4.83 Prover 13: Constructing countermodel ... % 31.38/4.83 Prover 8: Warning: ignoring some quantifiers % 31.38/4.84 Prover 8: Constructing countermodel ... % 31.38/4.84 Prover 13: stopped % 31.38/4.85 Prover 8: stopped % 32.80/5.24 Prover 11: Constructing countermodel ... % 33.11/5.27 Prover 11: stopped % 33.11/5.27 % 33.11/5.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.11/5.27 % 33.11/5.27 % SZS output start Proof for theBenchmark % 33.22/5.28 Assumptions after simplification: % 33.22/5.28 --------------------------------- % 33.22/5.28 % 33.22/5.28 (ax15) % 33.22/5.29 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ ssList(v1) | % 33.22/5.29 ~ ssList(v0) | neq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | ~ % 33.22/5.29 neq(v0, v0)) % 33.22/5.29 % 33.22/5.29 (ax17) % 33.22/5.29 $i(nil) & ssList(nil) % 33.22/5.29 % 33.22/5.29 (ax39) % 33.22/5.29 $i(nil) & ~ singletonP(nil) % 33.22/5.29 % 33.22/5.29 (ax4) % 33.46/5.33 $i(nil) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v1, nil) = v0) | ~ $i(v1) | % 33.46/5.33 ~ $i(v0) | ~ ssList(v0) | ~ ssItem(v1) | singletonP(v0)) & ! [v0: $i] : ( % 33.46/5.33 ~ $i(v0) | ~ singletonP(v0) | ~ ssList(v0) | ? [v1: $i] : (cons(v1, nil) % 33.46/5.33 = v0 & $i(v1) & ssItem(v1))) % 33.46/5.33 % 33.46/5.33 (co1) % 33.46/5.33 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (cons(v2, nil) = v0 & % 33.46/5.33 $i(v2) & $i(v1) & $i(v0) & memberP(v1, v2) & ssList(v1) & ssList(v0) & % 33.46/5.33 neq(v1, nil) & ssItem(v2) & ~ neq(v0, nil) & ( ~ (v1 = nil) | v0 = nil)) % 33.46/5.33 % 33.46/5.33 Further assumptions not needed in the proof: % 33.46/5.33 -------------------------------------------- % 33.46/5.33 ax1, ax10, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, % 33.46/5.33 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 33.46/5.33 ax35, ax36, ax37, ax38, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48, % 33.46/5.33 ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax58, ax59, ax6, % 33.46/5.33 ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, ax71, % 33.46/5.33 ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, % 33.46/5.33 ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95 % 33.46/5.33 % 33.46/5.33 Those formulas are unsatisfiable: % 33.46/5.33 --------------------------------- % 33.46/5.33 % 33.46/5.33 Begin of proof % 33.46/5.34 | % 33.46/5.34 | ALPHA: (ax4) implies: % 33.46/5.34 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v1, nil) = v0) | ~ $i(v1) | ~ % 33.46/5.34 | $i(v0) | ~ ssList(v0) | ~ ssItem(v1) | singletonP(v0)) % 33.46/5.34 | % 33.46/5.34 | ALPHA: (ax15) implies: % 33.46/5.34 | (2) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 33.46/5.34 | ssList(v1) | ~ ssList(v0) | neq(v0, v1)) % 33.46/5.34 | % 33.46/5.34 | ALPHA: (ax17) implies: % 33.46/5.34 | (3) ssList(nil) % 33.46/5.34 | % 33.46/5.34 | ALPHA: (ax39) implies: % 33.46/5.34 | (4) ~ singletonP(nil) % 33.46/5.34 | % 33.46/5.34 | ALPHA: (co1) implies: % 33.46/5.34 | (5) $i(nil) % 33.46/5.34 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (cons(v2, nil) = v0 & $i(v2) % 33.46/5.34 | & $i(v1) & $i(v0) & memberP(v1, v2) & ssList(v1) & ssList(v0) & % 33.46/5.34 | neq(v1, nil) & ssItem(v2) & ~ neq(v0, nil) & ( ~ (v1 = nil) | v0 = % 33.46/5.34 | nil)) % 33.46/5.34 | % 33.57/5.35 | DELTA: instantiating (6) with fresh symbols all_91_0, all_91_1, all_91_2 % 33.57/5.35 | gives: % 33.57/5.35 | (7) cons(all_91_0, nil) = all_91_2 & $i(all_91_0) & $i(all_91_1) & % 33.57/5.35 | $i(all_91_2) & memberP(all_91_1, all_91_0) & ssList(all_91_1) & % 33.57/5.35 | ssList(all_91_2) & neq(all_91_1, nil) & ssItem(all_91_0) & ~ % 33.57/5.35 | neq(all_91_2, nil) & ( ~ (all_91_1 = nil) | all_91_2 = nil) % 33.57/5.35 | % 33.57/5.35 | ALPHA: (7) implies: % 33.57/5.35 | (8) ~ neq(all_91_2, nil) % 33.57/5.35 | (9) ssItem(all_91_0) % 33.57/5.35 | (10) ssList(all_91_2) % 33.57/5.35 | (11) $i(all_91_2) % 33.57/5.35 | (12) $i(all_91_0) % 33.57/5.35 | (13) cons(all_91_0, nil) = all_91_2 % 33.57/5.35 | % 33.57/5.35 | GROUND_INST: instantiating (2) with all_91_2, nil, simplifying with (3), (5), % 33.57/5.35 | (8), (10), (11) gives: % 33.57/5.35 | (14) all_91_2 = nil % 33.57/5.35 | % 33.57/5.35 | GROUND_INST: instantiating (1) with all_91_2, all_91_0, simplifying with (9), % 33.57/5.35 | (10), (11), (12), (13) gives: % 33.57/5.35 | (15) singletonP(all_91_2) % 33.57/5.35 | % 33.57/5.35 | REDUCE: (14), (15) imply: % 33.57/5.35 | (16) singletonP(nil) % 33.57/5.35 | % 33.57/5.35 | PRED_UNIFY: (4), (16) imply: % 33.57/5.35 | (17) $false % 33.57/5.36 | % 33.57/5.36 | CLOSE: (17) is inconsistent. % 33.57/5.36 | % 33.57/5.36 End of proof % 33.57/5.36 % SZS output end Proof for theBenchmark % 33.57/5.36 % 33.57/5.36 4766ms %------------------------------------------------------------------------------