%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC276+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 : n003.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:35 EDT 2023 % Result : Theorem 21.54s 3.64s % Output : Proof 33.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC276+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 : n003.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:29:25 EDT 2023 % 0.12/0.34 % CPUTime : % 0.49/0.63 ________ _____ % 0.49/0.63 ___ __ \_________(_)________________________________ % 0.49/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.49/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.49/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.49/0.63 % 0.49/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.49/0.63 (2023-06-19) % 0.49/0.63 % 0.49/0.63 (c) Philipp Rümmer, 2009-2023 % 0.49/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.49/0.63 Amanda Stjerna. % 0.49/0.63 Free software under BSD-3-Clause. % 0.49/0.63 % 0.49/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.49/0.63 % 0.49/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.49/0.64 Running up to 7 provers in parallel. % 0.70/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.92/1.49 Prover 1: Preprocessing ... % 5.57/1.50 Prover 4: Preprocessing ... % 5.57/1.52 Prover 5: Preprocessing ... % 5.57/1.52 Prover 2: Preprocessing ... % 5.57/1.53 Prover 3: Preprocessing ... % 5.57/1.54 Prover 0: Preprocessing ... % 5.57/1.55 Prover 6: Preprocessing ... % 14.56/2.74 Prover 2: Proving ... % 15.21/2.80 Prover 5: Constructing countermodel ... % 15.79/2.94 Prover 1: Constructing countermodel ... % 16.48/3.03 Prover 6: Proving ... % 16.48/3.03 Prover 3: Constructing countermodel ... % 21.54/3.63 Prover 6: proved (2982ms) % 21.54/3.64 % 21.54/3.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.54/3.64 % 21.54/3.64 Prover 3: stopped % 21.54/3.64 Prover 5: stopped % 21.54/3.64 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 21.54/3.64 Prover 2: stopped % 21.54/3.64 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 21.54/3.65 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 21.54/3.65 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 22.60/3.79 Prover 4: Constructing countermodel ... % 23.79/3.89 Prover 10: Preprocessing ... % 23.79/3.89 Prover 7: Preprocessing ... % 23.79/3.89 Prover 8: Preprocessing ... % 23.79/3.90 Prover 11: Preprocessing ... % 24.43/3.97 Prover 0: Proving ... % 24.43/3.98 Prover 0: stopped % 24.53/3.98 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 24.89/4.08 Prover 13: Preprocessing ... % 25.62/4.16 Prover 7: Constructing countermodel ... % 26.36/4.25 Prover 10: Constructing countermodel ... % 27.61/4.39 Prover 13: Constructing countermodel ... % 27.61/4.45 Prover 8: Warning: ignoring some quantifiers % 28.31/4.48 Prover 8: Constructing countermodel ... % 32.50/5.08 Prover 7: Found proof (size 14) % 32.50/5.08 Prover 7: proved (1441ms) % 32.50/5.08 Prover 4: stopped % 32.50/5.08 Prover 13: stopped % 32.50/5.08 Prover 10: stopped % 32.50/5.08 Prover 8: stopped % 32.50/5.08 Prover 1: stopped % 32.50/5.09 Prover 11: Constructing countermodel ... % 33.10/5.11 Prover 11: stopped % 33.10/5.11 % 33.10/5.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 33.10/5.11 % 33.10/5.11 % SZS output start Proof for theBenchmark % 33.10/5.12 Assumptions after simplification: % 33.10/5.12 --------------------------------- % 33.10/5.12 % 33.10/5.12 (ax65) % 33.10/5.14 $i(nil) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | % 33.10/5.14 ~ ssItem(v0) | totalorderedP(v1)) % 33.10/5.14 % 33.10/5.14 (ax66) % 33.10/5.14 $i(nil) & totalorderedP(nil) % 33.10/5.14 % 33.10/5.14 (co1) % 33.10/5.14 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v2) & % 33.10/5.14 $i(v1) & $i(v0) & ssList(v1) & ssList(v0) & ~ totalorderedP(v0) & ((v3 = v0 % 33.10/5.14 & cons(v2, nil) = v0 & memberP(v1, v2) & ssItem(v2)) | (v1 = nil & v0 = % 33.10/5.14 nil))) % 33.10/5.14 % 33.10/5.14 Further assumptions not needed in the proof: % 33.10/5.14 -------------------------------------------- % 33.10/5.14 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 33.10/5.14 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 33.10/5.14 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 33.10/5.14 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 33.10/5.14 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax67, ax68, ax69, ax7, % 33.10/5.14 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 33.10/5.14 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 33.10/5.14 ax94, ax95 % 33.10/5.14 % 33.10/5.14 Those formulas are unsatisfiable: % 33.10/5.14 --------------------------------- % 33.10/5.14 % 33.10/5.14 Begin of proof % 33.10/5.14 | % 33.10/5.14 | ALPHA: (ax65) implies: % 33.10/5.15 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | ~ % 33.10/5.15 | ssItem(v0) | totalorderedP(v1)) % 33.10/5.15 | % 33.10/5.15 | ALPHA: (ax66) implies: % 33.10/5.15 | (2) totalorderedP(nil) % 33.10/5.15 | % 33.10/5.15 | ALPHA: (co1) implies: % 33.10/5.15 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v2) & % 33.10/5.15 | $i(v1) & $i(v0) & ssList(v1) & ssList(v0) & ~ totalorderedP(v0) & % 33.10/5.15 | ((v3 = v0 & cons(v2, nil) = v0 & memberP(v1, v2) & ssItem(v2)) | (v1 % 33.10/5.15 | = nil & v0 = nil))) % 33.10/5.15 | % 33.10/5.15 | DELTA: instantiating (3) with fresh symbols all_91_0, all_91_1, all_91_2, % 33.10/5.15 | all_91_3 gives: % 33.10/5.15 | (4) $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & ssList(all_91_2) & % 33.10/5.15 | ssList(all_91_3) & ~ totalorderedP(all_91_3) & ((all_91_0 = all_91_3 & % 33.10/5.15 | cons(all_91_1, nil) = all_91_3 & memberP(all_91_2, all_91_1) & % 33.10/5.15 | ssItem(all_91_1)) | (all_91_2 = nil & all_91_3 = nil)) % 33.10/5.15 | % 33.10/5.15 | ALPHA: (4) implies: % 33.10/5.15 | (5) ~ totalorderedP(all_91_3) % 33.10/5.15 | (6) $i(all_91_1) % 33.10/5.15 | (7) (all_91_0 = all_91_3 & cons(all_91_1, nil) = all_91_3 & % 33.10/5.15 | memberP(all_91_2, all_91_1) & ssItem(all_91_1)) | (all_91_2 = nil & % 33.10/5.15 | all_91_3 = nil) % 33.10/5.15 | % 33.10/5.15 | PRED_UNIFY: (2), (5) imply: % 33.10/5.15 | (8) ~ (all_91_3 = nil) % 33.10/5.15 | % 33.10/5.15 | BETA: splitting (7) gives: % 33.10/5.15 | % 33.10/5.15 | Case 1: % 33.10/5.15 | | % 33.10/5.15 | | (9) all_91_0 = all_91_3 & cons(all_91_1, nil) = all_91_3 & % 33.10/5.15 | | memberP(all_91_2, all_91_1) & ssItem(all_91_1) % 33.10/5.15 | | % 33.10/5.15 | | ALPHA: (9) implies: % 33.10/5.15 | | (10) ssItem(all_91_1) % 33.10/5.15 | | (11) cons(all_91_1, nil) = all_91_3 % 33.10/5.15 | | % 33.10/5.15 | | GROUND_INST: instantiating (1) with all_91_1, all_91_3, simplifying with % 33.10/5.15 | | (5), (6), (10), (11) gives: % 33.10/5.15 | | (12) $false % 33.10/5.16 | | % 33.10/5.16 | | CLOSE: (12) is inconsistent. % 33.10/5.16 | | % 33.10/5.16 | Case 2: % 33.10/5.16 | | % 33.10/5.16 | | (13) all_91_2 = nil & all_91_3 = nil % 33.10/5.16 | | % 33.10/5.16 | | ALPHA: (13) implies: % 33.10/5.16 | | (14) all_91_3 = nil % 33.10/5.16 | | % 33.10/5.16 | | REDUCE: (8), (14) imply: % 33.10/5.16 | | (15) $false % 33.10/5.16 | | % 33.10/5.16 | | CLOSE: (15) is inconsistent. % 33.10/5.16 | | % 33.10/5.16 | End of split % 33.10/5.16 | % 33.10/5.16 End of proof % 33.10/5.16 % SZS output end Proof for theBenchmark % 33.10/5.16 % 33.10/5.16 4528ms %------------------------------------------------------------------------------