%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC293+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 : n024.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:41 EDT 2023 % Result : Theorem 21.60s 3.61s % Output : Proof 34.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC293+1 : TPTP v8.1.2. Released v2.4.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n024.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:50:08 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.97/1.43 Prover 4: Preprocessing ... % 4.97/1.43 Prover 1: Preprocessing ... % 5.64/1.47 Prover 2: Preprocessing ... % 5.64/1.47 Prover 6: Preprocessing ... % 5.64/1.47 Prover 5: Preprocessing ... % 5.64/1.47 Prover 0: Preprocessing ... % 5.64/1.47 Prover 3: Preprocessing ... % 14.14/2.63 Prover 2: Proving ... % 14.89/2.73 Prover 5: Constructing countermodel ... % 15.18/2.83 Prover 6: Proving ... % 15.88/2.86 Prover 1: Constructing countermodel ... % 16.35/2.93 Prover 3: Constructing countermodel ... % 21.60/3.60 Prover 6: proved (2982ms) % 21.60/3.60 % 21.60/3.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.60/3.61 % 21.60/3.61 Prover 2: stopped % 21.60/3.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 21.60/3.62 Prover 5: stopped % 21.60/3.63 Prover 3: stopped % 21.60/3.64 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 21.60/3.64 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 22.08/3.65 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.37/3.83 Prover 4: Constructing countermodel ... % 23.37/3.83 Prover 7: Preprocessing ... % 23.37/3.84 Prover 8: Preprocessing ... % 23.37/3.86 Prover 10: Preprocessing ... % 23.37/3.88 Prover 11: Preprocessing ... % 24.62/4.06 Prover 0: Proving ... % 25.31/4.07 Prover 0: stopped % 25.31/4.07 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 25.71/4.14 Prover 10: Constructing countermodel ... % 25.71/4.18 Prover 7: Constructing countermodel ... % 25.71/4.19 Prover 13: Preprocessing ... % 28.69/4.52 Prover 8: Warning: ignoring some quantifiers % 28.82/4.54 Prover 13: Constructing countermodel ... % 28.82/4.55 Prover 8: Constructing countermodel ... % 33.49/5.18 Prover 7: Found proof (size 14) % 33.49/5.18 Prover 7: proved (1570ms) % 33.88/5.18 Prover 4: stopped % 33.88/5.18 Prover 1: stopped % 33.88/5.18 Prover 13: stopped % 33.88/5.18 Prover 10: stopped % 33.88/5.18 Prover 8: stopped % 34.21/5.31 Prover 11: Constructing countermodel ... % 34.42/5.33 Prover 11: stopped % 34.42/5.33 % 34.42/5.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 34.42/5.33 % 34.42/5.34 % SZS output start Proof for theBenchmark % 34.42/5.34 Assumptions after simplification: % 34.42/5.34 --------------------------------- % 34.42/5.34 % 34.42/5.34 (ax68) % 34.57/5.37 $i(nil) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | % 34.57/5.37 ~ ssItem(v0) | strictorderedP(v1)) % 34.57/5.37 % 34.57/5.37 (ax69) % 34.57/5.37 $i(nil) & strictorderedP(nil) % 34.57/5.37 % 34.57/5.37 (co1) % 34.57/5.37 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v2) & % 34.57/5.37 $i(v1) & $i(v0) & ssList(v1) & ssList(v0) & ~ strictorderedP(v0) & ((v3 = % 34.57/5.37 v0 & cons(v2, nil) = v0 & memberP(v1, v2) & ssItem(v2)) | (v1 = nil & v0 % 34.57/5.37 = nil))) % 34.57/5.37 % 34.57/5.37 Further assumptions not needed in the proof: % 34.57/5.37 -------------------------------------------- % 34.57/5.37 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 34.57/5.37 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 34.57/5.37 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 34.57/5.37 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 34.57/5.37 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax7, % 34.57/5.37 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 34.57/5.37 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 34.57/5.37 ax94, ax95 % 34.57/5.37 % 34.57/5.37 Those formulas are unsatisfiable: % 34.57/5.37 --------------------------------- % 34.57/5.37 % 34.57/5.37 Begin of proof % 34.57/5.37 | % 34.57/5.37 | ALPHA: (ax68) implies: % 34.57/5.37 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | ~ % 34.57/5.37 | ssItem(v0) | strictorderedP(v1)) % 34.57/5.37 | % 34.57/5.37 | ALPHA: (ax69) implies: % 34.57/5.37 | (2) strictorderedP(nil) % 34.57/5.37 | % 34.57/5.37 | ALPHA: (co1) implies: % 34.57/5.38 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v2) & % 34.57/5.38 | $i(v1) & $i(v0) & ssList(v1) & ssList(v0) & ~ strictorderedP(v0) & % 34.57/5.38 | ((v3 = v0 & cons(v2, nil) = v0 & memberP(v1, v2) & ssItem(v2)) | (v1 % 34.57/5.38 | = nil & v0 = nil))) % 34.57/5.38 | % 34.57/5.38 | DELTA: instantiating (3) with fresh symbols all_91_0, all_91_1, all_91_2, % 34.57/5.38 | all_91_3 gives: % 34.57/5.38 | (4) $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & ssList(all_91_2) & % 34.57/5.38 | ssList(all_91_3) & ~ strictorderedP(all_91_3) & ((all_91_0 = all_91_3 % 34.57/5.38 | & cons(all_91_1, nil) = all_91_3 & memberP(all_91_2, all_91_1) & % 34.57/5.38 | ssItem(all_91_1)) | (all_91_2 = nil & all_91_3 = nil)) % 34.57/5.38 | % 34.57/5.38 | ALPHA: (4) implies: % 34.57/5.38 | (5) ~ strictorderedP(all_91_3) % 34.57/5.38 | (6) $i(all_91_1) % 34.57/5.38 | (7) (all_91_0 = all_91_3 & cons(all_91_1, nil) = all_91_3 & % 34.57/5.38 | memberP(all_91_2, all_91_1) & ssItem(all_91_1)) | (all_91_2 = nil & % 34.57/5.38 | all_91_3 = nil) % 34.57/5.38 | % 34.57/5.38 | PRED_UNIFY: (2), (5) imply: % 34.57/5.38 | (8) ~ (all_91_3 = nil) % 34.57/5.38 | % 34.57/5.38 | BETA: splitting (7) gives: % 34.57/5.38 | % 34.57/5.38 | Case 1: % 34.57/5.38 | | % 34.57/5.38 | | (9) all_91_0 = all_91_3 & cons(all_91_1, nil) = all_91_3 & % 34.57/5.38 | | memberP(all_91_2, all_91_1) & ssItem(all_91_1) % 34.57/5.38 | | % 34.57/5.38 | | ALPHA: (9) implies: % 34.57/5.38 | | (10) ssItem(all_91_1) % 34.57/5.38 | | (11) cons(all_91_1, nil) = all_91_3 % 34.57/5.38 | | % 34.57/5.38 | | GROUND_INST: instantiating (1) with all_91_1, all_91_3, simplifying with % 34.57/5.38 | | (5), (6), (10), (11) gives: % 34.57/5.38 | | (12) $false % 34.57/5.38 | | % 34.57/5.38 | | CLOSE: (12) is inconsistent. % 34.57/5.38 | | % 34.57/5.38 | Case 2: % 34.57/5.38 | | % 34.57/5.38 | | (13) all_91_2 = nil & all_91_3 = nil % 34.57/5.38 | | % 34.57/5.38 | | ALPHA: (13) implies: % 34.57/5.38 | | (14) all_91_3 = nil % 34.57/5.38 | | % 34.57/5.38 | | REDUCE: (8), (14) imply: % 34.57/5.38 | | (15) $false % 34.57/5.38 | | % 34.57/5.38 | | CLOSE: (15) is inconsistent. % 34.57/5.38 | | % 34.57/5.38 | End of split % 34.57/5.38 | % 34.57/5.38 End of proof % 34.57/5.39 % SZS output end Proof for theBenchmark % 34.57/5.39 % 34.57/5.39 4798ms %------------------------------------------------------------------------------