%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC358+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 : n020.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:01 EDT 2023 % Result : Theorem 13.68s 2.65s % Output : Proof 21.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWC358+1 : TPTP v8.1.2. Released v2.4.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n020.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Mon Aug 28 16:34:58 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 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.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.38/1.48 Prover 4: Preprocessing ... % 5.38/1.48 Prover 1: Preprocessing ... % 5.84/1.52 Prover 2: Preprocessing ... % 5.84/1.52 Prover 5: Preprocessing ... % 5.84/1.52 Prover 6: Preprocessing ... % 5.84/1.52 Prover 0: Preprocessing ... % 5.84/1.52 Prover 3: Preprocessing ... % 13.68/2.61 Prover 2: Constructing countermodel ... % 13.68/2.64 Prover 2: proved (2024ms) % 13.68/2.64 % 13.68/2.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.68/2.65 % 14.27/2.66 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 15.63/2.81 Prover 7: Preprocessing ... % 16.25/2.90 Prover 5: Constructing countermodel ... % 16.25/2.92 Prover 5: stopped % 16.25/2.93 Prover 6: Proving ... % 16.25/2.94 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 16.25/2.94 Prover 6: stopped % 16.25/2.96 Prover 1: Constructing countermodel ... % 16.25/2.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 17.14/3.01 Prover 3: Constructing countermodel ... % 17.30/3.02 Prover 3: stopped % 17.33/3.03 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 17.97/3.14 Prover 7: Constructing countermodel ... % 18.54/3.19 Prover 8: Preprocessing ... % 18.54/3.24 Prover 10: Preprocessing ... % 18.54/3.25 Prover 11: Preprocessing ... % 18.54/3.31 Prover 7: Found proof (size 9) % 18.54/3.31 Prover 7: proved (656ms) % 18.54/3.32 Prover 1: stopped % 20.10/3.39 Prover 11: stopped % 20.10/3.42 Prover 10: Constructing countermodel ... % 20.50/3.44 Prover 10: stopped % 20.50/3.49 Prover 4: Constructing countermodel ... % 21.03/3.52 Prover 4: stopped % 21.03/3.53 Prover 8: Warning: ignoring some quantifiers % 21.03/3.55 Prover 8: Constructing countermodel ... % 21.03/3.56 Prover 8: stopped % 21.37/3.64 Prover 0: Proving ... % 21.37/3.64 Prover 0: stopped % 21.37/3.64 % 21.37/3.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.37/3.65 % 21.37/3.65 % SZS output start Proof for theBenchmark % 21.37/3.66 Assumptions after simplification: % 21.37/3.66 --------------------------------- % 21.37/3.66 % 21.37/3.66 (ax58) % 21.73/3.67 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 21.73/3.67 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 21.73/3.67 % 21.73/3.67 (co1) % 21.73/3.67 $i(nil) & ssList(nil) & neq(nil, nil) & ~ segmentP(nil, nil) % 21.73/3.67 % 21.73/3.67 Further assumptions not needed in the proof: % 21.73/3.67 -------------------------------------------- % 21.73/3.67 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 21.73/3.67 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 21.73/3.67 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 21.73/3.67 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 21.73/3.67 ax57, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 21.73/3.67 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, % 21.73/3.67 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 21.73/3.67 ax93, ax94, ax95 % 21.73/3.67 % 21.73/3.67 Those formulas are unsatisfiable: % 21.73/3.67 --------------------------------- % 21.73/3.67 % 21.73/3.67 Begin of proof % 21.73/3.67 | % 21.73/3.67 | ALPHA: (ax58) implies: % 21.73/3.67 | (1) ~ ssList(nil) | segmentP(nil, nil) % 21.73/3.67 | % 21.73/3.67 | ALPHA: (co1) implies: % 21.73/3.68 | (2) ~ segmentP(nil, nil) % 21.73/3.68 | (3) ssList(nil) % 21.73/3.68 | % 21.73/3.68 | BETA: splitting (1) gives: % 21.73/3.68 | % 21.73/3.68 | Case 1: % 21.73/3.68 | | % 21.73/3.68 | | (4) ~ ssList(nil) % 21.73/3.68 | | % 21.73/3.68 | | PRED_UNIFY: (3), (4) imply: % 21.73/3.68 | | (5) $false % 21.73/3.68 | | % 21.73/3.68 | | CLOSE: (5) is inconsistent. % 21.73/3.68 | | % 21.73/3.68 | Case 2: % 21.73/3.68 | | % 21.73/3.68 | | (6) segmentP(nil, nil) % 21.73/3.68 | | % 21.73/3.68 | | PRED_UNIFY: (2), (6) imply: % 21.73/3.68 | | (7) $false % 21.73/3.68 | | % 21.73/3.68 | | CLOSE: (7) is inconsistent. % 21.73/3.68 | | % 21.73/3.68 | End of split % 21.73/3.68 | % 21.73/3.68 End of proof % 21.73/3.68 % SZS output end Proof for theBenchmark % 21.73/3.68 % 21.73/3.68 3081ms %------------------------------------------------------------------------------