%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC352+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 : n021.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:59 EDT 2023 % Result : Theorem 20.24s 3.72s % Output : Proof 28.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWC352+1 : TPTP v8.1.2. Released v2.4.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n021.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Mon Aug 28 15:01:43 EDT 2023 % 0.13/0.35 % CPUTime : % 0.52/0.66 ________ _____ % 0.52/0.66 ___ __ \_________(_)________________________________ % 0.52/0.66 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.52/0.66 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.52/0.66 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.52/0.66 % 0.52/0.66 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.52/0.66 (2023-06-19) % 0.52/0.66 % 0.52/0.66 (c) Philipp Rümmer, 2009-2023 % 0.52/0.66 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.52/0.66 Amanda Stjerna. % 0.52/0.66 Free software under BSD-3-Clause. % 0.52/0.66 % 0.52/0.66 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.52/0.66 % 0.52/0.67 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.52/0.68 Running up to 7 provers in parallel. % 0.52/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.52/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.52/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.52/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.52/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.52/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.52/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.26/1.53 Prover 4: Preprocessing ... % 5.26/1.54 Prover 1: Preprocessing ... % 5.26/1.58 Prover 6: Preprocessing ... % 5.26/1.58 Prover 2: Preprocessing ... % 5.26/1.58 Prover 5: Preprocessing ... % 5.26/1.58 Prover 3: Preprocessing ... % 5.26/1.59 Prover 0: Preprocessing ... % 14.80/2.80 Prover 2: Proving ... % 15.45/2.92 Prover 5: Constructing countermodel ... % 15.45/2.93 Prover 1: Constructing countermodel ... % 15.45/2.96 Prover 6: Proving ... % 15.45/2.98 Prover 3: Constructing countermodel ... % 20.24/3.57 Prover 4: Constructing countermodel ... % 20.24/3.69 Prover 0: Proving ... % 20.24/3.71 Prover 3: proved (3026ms) % 20.24/3.71 % 20.24/3.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.24/3.72 % 20.24/3.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 21.12/3.72 Prover 0: stopped % 21.12/3.72 Prover 6: stopped % 21.12/3.72 Prover 2: stopped % 21.12/3.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 21.12/3.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 21.12/3.74 Prover 5: stopped % 21.12/3.74 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 21.12/3.74 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.42/4.00 Prover 11: Preprocessing ... % 23.42/4.00 Prover 7: Preprocessing ... % 24.02/4.06 Prover 8: Preprocessing ... % 24.02/4.07 Prover 10: Preprocessing ... % 24.02/4.07 Prover 13: Preprocessing ... % 25.00/4.21 Prover 7: Constructing countermodel ... % 25.45/4.24 Prover 10: Constructing countermodel ... % 25.91/4.41 Prover 13: Constructing countermodel ... % 27.15/4.46 Prover 7: Found proof (size 17) % 27.15/4.46 Prover 7: proved (741ms) % 27.15/4.46 Prover 10: stopped % 27.15/4.46 Prover 4: stopped % 27.15/4.46 Prover 13: stopped % 27.15/4.46 Prover 1: stopped % 27.15/4.49 Prover 8: Warning: ignoring some quantifiers % 27.15/4.50 Prover 8: Constructing countermodel ... % 27.15/4.51 Prover 8: stopped % 28.96/4.90 Prover 11: Constructing countermodel ... % 28.96/4.92 Prover 11: stopped % 28.96/4.92 % 28.96/4.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 28.96/4.92 % 28.96/4.93 % SZS output start Proof for theBenchmark % 28.96/4.94 Assumptions after simplification: % 28.96/4.94 --------------------------------- % 28.96/4.94 % 28.96/4.94 (ax15) % 28.96/4.95 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ ssList(v1) | % 28.96/4.95 ~ ssList(v0) | neq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | ~ % 28.96/4.95 neq(v0, v0)) % 28.96/4.95 % 28.96/4.95 (ax17) % 28.96/4.96 $i(nil) & ssList(nil) % 28.96/4.96 % 28.96/4.96 (ax45) % 28.96/4.96 $i(nil) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | frontsegP(v0, nil)) % 28.96/4.96 % 28.96/4.96 (co1) % 28.96/4.96 $i(nil) & ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ssList(v1) & % 28.96/4.96 ssList(v0) & ~ frontsegP(v1, v0) & ~ neq(v1, nil) & ( ~ (v1 = nil) | v0 = % 28.96/4.96 nil)) % 28.96/4.96 % 28.96/4.96 Further assumptions not needed in the proof: % 28.96/4.96 -------------------------------------------- % 28.96/4.96 ax1, ax10, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, % 28.96/4.96 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 28.96/4.96 ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax46, ax47, % 28.96/4.96 ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax58, ax59, % 28.96/4.96 ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, % 28.96/4.96 ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, % 28.96/4.96 ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, % 28.96/4.96 ax95 % 28.96/4.96 % 28.96/4.96 Those formulas are unsatisfiable: % 28.96/4.96 --------------------------------- % 28.96/4.96 % 28.96/4.96 Begin of proof % 28.96/4.96 | % 28.96/4.96 | ALPHA: (ax15) implies: % 28.96/4.96 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 28.96/4.96 | ssList(v1) | ~ ssList(v0) | neq(v0, v1)) % 28.96/4.96 | % 28.96/4.96 | ALPHA: (ax17) implies: % 28.96/4.96 | (2) ssList(nil) % 28.96/4.96 | % 28.96/4.96 | ALPHA: (ax45) implies: % 28.96/4.97 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | frontsegP(v0, nil)) % 28.96/4.97 | % 28.96/4.97 | ALPHA: (co1) implies: % 28.96/4.97 | (4) $i(nil) % 28.96/4.97 | (5) ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ssList(v1) & ssList(v0) % 28.96/4.97 | & ~ frontsegP(v1, v0) & ~ neq(v1, nil) & ( ~ (v1 = nil) | v0 = % 28.96/4.97 | nil)) % 28.96/4.97 | % 28.96/4.97 | DELTA: instantiating (5) with fresh symbols all_91_0, all_91_1 gives: % 28.96/4.97 | (6) $i(all_91_0) & $i(all_91_1) & ssList(all_91_0) & ssList(all_91_1) & ~ % 28.96/4.97 | frontsegP(all_91_0, all_91_1) & ~ neq(all_91_0, nil) & ( ~ (all_91_0 = % 28.96/4.97 | nil) | all_91_1 = nil) % 28.96/4.97 | % 28.96/4.97 | ALPHA: (6) implies: % 28.96/4.97 | (7) ~ neq(all_91_0, nil) % 28.96/4.97 | (8) ~ frontsegP(all_91_0, all_91_1) % 28.96/4.97 | (9) ssList(all_91_1) % 28.96/4.97 | (10) ssList(all_91_0) % 28.96/4.97 | (11) $i(all_91_1) % 28.96/4.97 | (12) $i(all_91_0) % 28.96/4.97 | (13) ~ (all_91_0 = nil) | all_91_1 = nil % 28.96/4.97 | % 28.96/4.98 | GROUND_INST: instantiating (3) with all_91_1, simplifying with (9), (11) % 28.96/4.98 | gives: % 28.96/4.98 | (14) frontsegP(all_91_1, nil) % 28.96/4.98 | % 28.96/4.98 | GROUND_INST: instantiating (1) with all_91_0, nil, simplifying with (2), (4), % 28.96/4.98 | (7), (10), (12) gives: % 28.96/4.98 | (15) all_91_0 = nil % 28.96/4.98 | % 28.96/4.98 | REDUCE: (8), (15) imply: % 28.96/4.98 | (16) ~ frontsegP(nil, all_91_1) % 28.96/4.98 | % 28.96/4.98 | BETA: splitting (13) gives: % 28.96/4.98 | % 28.96/4.98 | Case 1: % 28.96/4.98 | | % 28.96/4.98 | | (17) ~ (all_91_0 = nil) % 28.96/4.98 | | % 28.96/4.98 | | REDUCE: (15), (17) imply: % 28.96/4.98 | | (18) $false % 28.96/4.98 | | % 28.96/4.98 | | CLOSE: (18) is inconsistent. % 28.96/4.98 | | % 28.96/4.98 | Case 2: % 28.96/4.98 | | % 28.96/4.98 | | (19) all_91_1 = nil % 28.96/4.98 | | % 28.96/4.98 | | REDUCE: (14), (19) imply: % 28.96/4.98 | | (20) frontsegP(nil, nil) % 28.96/4.98 | | % 28.96/4.98 | | REDUCE: (16), (19) imply: % 28.96/4.98 | | (21) ~ frontsegP(nil, nil) % 28.96/4.98 | | % 28.96/4.98 | | PRED_UNIFY: (20), (21) imply: % 28.96/4.98 | | (22) $false % 28.96/4.98 | | % 28.96/4.98 | | CLOSE: (22) is inconsistent. % 28.96/4.98 | | % 28.96/4.98 | End of split % 28.96/4.98 | % 28.96/4.98 End of proof % 28.96/4.98 % SZS output end Proof for theBenchmark % 28.96/4.98 % 28.96/4.98 4318ms %------------------------------------------------------------------------------