TSTP Solution File: SYN356+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYN356+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 : n022.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:27:20 EDT 2023

% Result   : Theorem 3.35s 1.23s
% Output   : Proof 3.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN356+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Aug 26 20:29:09 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.62  ________       _____
% 0.21/0.62  ___  __ \_________(_)________________________________
% 0.21/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.62  
% 0.21/0.62  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.62  (2023-06-19)
% 0.21/0.62  
% 0.21/0.62  (c) Philipp Rümmer, 2009-2023
% 0.21/0.62  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.62                Amanda Stjerna.
% 0.21/0.62  Free software under BSD-3-Clause.
% 0.21/0.62  
% 0.21/0.62  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.62  
% 0.21/0.62  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.63  Running up to 7 provers in parallel.
% 0.21/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.90/1.01  Prover 1: Preprocessing ...
% 1.90/1.01  Prover 4: Preprocessing ...
% 1.90/1.06  Prover 2: Preprocessing ...
% 1.90/1.06  Prover 5: Preprocessing ...
% 1.90/1.06  Prover 0: Preprocessing ...
% 1.90/1.06  Prover 6: Preprocessing ...
% 1.90/1.06  Prover 3: Preprocessing ...
% 2.88/1.14  Prover 5: Constructing countermodel ...
% 2.88/1.14  Prover 2: Constructing countermodel ...
% 2.88/1.14  Prover 1: Constructing countermodel ...
% 2.88/1.15  Prover 6: Proving ...
% 2.88/1.15  Prover 3: Constructing countermodel ...
% 2.88/1.15  Prover 4: Constructing countermodel ...
% 2.88/1.16  Prover 0: Proving ...
% 3.35/1.22  Prover 2: proved (574ms)
% 3.35/1.22  
% 3.35/1.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.23  
% 3.35/1.23  Prover 3: stopped
% 3.35/1.23  Prover 5: stopped
% 3.35/1.23  Prover 0: stopped
% 3.35/1.24  Prover 6: stopped
% 3.35/1.24  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.35/1.24  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.35/1.24  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.35/1.24  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.35/1.24  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.35/1.24  Prover 7: Preprocessing ...
% 3.35/1.25  Prover 10: Preprocessing ...
% 3.35/1.25  Prover 8: Preprocessing ...
% 3.35/1.25  Prover 13: Preprocessing ...
% 3.35/1.25  Prover 11: Preprocessing ...
% 3.35/1.26  Prover 7: Constructing countermodel ...
% 3.86/1.27  Prover 10: Constructing countermodel ...
% 3.86/1.28  Prover 13: Constructing countermodel ...
% 3.86/1.28  Prover 8: Warning: ignoring some quantifiers
% 3.86/1.29  Prover 8: Constructing countermodel ...
% 3.86/1.31  Prover 7: Found proof (size 10)
% 3.86/1.32  Prover 11: Constructing countermodel ...
% 3.86/1.32  Prover 10: Found proof (size 10)
% 3.86/1.32  Prover 13: Found proof (size 10)
% 3.86/1.32  Prover 1: Found proof (size 17)
% 3.86/1.32  Prover 1: proved (681ms)
% 3.86/1.32  Prover 10: proved (83ms)
% 3.86/1.32  Prover 13: proved (82ms)
% 3.86/1.32  Prover 7: proved (91ms)
% 3.86/1.32  Prover 8: stopped
% 3.86/1.32  Prover 4: stopped
% 3.86/1.32  Prover 11: stopped
% 3.86/1.32  
% 3.86/1.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.86/1.32  
% 3.86/1.33  % SZS output start Proof for theBenchmark
% 3.86/1.33  Assumptions after simplification:
% 3.86/1.33  ---------------------------------
% 3.86/1.33  
% 3.86/1.33    (x2107)
% 3.86/1.34    $i(b) & $i(a) & big_r(a, b) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~
% 3.86/1.34      $i(v0) |  ~ big_q(v0, v1) | big_q(v0, v0)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 3.86/1.34      $i(v1) |  ~ $i(v0) |  ~ big_r(v0, v1) | big_q(v0, v1)) &  ! [v0: $i] :  !
% 3.86/1.34    [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ big_r(v0, v1) | big_r(v1, v0)) & ( ~
% 3.86/1.34      big_q(b, b) |  ~ big_q(a, a))
% 3.86/1.34  
% 3.86/1.34  Those formulas are unsatisfiable:
% 3.86/1.34  ---------------------------------
% 3.86/1.34  
% 3.86/1.34  Begin of proof
% 3.86/1.34  | 
% 3.86/1.34  | ALPHA: (x2107) implies:
% 3.86/1.34  |   (1)  big_r(a, b)
% 3.86/1.34  |   (2)  $i(a)
% 3.86/1.34  |   (3)  $i(b)
% 3.86/1.34  |   (4)   ~ big_q(b, b) |  ~ big_q(a, a)
% 3.86/1.35  |   (5)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ big_r(v0, v1) |
% 3.86/1.35  |          big_r(v1, v0))
% 3.86/1.35  |   (6)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ big_r(v0, v1) |
% 3.86/1.35  |          big_q(v0, v1))
% 3.86/1.35  |   (7)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ big_q(v0, v1) |
% 3.86/1.35  |          big_q(v0, v0))
% 3.86/1.35  | 
% 3.86/1.35  | GROUND_INST: instantiating (6) with a, b, simplifying with (1), (2), (3)
% 3.86/1.35  |              gives:
% 3.86/1.35  |   (8)  big_q(a, b)
% 3.86/1.35  | 
% 3.86/1.35  | GROUND_INST: instantiating (5) with a, b, simplifying with (1), (2), (3)
% 3.86/1.35  |              gives:
% 3.86/1.35  |   (9)  big_r(b, a)
% 3.86/1.35  | 
% 3.86/1.35  | GROUND_INST: instantiating (6) with b, a, simplifying with (2), (3), (9)
% 3.86/1.35  |              gives:
% 3.86/1.35  |   (10)  big_q(b, a)
% 3.86/1.35  | 
% 3.86/1.35  | GROUND_INST: instantiating (7) with a, b, simplifying with (2), (3), (8)
% 3.86/1.35  |              gives:
% 3.86/1.35  |   (11)  big_q(a, a)
% 3.86/1.35  | 
% 3.86/1.35  | BETA: splitting (4) gives:
% 3.86/1.35  | 
% 3.86/1.35  | Case 1:
% 3.86/1.35  | | 
% 3.86/1.35  | |   (12)   ~ big_q(b, b)
% 3.86/1.35  | | 
% 3.86/1.35  | | GROUND_INST: instantiating (7) with b, a, simplifying with (2), (3), (10),
% 3.86/1.35  | |              (12) gives:
% 3.86/1.35  | |   (13)  $false
% 3.86/1.36  | | 
% 3.86/1.36  | | CLOSE: (13) is inconsistent.
% 3.86/1.36  | | 
% 3.86/1.36  | Case 2:
% 3.86/1.36  | | 
% 3.86/1.36  | |   (14)   ~ big_q(a, a)
% 3.86/1.36  | | 
% 3.86/1.36  | | PRED_UNIFY: (11), (14) imply:
% 3.86/1.36  | |   (15)  $false
% 3.86/1.36  | | 
% 3.86/1.36  | | CLOSE: (15) is inconsistent.
% 3.86/1.36  | | 
% 3.86/1.36  | End of split
% 3.86/1.36  | 
% 3.86/1.36  End of proof
% 3.86/1.36  % SZS output end Proof for theBenchmark
% 3.86/1.36  
% 3.86/1.36  734ms
%------------------------------------------------------------------------------