↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n018.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 : Sun Apr  6 10:08:51 AM UTC 2025

% Result   : Theorem 5.84s 1.51s
% Output   : Proof 7.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWX000_1 : TPTP v9.1.0. Released v9.1.0.
% 0.04/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Sun Apr  6 03:11:47 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.54/0.62  ________       _____
% 0.54/0.62  ___  __ \_________(_)________________________________
% 0.54/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.54/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.54/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.54/0.62  
% 0.54/0.62  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.54/0.62  (2023-06-19)
% 0.54/0.62  
% 0.54/0.62  (c) Philipp Rümmer, 2009-2023
% 0.54/0.62  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.54/0.62                Amanda Stjerna.
% 0.54/0.62  Free software under BSD-3-Clause.
% 0.54/0.62  
% 0.54/0.62  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.54/0.62  
% 0.54/0.62  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.54/0.63  Running up to 7 provers in parallel.
% 0.71/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.71/1.12  Prover 4: Preprocessing ...
% 2.71/1.12  Prover 1: Preprocessing ...
% 3.27/1.15  Prover 3: Preprocessing ...
% 3.27/1.15  Prover 6: Preprocessing ...
% 3.27/1.15  Prover 0: Preprocessing ...
% 3.27/1.15  Prover 5: Preprocessing ...
% 3.27/1.15  Prover 2: Preprocessing ...
% 4.91/1.41  Prover 5: Proving ...
% 4.91/1.42  Prover 2: Proving ...
% 4.91/1.42  Prover 3: Constructing countermodel ...
% 4.91/1.43  Prover 1: Constructing countermodel ...
% 5.55/1.45  Prover 6: Proving ...
% 5.55/1.48  Prover 0: Proving ...
% 5.84/1.49  Prover 4: Constructing countermodel ...
% 5.84/1.51  Prover 3: proved (868ms)
% 5.84/1.51  
% 5.84/1.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.84/1.51  
% 5.84/1.51  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.84/1.51  Prover 5: proved (871ms)
% 5.84/1.51  Prover 6: proved (871ms)
% 5.84/1.51  
% 5.84/1.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.84/1.51  
% 5.84/1.51  
% 5.84/1.51  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.84/1.51  
% 5.84/1.52  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.84/1.52  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.84/1.53  Prover 0: stopped
% 5.84/1.53  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.84/1.53  Prover 2: stopped
% 6.38/1.55  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.38/1.56  Prover 1: Found proof (size 29)
% 6.38/1.56  Prover 1: proved (918ms)
% 6.38/1.56  Prover 4: stopped
% 6.38/1.58  Prover 7: Preprocessing ...
% 6.38/1.59  Prover 8: Preprocessing ...
% 6.38/1.59  Prover 11: Preprocessing ...
% 6.38/1.59  Prover 10: Preprocessing ...
% 6.38/1.60  Prover 13: Preprocessing ...
% 6.38/1.61  Prover 7: stopped
% 6.38/1.61  Prover 10: stopped
% 6.38/1.62  Prover 11: stopped
% 6.91/1.63  Prover 13: stopped
% 7.15/1.67  Prover 8: Warning: ignoring some quantifiers
% 7.15/1.68  Prover 8: Constructing countermodel ...
% 7.15/1.69  Prover 8: stopped
% 7.15/1.69  
% 7.15/1.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.15/1.69  
% 7.15/1.69  % SZS output start Proof for theBenchmark
% 7.15/1.70  Assumptions after simplification:
% 7.15/1.70  ---------------------------------
% 7.15/1.70  
% 7.15/1.70    (formula_1_transition_axiom_1)
% 7.15/1.70     ~ hp | tp
% 7.15/1.70  
% 7.15/1.70    (formula_2_right_0)
% 7.15/1.70    ( ~ tp | tq) & ( ~ hp | hq)
% 7.15/1.70  
% 7.15/1.70    (formula_3_left_0)
% 7.15/1.70    (tp &  ~ tq) | (hp &  ~ hq)
% 7.15/1.70  
% 7.15/1.70  Further assumptions not needed in the proof:
% 7.15/1.70  --------------------------------------------
% 7.15/1.70  antisymmetric_ordering_ax, f__integer__def_ax, f__symbolic__def_ax,
% 7.15/1.70  formula_0_transition_axiom_0, general_universe_ax, maximal_element_ax,
% 7.15/1.70  minimal_element_ax, numeral_ordering_ax, numerals_less_than_symbols_ax,
% 7.15/1.70  p__greater__def_ax, p__greater_equal__def_ax, p__is_integer__def_ax,
% 7.15/1.70  p__is_symbolic__def_ax, p__less__def_ax, strongly_connected_ordering_ax,
% 7.15/1.70  transitive_ordering_ax
% 7.15/1.70  
% 7.15/1.70  Those formulas are unsatisfiable:
% 7.15/1.70  ---------------------------------
% 7.15/1.70  
% 7.15/1.70  Begin of proof
% 7.15/1.70  | 
% 7.15/1.70  | ALPHA: (formula_2_right_0) implies:
% 7.15/1.71  |   (1)   ~ hp | hq
% 7.15/1.71  |   (2)   ~ tp | tq
% 7.15/1.71  | 
% 7.15/1.71  | BETA: splitting (formula_1_transition_axiom_1) gives:
% 7.15/1.71  | 
% 7.15/1.71  | Case 1:
% 7.15/1.71  | | 
% 7.15/1.71  | |   (3)   ~ hp
% 7.15/1.71  | | 
% 7.15/1.71  | | BETA: splitting (formula_3_left_0) gives:
% 7.15/1.71  | | 
% 7.15/1.71  | | Case 1:
% 7.15/1.71  | | | 
% 7.15/1.71  | | |   (4)  tp &  ~ tq
% 7.15/1.71  | | | 
% 7.15/1.71  | | | ALPHA: (4) implies:
% 7.15/1.71  | | |   (5)   ~ tq
% 7.15/1.71  | | |   (6)  tp
% 7.15/1.71  | | | 
% 7.15/1.71  | | | BETA: splitting (2) gives:
% 7.15/1.71  | | | 
% 7.15/1.71  | | | Case 1:
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | |   (7)   ~ tp
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | PRED_UNIFY: (6), (7) imply:
% 7.15/1.71  | | | |   (8)  $false
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | CLOSE: (8) is inconsistent.
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | Case 2:
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | |   (9)  tq
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | PRED_UNIFY: (5), (9) imply:
% 7.15/1.71  | | | |   (10)  $false
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | CLOSE: (10) is inconsistent.
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | End of split
% 7.15/1.71  | | | 
% 7.15/1.71  | | Case 2:
% 7.15/1.71  | | | 
% 7.15/1.71  | | |   (11)  hp &  ~ hq
% 7.15/1.71  | | | 
% 7.15/1.71  | | | ALPHA: (11) implies:
% 7.15/1.71  | | |   (12)  hp
% 7.15/1.71  | | | 
% 7.15/1.71  | | | PRED_UNIFY: (3), (12) imply:
% 7.15/1.71  | | |   (13)  $false
% 7.15/1.71  | | | 
% 7.15/1.71  | | | CLOSE: (13) is inconsistent.
% 7.15/1.71  | | | 
% 7.15/1.71  | | End of split
% 7.15/1.71  | | 
% 7.15/1.71  | Case 2:
% 7.15/1.71  | | 
% 7.15/1.71  | |   (14)  hp
% 7.15/1.71  | |   (15)  tp
% 7.15/1.71  | | 
% 7.15/1.71  | | BETA: splitting (1) gives:
% 7.15/1.71  | | 
% 7.15/1.71  | | Case 1:
% 7.15/1.71  | | | 
% 7.15/1.71  | | |   (16)   ~ hp
% 7.15/1.71  | | | 
% 7.15/1.71  | | | PRED_UNIFY: (14), (16) imply:
% 7.15/1.71  | | |   (17)  $false
% 7.15/1.71  | | | 
% 7.15/1.71  | | | CLOSE: (17) is inconsistent.
% 7.15/1.71  | | | 
% 7.15/1.71  | | Case 2:
% 7.15/1.71  | | | 
% 7.15/1.71  | | |   (18)  hq
% 7.15/1.71  | | | 
% 7.15/1.71  | | | BETA: splitting (2) gives:
% 7.15/1.71  | | | 
% 7.15/1.71  | | | Case 1:
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | |   (19)   ~ tp
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | PRED_UNIFY: (15), (19) imply:
% 7.15/1.71  | | | |   (20)  $false
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | CLOSE: (20) is inconsistent.
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | Case 2:
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | |   (21)  tq
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | BETA: splitting (formula_3_left_0) gives:
% 7.15/1.71  | | | | 
% 7.15/1.71  | | | | Case 1:
% 7.15/1.71  | | | | | 
% 7.15/1.72  | | | | |   (22)  tp &  ~ tq
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | ALPHA: (22) implies:
% 7.15/1.72  | | | | |   (23)   ~ tq
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | PRED_UNIFY: (21), (23) imply:
% 7.15/1.72  | | | | |   (24)  $false
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | CLOSE: (24) is inconsistent.
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | Case 2:
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | |   (25)  hp &  ~ hq
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | ALPHA: (25) implies:
% 7.15/1.72  | | | | |   (26)   ~ hq
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | PRED_UNIFY: (18), (26) imply:
% 7.15/1.72  | | | | |   (27)  $false
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | | CLOSE: (27) is inconsistent.
% 7.15/1.72  | | | | | 
% 7.15/1.72  | | | | End of split
% 7.15/1.72  | | | | 
% 7.15/1.72  | | | End of split
% 7.15/1.72  | | | 
% 7.15/1.72  | | End of split
% 7.15/1.72  | | 
% 7.15/1.72  | End of split
% 7.15/1.72  | 
% 7.15/1.72  End of proof
% 7.15/1.72  % SZS output end Proof for theBenchmark
% 7.15/1.72  
% 7.15/1.72  1096ms
%------------------------------------------------------------------------------