%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC349+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 : n018.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:58 EDT 2023 % Result : Theorem 19.55s 3.42s % Output : Proof 30.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWC349+1 : TPTP v8.1.2. Released v2.4.0. % 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Mon Aug 28 18:55:32 EDT 2023 % 0.13/0.33 % 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 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 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 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.70/1.45 Prover 1: Preprocessing ... % 6.10/1.51 Prover 4: Preprocessing ... % 6.10/1.53 Prover 3: Preprocessing ... % 6.10/1.53 Prover 0: Preprocessing ... % 6.10/1.53 Prover 6: Preprocessing ... % 6.10/1.53 Prover 2: Preprocessing ... % 6.10/1.53 Prover 5: Preprocessing ... % 14.62/2.79 Prover 2: Proving ... % 14.62/2.79 Prover 5: Constructing countermodel ... % 16.41/2.94 Prover 1: Constructing countermodel ... % 16.41/2.95 Prover 6: Proving ... % 17.48/3.05 Prover 3: Constructing countermodel ... % 19.55/3.41 Prover 3: proved (2795ms) % 19.55/3.41 % 19.55/3.42 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 19.55/3.42 % 20.07/3.43 Prover 2: stopped % 20.07/3.43 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 20.07/3.43 Prover 6: stopped % 20.07/3.43 Prover 5: stopped % 20.07/3.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 20.07/3.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.07/3.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 22.22/3.66 Prover 10: Preprocessing ... % 22.33/3.67 Prover 8: Preprocessing ... % 22.33/3.68 Prover 7: Preprocessing ... % 22.85/3.75 Prover 11: Preprocessing ... % 24.61/3.97 Prover 4: Constructing countermodel ... % 24.61/4.01 Prover 10: Constructing countermodel ... % 24.61/4.03 Prover 7: Constructing countermodel ... % 25.94/4.17 Prover 0: Proving ... % 25.94/4.18 Prover 0: stopped % 25.94/4.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 27.00/4.29 Prover 8: Warning: ignoring some quantifiers % 27.00/4.34 Prover 7: Found proof (size 7) % 27.00/4.34 Prover 7: proved (913ms) % 27.00/4.34 Prover 4: stopped % 27.00/4.34 Prover 1: stopped % 27.00/4.34 Prover 10: Found proof (size 7) % 27.00/4.34 Prover 10: proved (909ms) % 27.50/4.35 Prover 8: Constructing countermodel ... % 27.50/4.35 Prover 13: Preprocessing ... % 27.62/4.37 Prover 8: stopped % 27.62/4.40 Prover 13: stopped % 29.68/4.89 Prover 11: Constructing countermodel ... % 29.68/4.92 Prover 11: stopped % 29.68/4.92 % 29.68/4.92 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 29.68/4.92 % 29.68/4.93 % SZS output start Proof for theBenchmark % 30.06/4.94 Assumptions after simplification: % 30.06/4.94 --------------------------------- % 30.06/4.94 % 30.06/4.94 (ax45) % 30.06/4.94 $i(nil) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | frontsegP(v0, nil)) % 30.06/4.94 % 30.06/4.94 (co1) % 30.06/4.94 $i(nil) & ? [v0: $i] : ($i(v0) & ssList(v0) & ssList(nil) & neq(v0, nil) & ~ % 30.06/4.94 frontsegP(v0, nil)) % 30.06/4.94 % 30.06/4.94 Further assumptions not needed in the proof: % 30.06/4.94 -------------------------------------------- % 30.06/4.94 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 30.06/4.94 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 30.06/4.94 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 30.06/4.94 ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, % 30.06/4.94 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 30.06/4.94 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, % 30.06/4.94 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 30.06/4.94 ax93, ax94, ax95 % 30.06/4.94 % 30.06/4.94 Those formulas are unsatisfiable: % 30.06/4.94 --------------------------------- % 30.06/4.94 % 30.06/4.94 Begin of proof % 30.06/4.94 | % 30.06/4.94 | ALPHA: (ax45) implies: % 30.06/4.95 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | frontsegP(v0, nil)) % 30.06/4.95 | % 30.06/4.95 | ALPHA: (co1) implies: % 30.06/4.95 | (2) ? [v0: $i] : ($i(v0) & ssList(v0) & ssList(nil) & neq(v0, nil) & ~ % 30.06/4.95 | frontsegP(v0, nil)) % 30.06/4.95 | % 30.06/4.95 | DELTA: instantiating (2) with fresh symbol all_89_0 gives: % 30.06/4.95 | (3) $i(all_89_0) & ssList(all_89_0) & ssList(nil) & neq(all_89_0, nil) & ~ % 30.06/4.95 | frontsegP(all_89_0, nil) % 30.06/4.95 | % 30.06/4.95 | ALPHA: (3) implies: % 30.06/4.95 | (4) ~ frontsegP(all_89_0, nil) % 30.06/4.95 | (5) ssList(all_89_0) % 30.06/4.95 | (6) $i(all_89_0) % 30.06/4.95 | % 30.06/4.95 | GROUND_INST: instantiating (1) with all_89_0, simplifying with (4), (5), (6) % 30.06/4.95 | gives: % 30.06/4.95 | (7) $false % 30.06/4.95 | % 30.06/4.95 | CLOSE: (7) is inconsistent. % 30.06/4.95 | % 30.06/4.95 End of proof % 30.06/4.95 % SZS output end Proof for theBenchmark % 30.06/4.95 % 30.06/4.95 4358ms %------------------------------------------------------------------------------