TSTP Solution File: LCL644+1.001 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LCL644+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n005.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 08:11:56 EDT 2023
% Result : Theorem 3.33s 1.18s
% Output : Proof 3.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL644+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n005.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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 25 02:15:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.20/0.60 ________ _____
% 0.20/0.60 ___ __ \_________(_)________________________________
% 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60
% 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60 (2023-06-19)
% 0.20/0.60
% 0.20/0.60 (c) Philipp Rümmer, 2009-2023
% 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60 Amanda Stjerna.
% 0.20/0.60 Free software under BSD-3-Clause.
% 0.20/0.60
% 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60
% 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.95/0.99 Prover 4: Preprocessing ...
% 1.95/0.99 Prover 1: Preprocessing ...
% 2.46/1.03 Prover 6: Preprocessing ...
% 2.46/1.03 Prover 5: Preprocessing ...
% 2.46/1.03 Prover 3: Preprocessing ...
% 2.46/1.03 Prover 0: Preprocessing ...
% 2.46/1.03 Prover 2: Preprocessing ...
% 3.33/1.15 Prover 5: Constructing countermodel ...
% 3.33/1.15 Prover 2: Constructing countermodel ...
% 3.33/1.18 Prover 5: proved (560ms)
% 3.33/1.18 Prover 2: proved (563ms)
% 3.33/1.18
% 3.33/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.33/1.18
% 3.33/1.19
% 3.33/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.33/1.19
% 3.33/1.20 Prover 3: Constructing countermodel ...
% 3.33/1.20 Prover 3: stopped
% 3.33/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.33/1.20 Prover 6: Constructing countermodel ...
% 3.33/1.20 Prover 6: stopped
% 3.33/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.33/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.33/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.97/1.23 Prover 4: Constructing countermodel ...
% 3.97/1.24 Prover 4: Found proof (size 1)
% 3.97/1.24 Prover 4: proved (620ms)
% 3.97/1.24 Prover 1: Constructing countermodel ...
% 3.97/1.24 Prover 1: stopped
% 3.97/1.25 Prover 7: Preprocessing ...
% 3.97/1.26 Prover 8: Preprocessing ...
% 3.97/1.26 Prover 10: Preprocessing ...
% 3.97/1.26 Prover 0: Constructing countermodel ...
% 3.97/1.26 Prover 11: Preprocessing ...
% 3.97/1.26 Prover 0: stopped
% 3.97/1.28 Prover 7: Constructing countermodel ...
% 3.97/1.28 Prover 7: stopped
% 3.97/1.29 Prover 10: Constructing countermodel ...
% 3.97/1.29 Prover 10: stopped
% 3.97/1.33 Prover 11: stopped
% 3.97/1.34 Prover 8: Warning: ignoring some quantifiers
% 3.97/1.34 Prover 8: Constructing countermodel ...
% 3.97/1.34 Prover 8: stopped
% 3.97/1.34
% 3.97/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.97/1.34
% 3.97/1.35 % SZS output start Proof for theBenchmark
% 3.97/1.35 Assumptions after simplification:
% 3.97/1.35 ---------------------------------
% 3.97/1.35
% 3.97/1.35 (main)
% 3.97/1.35 $false
% 3.97/1.35
% 3.97/1.35 Those formulas are unsatisfiable:
% 3.97/1.35 ---------------------------------
% 3.97/1.35
% 3.97/1.35 Begin of proof
% 3.97/1.35 |
% 3.97/1.35 | CLOSE: (main) is inconsistent.
% 3.97/1.35 |
% 3.97/1.35 End of proof
% 3.97/1.35 % SZS output end Proof for theBenchmark
% 3.97/1.35
% 3.97/1.35 754ms
%------------------------------------------------------------------------------