%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC134+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 : n029.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:50 EDT 2023 % Result : Theorem 23.55s 3.77s % Output : Proof 30.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC134+1 : TPTP v8.1.2. Released v2.4.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Aug 28 19:04:41 EDT 2023 % 0.12/0.33 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.68/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.53/1.40 Prover 1: Preprocessing ... % 5.53/1.40 Prover 4: Preprocessing ... % 5.98/1.45 Prover 2: Preprocessing ... % 5.98/1.45 Prover 6: Preprocessing ... % 5.98/1.45 Prover 5: Preprocessing ... % 5.98/1.45 Prover 0: Preprocessing ... % 6.13/1.47 Prover 3: Preprocessing ... % 14.09/2.52 Prover 2: Proving ... % 14.09/2.53 Prover 5: Constructing countermodel ... % 14.09/2.55 Prover 3: Constructing countermodel ... % 14.55/2.61 Prover 1: Constructing countermodel ... % 15.53/2.71 Prover 6: Proving ... % 23.55/3.77 Prover 3: proved (3153ms) % 23.55/3.77 % 23.55/3.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.55/3.77 % 23.55/3.77 Prover 5: stopped % 23.55/3.78 Prover 2: stopped % 24.11/3.80 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 24.11/3.80 Prover 6: stopped % 24.11/3.81 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 24.11/3.81 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 24.11/3.82 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 25.25/3.94 Prover 7: Preprocessing ... % 25.25/3.95 Prover 8: Preprocessing ... % 25.25/3.98 Prover 10: Preprocessing ... % 25.97/4.08 Prover 11: Preprocessing ... % 26.47/4.14 Prover 4: Constructing countermodel ... % 27.63/4.25 Prover 10: Constructing countermodel ... % 27.63/4.28 Prover 7: Constructing countermodel ... % 28.83/4.39 Prover 0: Proving ... % 28.83/4.41 Prover 0: stopped % 28.83/4.41 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 29.83/4.54 Prover 13: Preprocessing ... % 30.07/4.58 Prover 10: Found proof (size 11) % 30.07/4.58 Prover 10: proved (781ms) % 30.07/4.58 Prover 4: stopped % 30.07/4.58 Prover 1: stopped % 30.07/4.58 Prover 11: stopped % 30.07/4.58 Prover 7: stopped % 30.07/4.61 Prover 8: Warning: ignoring some quantifiers % 30.07/4.62 Prover 8: Constructing countermodel ... % 30.58/4.64 Prover 8: stopped % 30.58/4.64 Prover 13: stopped % 30.58/4.65 % 30.58/4.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 30.58/4.65 % 30.58/4.65 % SZS output start Proof for theBenchmark % 30.58/4.65 Assumptions after simplification: % 30.58/4.65 --------------------------------- % 30.58/4.65 % 30.58/4.65 (ax15) % 30.58/4.66 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ ssList(v1) | % 30.58/4.66 ~ ssList(v0) | neq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | ~ % 30.58/4.66 neq(v0, v0)) % 30.58/4.66 % 30.58/4.66 (ax17) % 30.58/4.66 $i(nil) & ssList(nil) % 30.58/4.66 % 30.58/4.66 (ax60) % 30.58/4.66 $i(nil) & cyclefreeP(nil) % 30.58/4.66 % 30.58/4.66 (co1) % 30.58/4.66 $i(nil) & ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ssList(v1) & % 30.58/4.66 ssList(v0) & ~ cyclefreeP(v1) & ~ neq(v1, nil)) % 30.58/4.66 % 30.58/4.66 Further assumptions not needed in the proof: % 30.58/4.66 -------------------------------------------- % 30.58/4.66 ax1, ax10, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, % 30.58/4.66 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 30.58/4.66 ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, % 30.58/4.66 ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax58, % 30.58/4.66 ax59, ax6, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, % 30.58/4.66 ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, % 30.58/4.66 ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, % 30.58/4.66 ax95 % 30.58/4.66 % 30.58/4.66 Those formulas are unsatisfiable: % 30.58/4.66 --------------------------------- % 30.58/4.66 % 30.58/4.66 Begin of proof % 30.58/4.66 | % 30.58/4.66 | ALPHA: (ax15) implies: % 30.58/4.67 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 30.58/4.67 | ssList(v1) | ~ ssList(v0) | neq(v0, v1)) % 30.58/4.67 | % 30.58/4.67 | ALPHA: (ax17) implies: % 30.58/4.67 | (2) ssList(nil) % 30.58/4.67 | % 30.58/4.67 | ALPHA: (ax60) implies: % 30.58/4.67 | (3) cyclefreeP(nil) % 30.58/4.67 | % 30.58/4.67 | ALPHA: (co1) implies: % 30.58/4.67 | (4) $i(nil) % 30.58/4.67 | (5) ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & ssList(v1) & ssList(v0) % 30.58/4.67 | & ~ cyclefreeP(v1) & ~ neq(v1, nil)) % 30.58/4.67 | % 30.58/4.67 | DELTA: instantiating (5) with fresh symbols all_91_0, all_91_1 gives: % 30.58/4.67 | (6) $i(all_91_0) & $i(all_91_1) & ssList(all_91_0) & ssList(all_91_1) & ~ % 30.58/4.67 | cyclefreeP(all_91_0) & ~ neq(all_91_0, nil) % 30.58/4.67 | % 30.58/4.67 | ALPHA: (6) implies: % 30.58/4.67 | (7) ~ neq(all_91_0, nil) % 30.58/4.67 | (8) ~ cyclefreeP(all_91_0) % 30.58/4.67 | (9) ssList(all_91_0) % 30.58/4.67 | (10) $i(all_91_0) % 30.58/4.67 | % 30.58/4.67 | GROUND_INST: instantiating (1) with all_91_0, nil, simplifying with (2), (4), % 30.58/4.67 | (7), (9), (10) gives: % 30.58/4.67 | (11) all_91_0 = nil % 30.58/4.67 | % 30.58/4.67 | REDUCE: (8), (11) imply: % 30.58/4.67 | (12) ~ cyclefreeP(nil) % 30.58/4.67 | % 30.58/4.67 | PRED_UNIFY: (3), (12) imply: % 30.58/4.67 | (13) $false % 30.58/4.67 | % 30.58/4.67 | CLOSE: (13) is inconsistent. % 30.58/4.67 | % 30.58/4.67 End of proof % 30.58/4.67 % SZS output end Proof for theBenchmark % 30.58/4.67 % 30.58/4.67 4079ms %------------------------------------------------------------------------------