%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC367+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 : n019.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:04 EDT 2023 % Result : Theorem 18.72s 3.54s % Output : Proof 32.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.14 % Problem : SWC367+1 : TPTP v8.1.2. Released v2.4.0. % 0.00/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.38 % Computer : n019.cluster.edu % 0.15/0.38 % Model : x86_64 x86_64 % 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.38 % Memory : 8042.1875MB % 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.38 % CPULimit : 300 % 0.15/0.38 % WCLimit : 300 % 0.15/0.38 % DateTime : Mon Aug 28 17:14:58 EDT 2023 % 0.15/0.38 % CPUTime : % 0.23/0.71 ________ _____ % 0.23/0.71 ___ __ \_________(_)________________________________ % 0.23/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.23/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.23/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.23/0.71 % 0.23/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.23/0.71 (2023-06-19) % 0.23/0.71 % 0.23/0.71 (c) Philipp Rümmer, 2009-2023 % 0.23/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.23/0.71 Amanda Stjerna. % 0.23/0.71 Free software under BSD-3-Clause. % 0.23/0.71 % 0.23/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.23/0.71 % 0.23/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.23/0.73 Running up to 7 provers in parallel. % 0.23/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.23/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.23/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.23/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.23/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.23/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.23/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.54/1.72 Prover 1: Preprocessing ... % 6.03/1.76 Prover 4: Preprocessing ... % 6.10/1.80 Prover 5: Preprocessing ... % 6.10/1.80 Prover 3: Preprocessing ... % 6.10/1.80 Prover 0: Preprocessing ... % 6.10/1.80 Prover 2: Preprocessing ... % 6.10/1.80 Prover 6: Preprocessing ... % 18.21/3.48 Prover 2: Constructing countermodel ... % 18.72/3.54 Prover 2: proved (2797ms) % 18.72/3.54 % 18.72/3.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.72/3.54 % 18.72/3.54 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 19.74/3.85 Prover 7: Preprocessing ... % 22.59/4.08 Prover 5: Constructing countermodel ... % 22.59/4.11 Prover 5: stopped % 22.59/4.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 23.19/4.16 Prover 3: Constructing countermodel ... % 23.19/4.17 Prover 1: Constructing countermodel ... % 23.19/4.17 Prover 3: stopped % 23.19/4.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 24.06/4.25 Prover 6: Proving ... % 24.21/4.29 Prover 6: stopped % 24.21/4.30 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 24.64/4.34 Prover 10: Preprocessing ... % 24.91/4.50 Prover 8: Preprocessing ... % 24.91/4.59 Prover 11: Preprocessing ... % 24.91/4.61 Prover 7: Constructing countermodel ... % 28.34/4.87 Prover 7: Found proof (size 7) % 28.34/4.87 Prover 7: proved (1323ms) % 28.34/4.87 Prover 1: stopped % 28.34/4.93 Prover 10: Constructing countermodel ... % 28.34/4.93 Prover 11: stopped % 29.19/4.99 Prover 10: stopped % 30.00/5.33 Prover 8: Warning: ignoring some quantifiers % 30.48/5.34 Prover 8: Constructing countermodel ... % 30.48/5.35 Prover 4: Constructing countermodel ... % 30.48/5.37 Prover 8: stopped % 30.48/5.40 Prover 4: stopped % 31.97/5.53 Prover 0: Proving ... % 31.97/5.54 Prover 0: stopped % 31.97/5.54 % 32.29/5.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 32.29/5.55 % 32.29/5.55 % SZS output start Proof for theBenchmark % 32.29/5.56 Assumptions after simplification: % 32.29/5.56 --------------------------------- % 32.29/5.56 % 32.29/5.56 (ax52) % 32.29/5.57 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ rearsegP(nil, v0) | ~ % 32.29/5.57 ssList(v0)) & ( ~ ssList(nil) | rearsegP(nil, nil)) % 32.29/5.57 % 32.29/5.57 (co1) % 32.29/5.57 $i(nil) & ssList(nil) & ~ rearsegP(nil, nil) % 32.29/5.57 % 32.29/5.57 Further assumptions not needed in the proof: % 32.29/5.57 -------------------------------------------- % 32.29/5.57 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 32.29/5.57 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 32.29/5.58 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 32.29/5.58 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax53, ax54, ax55, ax56, ax57, % 32.29/5.58 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 32.29/5.58 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, % 32.29/5.58 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 32.42/5.58 ax93, ax94, ax95 % 32.42/5.58 % 32.42/5.58 Those formulas are unsatisfiable: % 32.42/5.58 --------------------------------- % 32.42/5.58 % 32.42/5.58 Begin of proof % 32.42/5.58 | % 32.42/5.58 | ALPHA: (ax52) implies: % 32.42/5.58 | (1) ~ ssList(nil) | rearsegP(nil, nil) % 32.42/5.58 | % 32.42/5.58 | ALPHA: (co1) implies: % 32.42/5.58 | (2) ~ rearsegP(nil, nil) % 32.42/5.58 | (3) ssList(nil) % 32.42/5.58 | % 32.42/5.58 | BETA: splitting (1) gives: % 32.42/5.58 | % 32.42/5.58 | Case 1: % 32.42/5.58 | | % 32.42/5.58 | | (4) ~ ssList(nil) % 32.42/5.58 | | % 32.42/5.58 | | PRED_UNIFY: (3), (4) imply: % 32.42/5.58 | | (5) $false % 32.42/5.58 | | % 32.42/5.58 | | CLOSE: (5) is inconsistent. % 32.42/5.58 | | % 32.42/5.58 | Case 2: % 32.42/5.58 | | % 32.42/5.59 | | (6) rearsegP(nil, nil) % 32.42/5.59 | | % 32.42/5.59 | | PRED_UNIFY: (2), (6) imply: % 32.42/5.59 | | (7) $false % 32.42/5.59 | | % 32.42/5.59 | | CLOSE: (7) is inconsistent. % 32.42/5.59 | | % 32.42/5.59 | End of split % 32.42/5.59 | % 32.42/5.59 End of proof % 32.42/5.59 % SZS output end Proof for theBenchmark % 32.42/5.59 % 32.42/5.59 4877ms %------------------------------------------------------------------------------