TSTP Solution File: SYN057+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN057+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n020.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 : Fri Sep 1 03:26:22 EDT 2023
% Result : Theorem 3.41s 1.18s
% Output : Proof 4.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN057+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n020.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 : Sat Aug 26 20:08:30 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.61 ________ _____
% 0.21/0.61 ___ __ \_________(_)________________________________
% 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61
% 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61 (2023-06-19)
% 0.21/0.61
% 0.21/0.61 (c) Philipp Rümmer, 2009-2023
% 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.61 Amanda Stjerna.
% 0.21/0.61 Free software under BSD-3-Clause.
% 0.21/0.61
% 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.61
% 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.62 Running up to 7 provers in parallel.
% 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.81/0.94 Prover 4: Preprocessing ...
% 1.81/0.94 Prover 1: Preprocessing ...
% 1.81/0.98 Prover 6: Preprocessing ...
% 1.81/0.98 Prover 2: Preprocessing ...
% 1.81/0.98 Prover 3: Preprocessing ...
% 1.81/0.99 Prover 0: Preprocessing ...
% 1.81/0.99 Prover 5: Preprocessing ...
% 2.78/1.08 Prover 5: Constructing countermodel ...
% 2.78/1.08 Prover 2: Constructing countermodel ...
% 2.78/1.10 Prover 6: Constructing countermodel ...
% 2.78/1.10 Prover 1: Constructing countermodel ...
% 2.78/1.10 Prover 3: Constructing countermodel ...
% 2.78/1.14 Prover 4: Constructing countermodel ...
% 2.78/1.15 Prover 0: Proving ...
% 3.41/1.18 Prover 5: proved (547ms)
% 3.41/1.18
% 3.41/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.18
% 3.41/1.18 Prover 2: stopped
% 3.41/1.19 Prover 0: stopped
% 3.53/1.20 Prover 6: stopped
% 3.53/1.20 Prover 3: stopped
% 3.53/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.53/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.53/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.53/1.20 Prover 7: Preprocessing ...
% 3.53/1.20 Prover 8: Preprocessing ...
% 3.53/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.53/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.68/1.21 Prover 10: Preprocessing ...
% 3.74/1.22 Prover 11: Preprocessing ...
% 3.74/1.22 Prover 13: Preprocessing ...
% 3.74/1.23 Prover 7: Constructing countermodel ...
% 3.74/1.23 Prover 10: Constructing countermodel ...
% 3.74/1.24 Prover 13: Constructing countermodel ...
% 3.74/1.24 Prover 8: Warning: ignoring some quantifiers
% 3.74/1.25 Prover 8: Constructing countermodel ...
% 3.74/1.27 Prover 13: Found proof (size 12)
% 3.74/1.27 Prover 13: proved (63ms)
% 3.74/1.27 Prover 4: stopped
% 3.74/1.27 Prover 8: stopped
% 3.74/1.27 Prover 1: stopped
% 3.74/1.27 Prover 10: stopped
% 3.74/1.28 Prover 7: stopped
% 3.74/1.29 Prover 11: Constructing countermodel ...
% 3.74/1.30 Prover 11: stopped
% 3.74/1.30
% 3.74/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.74/1.30
% 3.74/1.30 % SZS output start Proof for theBenchmark
% 3.74/1.30 Assumptions after simplification:
% 3.74/1.30 ---------------------------------
% 3.74/1.30
% 3.74/1.30 (pel27)
% 4.30/1.31 ? [v0: $i] : ($i(v0) & big_i(v0) & big_j(v0))
% 4.30/1.31
% 4.30/1.31 (pel27_1)
% 4.30/1.31 ? [v0: $i] : ($i(v0) & big_f(v0) & ~ big_g(v0))
% 4.30/1.31
% 4.30/1.31 (pel27_2)
% 4.30/1.31 ! [v0: $i] : ( ~ $i(v0) | ~ big_f(v0) | big_h(v0))
% 4.30/1.31
% 4.30/1.31 (pel27_3)
% 4.30/1.31 ! [v0: $i] : ( ~ $i(v0) | ~ big_i(v0) | ~ big_j(v0) | big_f(v0))
% 4.30/1.31
% 4.30/1.31 (pel27_4)
% 4.30/1.31 ! [v0: $i] : ( ~ $i(v0) | ~ big_i(v0) | ~ big_h(v0)) | ! [v0: $i] : ( ~
% 4.30/1.31 $i(v0) | ~ big_h(v0) | big_g(v0))
% 4.30/1.31
% 4.30/1.31 Those formulas are unsatisfiable:
% 4.30/1.31 ---------------------------------
% 4.30/1.31
% 4.30/1.31 Begin of proof
% 4.30/1.31 |
% 4.30/1.31 | DELTA: instantiating (pel27) with fresh symbol all_4_0 gives:
% 4.30/1.32 | (1) $i(all_4_0) & big_i(all_4_0) & big_j(all_4_0)
% 4.30/1.32 |
% 4.30/1.32 | ALPHA: (1) implies:
% 4.30/1.32 | (2) big_j(all_4_0)
% 4.30/1.32 | (3) big_i(all_4_0)
% 4.30/1.32 | (4) $i(all_4_0)
% 4.30/1.32 |
% 4.30/1.32 | DELTA: instantiating (pel27_1) with fresh symbol all_6_0 gives:
% 4.30/1.32 | (5) $i(all_6_0) & big_f(all_6_0) & ~ big_g(all_6_0)
% 4.30/1.32 |
% 4.30/1.32 | ALPHA: (5) implies:
% 4.30/1.32 | (6) ~ big_g(all_6_0)
% 4.30/1.32 | (7) big_f(all_6_0)
% 4.30/1.32 | (8) $i(all_6_0)
% 4.30/1.32 |
% 4.30/1.32 | GROUND_INST: instantiating (pel27_2) with all_6_0, simplifying with (7), (8)
% 4.30/1.32 | gives:
% 4.30/1.32 | (9) big_h(all_6_0)
% 4.30/1.32 |
% 4.30/1.32 | GROUND_INST: instantiating (pel27_3) with all_4_0, simplifying with (2), (3),
% 4.30/1.32 | (4) gives:
% 4.30/1.32 | (10) big_f(all_4_0)
% 4.30/1.32 |
% 4.30/1.32 | GROUND_INST: instantiating (pel27_2) with all_4_0, simplifying with (4), (10)
% 4.30/1.32 | gives:
% 4.30/1.32 | (11) big_h(all_4_0)
% 4.30/1.32 |
% 4.30/1.32 | BETA: splitting (pel27_4) gives:
% 4.30/1.32 |
% 4.30/1.32 | Case 1:
% 4.30/1.32 | |
% 4.30/1.32 | | (12) ! [v0: $i] : ( ~ $i(v0) | ~ big_i(v0) | ~ big_h(v0))
% 4.30/1.32 | |
% 4.30/1.32 | | GROUND_INST: instantiating (12) with all_4_0, simplifying with (3), (4),
% 4.30/1.32 | | (11) gives:
% 4.30/1.32 | | (13) $false
% 4.30/1.33 | |
% 4.30/1.33 | | CLOSE: (13) is inconsistent.
% 4.30/1.33 | |
% 4.30/1.33 | Case 2:
% 4.30/1.33 | |
% 4.30/1.33 | | (14) ! [v0: $i] : ( ~ $i(v0) | ~ big_h(v0) | big_g(v0))
% 4.30/1.33 | |
% 4.30/1.33 | | GROUND_INST: instantiating (14) with all_6_0, simplifying with (6), (8), (9)
% 4.30/1.33 | | gives:
% 4.30/1.33 | | (15) $false
% 4.30/1.33 | |
% 4.30/1.33 | | CLOSE: (15) is inconsistent.
% 4.30/1.33 | |
% 4.30/1.33 | End of split
% 4.30/1.33 |
% 4.30/1.33 End of proof
% 4.30/1.33 % SZS output end Proof for theBenchmark
% 4.30/1.33
% 4.30/1.33 720ms
%------------------------------------------------------------------------------