%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC051+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 : n007.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:49:24 EDT 2023 % Result : Theorem 25.54s 4.45s % Output : Proof 30.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC051+1 : TPTP v8.1.2. Released v2.4.0. % 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n007.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 14:56:12 EDT 2023 % 0.12/0.34 % CPUTime : % 0.53/0.61 ________ _____ % 0.53/0.61 ___ __ \_________(_)________________________________ % 0.53/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.53/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.53/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.53/0.61 % 0.53/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.53/0.61 (2023-06-19) % 0.53/0.61 % 0.53/0.61 (c) Philipp Rümmer, 2009-2023 % 0.53/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.53/0.61 Amanda Stjerna. % 0.53/0.61 Free software under BSD-3-Clause. % 0.53/0.61 % 0.53/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.53/0.61 % 0.53/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.53/0.63 Running up to 7 provers in parallel. % 0.74/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.74/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.74/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.74/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.74/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.74/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.74/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.13/1.47 Prover 1: Preprocessing ... % 5.13/1.49 Prover 2: Preprocessing ... % 5.13/1.49 Prover 0: Preprocessing ... % 5.13/1.49 Prover 5: Preprocessing ... % 5.13/1.50 Prover 3: Preprocessing ... % 5.13/1.50 Prover 6: Preprocessing ... % 5.13/1.51 Prover 4: Preprocessing ... % 14.80/2.90 Prover 2: Proving ... % 15.15/2.95 Prover 5: Constructing countermodel ... % 15.61/3.02 Prover 1: Constructing countermodel ... % 15.61/3.02 Prover 6: Proving ... % 15.97/3.07 Prover 3: Constructing countermodel ... % 20.17/3.74 Prover 4: Constructing countermodel ... % 21.43/3.87 Prover 0: Proving ... % 25.05/4.45 Prover 3: proved (3812ms) % 25.05/4.45 % 25.54/4.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 25.54/4.45 % 25.54/4.45 Prover 5: stopped % 25.54/4.46 Prover 2: stopped % 25.54/4.47 Prover 6: stopped % 25.71/4.49 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 25.71/4.49 Prover 0: stopped % 25.71/4.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 25.71/4.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 25.71/4.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 25.71/4.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 26.96/4.72 Prover 8: Preprocessing ... % 27.51/4.77 Prover 7: Preprocessing ... % 27.70/4.78 Prover 10: Preprocessing ... % 27.70/4.82 Prover 13: Preprocessing ... % 28.02/4.84 Prover 11: Preprocessing ... % 29.09/5.00 Prover 7: Constructing countermodel ... % 29.09/5.02 Prover 10: Constructing countermodel ... % 29.76/5.11 Prover 7: Found proof (size 8) % 29.76/5.11 Prover 7: proved (661ms) % 29.76/5.11 Prover 1: stopped % 30.04/5.11 Prover 11: stopped % 30.04/5.12 Prover 10: stopped % 30.04/5.12 Prover 4: stopped % 30.14/5.18 Prover 13: Constructing countermodel ... % 30.14/5.19 Prover 8: Warning: ignoring some quantifiers % 30.14/5.19 Prover 13: stopped % 30.14/5.20 Prover 8: Constructing countermodel ... % 30.14/5.21 Prover 8: stopped % 30.14/5.21 % 30.14/5.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 30.14/5.21 % 30.14/5.21 % SZS output start Proof for theBenchmark % 30.55/5.22 Assumptions after simplification: % 30.55/5.22 --------------------------------- % 30.55/5.22 % 30.55/5.22 (ax49) % 30.55/5.22 ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | rearsegP(v0, v0)) % 30.55/5.22 % 30.55/5.22 (co1) % 30.55/5.23 $i(nil) & ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & rearsegP(v1, v0) & % 30.55/5.23 ssList(v1) & ssList(v0) & neq(v1, nil) & neq(v0, nil) & ! [v2: $i] : ( ~ % 30.55/5.23 $i(v2) | ~ rearsegP(v1, v2) | ~ rearsegP(v0, v2) | ~ ssList(v2) | ~ % 30.55/5.23 neq(v2, nil)) & ( ~ (v1 = nil) | v0 = nil)) % 30.55/5.23 % 30.55/5.23 Further assumptions not needed in the proof: % 30.55/5.23 -------------------------------------------- % 30.55/5.23 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 30.55/5.23 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 30.55/5.23 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 30.55/5.23 ax45, ax46, ax47, ax48, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, % 30.55/5.23 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 30.55/5.23 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, % 30.55/5.23 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 30.55/5.23 ax93, ax94, ax95 % 30.55/5.23 % 30.55/5.23 Those formulas are unsatisfiable: % 30.55/5.23 --------------------------------- % 30.55/5.23 % 30.55/5.23 Begin of proof % 30.55/5.23 | % 30.55/5.23 | ALPHA: (co1) implies: % 30.55/5.23 | (1) ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & rearsegP(v1, v0) & % 30.55/5.23 | ssList(v1) & ssList(v0) & neq(v1, nil) & neq(v0, nil) & ! [v2: $i] : % 30.55/5.23 | ( ~ $i(v2) | ~ rearsegP(v1, v2) | ~ rearsegP(v0, v2) | ~ % 30.55/5.23 | ssList(v2) | ~ neq(v2, nil)) & ( ~ (v1 = nil) | v0 = nil)) % 30.55/5.23 | % 30.55/5.23 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1 gives: % 30.55/5.23 | (2) $i(all_91_0) & $i(all_91_1) & rearsegP(all_91_0, all_91_1) & % 30.55/5.23 | ssList(all_91_0) & ssList(all_91_1) & neq(all_91_0, nil) & % 30.55/5.23 | neq(all_91_1, nil) & ! [v0: $i] : ( ~ $i(v0) | ~ rearsegP(all_91_0, % 30.55/5.23 | v0) | ~ rearsegP(all_91_1, v0) | ~ ssList(v0) | ~ neq(v0, nil)) % 30.55/5.23 | & ( ~ (all_91_0 = nil) | all_91_1 = nil) % 30.55/5.23 | % 30.55/5.23 | ALPHA: (2) implies: % 30.55/5.23 | (3) neq(all_91_1, nil) % 30.55/5.23 | (4) ssList(all_91_1) % 30.55/5.24 | (5) rearsegP(all_91_0, all_91_1) % 30.55/5.24 | (6) $i(all_91_1) % 30.55/5.24 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ rearsegP(all_91_0, v0) | ~ % 30.55/5.24 | rearsegP(all_91_1, v0) | ~ ssList(v0) | ~ neq(v0, nil)) % 30.55/5.24 | % 30.55/5.24 | GROUND_INST: instantiating (ax49) with all_91_1, simplifying with (4), (6) % 30.55/5.24 | gives: % 30.55/5.24 | (8) rearsegP(all_91_1, all_91_1) % 30.55/5.24 | % 30.55/5.24 | GROUND_INST: instantiating (7) with all_91_1, simplifying with (3), (4), (5), % 30.55/5.24 | (6) gives: % 30.55/5.24 | (9) ~ rearsegP(all_91_1, all_91_1) % 30.55/5.24 | % 30.55/5.24 | PRED_UNIFY: (8), (9) imply: % 30.55/5.24 | (10) $false % 30.55/5.24 | % 30.55/5.24 | CLOSE: (10) is inconsistent. % 30.55/5.24 | % 30.55/5.24 End of proof % 30.55/5.24 % SZS output end Proof for theBenchmark % 30.55/5.24 % 30.55/5.24 4624ms %------------------------------------------------------------------------------