TSTP Solution File: ARI690_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI690_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n006.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 : Wed Aug 30 17:48:49 EDT 2023
% Result : Theorem 2.53s 1.10s
% Output : Proof 2.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI690_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Aug 29 17:45:06 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.61 ________ _____
% 0.17/0.61 ___ __ \_________(_)________________________________
% 0.17/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.61
% 0.17/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.61 (2023-06-19)
% 0.17/0.61
% 0.17/0.61 (c) Philipp Rümmer, 2009-2023
% 0.17/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.61 Amanda Stjerna.
% 0.17/0.61 Free software under BSD-3-Clause.
% 0.17/0.61
% 0.17/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.61
% 0.17/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.17/0.62 Running up to 7 provers in parallel.
% 0.17/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.17/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.10/1.04 Prover 6: Preprocessing ...
% 2.10/1.04 Prover 2: Preprocessing ...
% 2.10/1.04 Prover 1: Preprocessing ...
% 2.10/1.04 Prover 4: Preprocessing ...
% 2.10/1.04 Prover 5: Preprocessing ...
% 2.10/1.04 Prover 0: Preprocessing ...
% 2.10/1.04 Prover 3: Preprocessing ...
% 2.10/1.07 Prover 0: Constructing countermodel ...
% 2.10/1.07 Prover 2: Constructing countermodel ...
% 2.10/1.07 Prover 6: Constructing countermodel ...
% 2.10/1.07 Prover 3: Constructing countermodel ...
% 2.10/1.07 Prover 4: Constructing countermodel ...
% 2.10/1.07 Prover 5: Constructing countermodel ...
% 2.10/1.07 Prover 1: Constructing countermodel ...
% 2.53/1.10 Prover 2: proved (467ms)
% 2.53/1.10 Prover 0: proved (466ms)
% 2.53/1.10 Prover 3: proved (466ms)
% 2.53/1.10
% 2.53/1.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.10
% 2.53/1.10
% 2.53/1.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.10
% 2.53/1.10 Prover 5: proved (463ms)
% 2.53/1.10
% 2.53/1.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.10
% 2.53/1.10
% 2.53/1.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.10
% 2.53/1.10 Prover 6: proved (462ms)
% 2.53/1.10
% 2.53/1.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.10
% 2.53/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.53/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.53/1.11 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.53/1.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.53/1.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.53/1.11 Prover 7: Preprocessing ...
% 2.53/1.11 Prover 8: Preprocessing ...
% 2.53/1.12 Prover 13: Preprocessing ...
% 2.53/1.12 Prover 10: Preprocessing ...
% 2.53/1.12 Prover 7: Constructing countermodel ...
% 2.53/1.12 Prover 8: Constructing countermodel ...
% 2.53/1.12 Prover 11: Preprocessing ...
% 2.53/1.13 Prover 13: Constructing countermodel ...
% 2.53/1.13 Prover 11: Constructing countermodel ...
% 2.53/1.13 Prover 10: Constructing countermodel ...
% 2.53/1.14 Prover 8: Found proof (size 3)
% 2.53/1.14 Prover 7: Found proof (size 3)
% 2.53/1.14 Prover 13: Found proof (size 3)
% 2.53/1.14 Prover 1: Found proof (size 3)
% 2.53/1.14 Prover 4: Found proof (size 3)
% 2.53/1.14 Prover 13: proved (31ms)
% 2.53/1.14 Prover 4: proved (507ms)
% 2.53/1.14 Prover 8: proved (36ms)
% 2.53/1.14 Prover 1: proved (509ms)
% 2.53/1.14 Prover 7: proved (37ms)
% 2.53/1.14 Prover 10: Found proof (size 3)
% 2.53/1.14 Prover 10: proved (36ms)
% 2.53/1.14 Prover 11: Found proof (size 3)
% 2.53/1.14 Prover 11: proved (31ms)
% 2.53/1.14
% 2.53/1.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.14
% 2.53/1.14 % SZS output start Proof for theBenchmark
% 2.53/1.15 Assumptions after simplification:
% 2.53/1.15 ---------------------------------
% 2.53/1.15
% 2.53/1.15 (conj)
% 2.53/1.15 ~ (a = $product(2, c))
% 2.53/1.15
% 2.53/1.15 (eq1)
% 2.53/1.15 a = $product(2, d)
% 2.53/1.15
% 2.53/1.15 (eq2)
% 2.53/1.15 d = c
% 2.53/1.15
% 2.53/1.15 Those formulas are unsatisfiable:
% 2.53/1.15 ---------------------------------
% 2.53/1.15
% 2.53/1.15 Begin of proof
% 2.53/1.15 |
% 2.53/1.15 | COMBINE_EQS: (eq1), (eq2) imply:
% 2.53/1.15 | (1) a = $product(2, c)
% 2.53/1.15 |
% 2.53/1.15 | REDUCE: (1), (conj) imply:
% 2.53/1.15 | (2) $false
% 2.53/1.15 |
% 2.53/1.15 | CLOSE: (2) is inconsistent.
% 2.53/1.16 |
% 2.53/1.16 End of proof
% 2.53/1.16 % SZS output end Proof for theBenchmark
% 2.53/1.16
% 2.53/1.16 544ms
%------------------------------------------------------------------------------