%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC026+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 : n014.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:15 EDT 2023 % Result : Theorem 20.59s 3.60s % Output : Proof 29.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWC026+1 : TPTP v8.1.2. Released v2.4.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n014.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:05:00 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.15/1.51 Prover 1: Preprocessing ... % 5.15/1.51 Prover 4: Preprocessing ... % 5.15/1.56 Prover 0: Preprocessing ... % 5.15/1.56 Prover 5: Preprocessing ... % 5.15/1.56 Prover 2: Preprocessing ... % 5.15/1.56 Prover 3: Preprocessing ... % 5.15/1.56 Prover 6: Preprocessing ... % 14.61/2.79 Prover 2: Proving ... % 15.29/2.87 Prover 5: Constructing countermodel ... % 15.29/2.87 Prover 1: Constructing countermodel ... % 15.29/3.01 Prover 3: Constructing countermodel ... % 16.31/3.08 Prover 6: Proving ... % 20.59/3.59 Prover 6: proved (2948ms) % 20.59/3.59 % 20.59/3.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 20.59/3.60 % 20.59/3.60 Prover 2: stopped % 20.59/3.61 Prover 3: stopped % 20.59/3.62 Prover 5: stopped % 20.59/3.63 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 20.59/3.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 20.59/3.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.59/3.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.13/3.92 Prover 4: Constructing countermodel ... % 23.13/3.92 Prover 7: Preprocessing ... % 23.13/3.94 Prover 8: Preprocessing ... % 23.13/3.94 Prover 0: Proving ... % 23.42/3.95 Prover 0: stopped % 23.42/3.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.42/3.96 Prover 11: Preprocessing ... % 23.42/3.97 Prover 10: Preprocessing ... % 24.56/4.10 Prover 13: Preprocessing ... % 25.04/4.17 Prover 10: Constructing countermodel ... % 25.04/4.21 Prover 7: Constructing countermodel ... % 26.44/4.42 Prover 13: Constructing countermodel ... % 27.22/4.44 Prover 1: Found proof (size 19) % 27.22/4.44 Prover 1: proved (3804ms) % 27.22/4.44 Prover 7: stopped % 27.22/4.44 Prover 10: stopped % 27.22/4.44 Prover 4: stopped % 27.22/4.47 Prover 13: stopped % 27.22/4.47 Prover 8: Warning: ignoring some quantifiers % 27.22/4.48 Prover 8: Constructing countermodel ... % 27.22/4.49 Prover 8: stopped % 28.95/4.88 Prover 11: Constructing countermodel ... % 28.95/4.91 Prover 11: stopped % 28.95/4.91 % 28.95/4.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 28.95/4.91 % 28.95/4.91 % SZS output start Proof for theBenchmark % 28.95/4.92 Assumptions after simplification: % 28.95/4.92 --------------------------------- % 28.95/4.92 % 28.95/4.92 (co1) % 29.37/4.97 $i(nil) & ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : (ssList(v1) = % 29.37/4.97 0 & $i(v1) & ( ~ (v1 = nil) | v0 = nil) & ( ~ (v0 = nil) | v1 = nil) & % 29.37/4.97 ((v1 = nil & ~ (v0 = nil)) | (v0 = nil & ~ (v1 = nil))))) % 29.37/4.97 % 29.37/4.97 Further assumptions not needed in the proof: % 29.37/4.97 -------------------------------------------- % 29.37/4.97 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 29.37/4.97 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 29.37/4.97 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 29.37/4.97 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 29.37/4.97 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 29.37/4.97 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 29.37/4.97 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, % 29.37/4.97 ax92, ax93, ax94, ax95 % 29.37/4.97 % 29.37/4.97 Those formulas are unsatisfiable: % 29.37/4.97 --------------------------------- % 29.37/4.97 % 29.37/4.97 Begin of proof % 29.37/4.97 | % 29.37/4.97 | ALPHA: (co1) implies: % 29.37/4.98 | (1) ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : (ssList(v1) = 0 % 29.37/4.98 | & $i(v1) & ( ~ (v1 = nil) | v0 = nil) & ( ~ (v0 = nil) | v1 = nil) % 29.37/4.98 | & ((v1 = nil & ~ (v0 = nil)) | (v0 = nil & ~ (v1 = nil))))) % 29.37/4.98 | % 29.37/4.98 | DELTA: instantiating (1) with fresh symbol all_93_0 gives: % 29.37/4.98 | (2) ssList(all_93_0) = 0 & $i(all_93_0) & ? [v0: $i] : (ssList(v0) = 0 & % 29.37/4.98 | $i(v0) & ( ~ (v0 = nil) | all_93_0 = nil) & ( ~ (all_93_0 = nil) | v0 % 29.37/4.98 | = nil) & ((v0 = nil & ~ (all_93_0 = nil)) | (all_93_0 = nil & ~ % 29.37/4.98 | (v0 = nil)))) % 29.37/4.98 | % 29.37/4.98 | ALPHA: (2) implies: % 29.37/4.98 | (3) ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ( ~ (v0 = nil) | all_93_0 = % 29.37/4.98 | nil) & ( ~ (all_93_0 = nil) | v0 = nil) & ((v0 = nil & ~ (all_93_0 % 29.37/4.98 | = nil)) | (all_93_0 = nil & ~ (v0 = nil)))) % 29.37/4.98 | % 29.37/4.98 | DELTA: instantiating (3) with fresh symbol all_97_0 gives: % 29.37/4.99 | (4) ssList(all_97_0) = 0 & $i(all_97_0) & ( ~ (all_97_0 = nil) | all_93_0 = % 29.37/4.99 | nil) & ( ~ (all_93_0 = nil) | all_97_0 = nil) & ((all_97_0 = nil & ~ % 29.37/4.99 | (all_93_0 = nil)) | (all_93_0 = nil & ~ (all_97_0 = nil))) % 29.37/4.99 | % 29.37/4.99 | ALPHA: (4) implies: % 29.37/4.99 | (5) (all_97_0 = nil & ~ (all_93_0 = nil)) | (all_93_0 = nil & ~ (all_97_0 % 29.37/4.99 | = nil)) % 29.37/4.99 | (6) ~ (all_93_0 = nil) | all_97_0 = nil % 29.37/4.99 | (7) ~ (all_97_0 = nil) | all_93_0 = nil % 29.37/4.99 | % 29.37/4.99 | BETA: splitting (5) gives: % 29.37/4.99 | % 29.37/4.99 | Case 1: % 29.37/4.99 | | % 29.37/4.99 | | (8) all_97_0 = nil & ~ (all_93_0 = nil) % 29.37/4.99 | | % 29.37/4.99 | | ALPHA: (8) implies: % 29.37/4.99 | | (9) all_97_0 = nil % 29.37/4.99 | | (10) ~ (all_93_0 = nil) % 29.37/4.99 | | % 29.37/4.99 | | BETA: splitting (7) gives: % 29.37/4.99 | | % 29.37/4.99 | | Case 1: % 29.37/4.99 | | | % 29.37/4.99 | | | (11) ~ (all_97_0 = nil) % 29.37/4.99 | | | % 29.37/4.99 | | | REDUCE: (9), (11) imply: % 29.37/4.99 | | | (12) $false % 29.37/4.99 | | | % 29.37/4.99 | | | CLOSE: (12) is inconsistent. % 29.37/4.99 | | | % 29.37/5.00 | | Case 2: % 29.37/5.00 | | | % 29.37/5.00 | | | (13) all_93_0 = nil % 29.37/5.00 | | | % 29.37/5.00 | | | REDUCE: (10), (13) imply: % 29.37/5.00 | | | (14) $false % 29.37/5.00 | | | % 29.37/5.00 | | | CLOSE: (14) is inconsistent. % 29.37/5.00 | | | % 29.37/5.00 | | End of split % 29.37/5.00 | | % 29.37/5.00 | Case 2: % 29.37/5.00 | | % 29.37/5.00 | | (15) all_93_0 = nil & ~ (all_97_0 = nil) % 29.37/5.00 | | % 29.37/5.00 | | ALPHA: (15) implies: % 29.37/5.00 | | (16) all_93_0 = nil % 29.37/5.00 | | (17) ~ (all_97_0 = nil) % 29.37/5.00 | | % 29.37/5.00 | | BETA: splitting (6) gives: % 29.37/5.00 | | % 29.37/5.00 | | Case 1: % 29.37/5.00 | | | % 29.37/5.00 | | | (18) ~ (all_93_0 = nil) % 29.37/5.00 | | | % 29.37/5.00 | | | REDUCE: (16), (18) imply: % 29.37/5.00 | | | (19) $false % 29.37/5.00 | | | % 29.37/5.00 | | | CLOSE: (19) is inconsistent. % 29.37/5.00 | | | % 29.37/5.00 | | Case 2: % 29.37/5.00 | | | % 29.37/5.00 | | | (20) all_97_0 = nil % 29.37/5.00 | | | % 29.37/5.00 | | | REDUCE: (17), (20) imply: % 29.37/5.00 | | | (21) $false % 29.37/5.00 | | | % 29.37/5.00 | | | CLOSE: (21) is inconsistent. % 29.37/5.00 | | | % 29.37/5.00 | | End of split % 29.37/5.00 | | % 29.37/5.00 | End of split % 29.37/5.00 | % 29.37/5.00 End of proof % 29.37/5.00 % SZS output end Proof for theBenchmark % 29.67/5.00 % 29.67/5.00 4384ms %------------------------------------------------------------------------------