TSTP Solution File: CSR051+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n012.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 21:36:51 EDT 2023
% Result : Theorem 5.53s 1.49s
% Output : Proof 7.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR051+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n012.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 : Mon Aug 28 07:18:55 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 ________ _____
% 0.20/0.57 ___ __ \_________(_)________________________________
% 0.20/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.57
% 0.20/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.57 (2023-06-19)
% 0.20/0.57
% 0.20/0.57 (c) Philipp Rümmer, 2009-2023
% 0.20/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.57 Amanda Stjerna.
% 0.20/0.57 Free software under BSD-3-Clause.
% 0.20/0.57
% 0.20/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.57
% 0.20/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.58 Running up to 7 provers in parallel.
% 0.20/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.46/1.04 Prover 1: Preprocessing ...
% 2.46/1.04 Prover 4: Preprocessing ...
% 2.79/1.08 Prover 0: Preprocessing ...
% 2.79/1.08 Prover 6: Preprocessing ...
% 2.79/1.08 Prover 2: Preprocessing ...
% 2.79/1.08 Prover 5: Preprocessing ...
% 2.79/1.08 Prover 3: Preprocessing ...
% 4.18/1.35 Prover 2: Constructing countermodel ...
% 4.18/1.40 Prover 5: Proving ...
% 4.57/1.42 Prover 1: Warning: ignoring some quantifiers
% 4.57/1.43 Prover 3: Warning: ignoring some quantifiers
% 4.57/1.43 Prover 1: Constructing countermodel ...
% 4.57/1.44 Prover 6: Proving ...
% 4.57/1.45 Prover 3: Constructing countermodel ...
% 5.53/1.48 Prover 2: proved (889ms)
% 5.53/1.49
% 5.53/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.53/1.49
% 5.53/1.49 Prover 3: stopped
% 5.53/1.50 Prover 5: stopped
% 5.53/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.53/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.53/1.51 Prover 6: stopped
% 5.53/1.52 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.53/1.53 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.53/1.54 Prover 7: Preprocessing ...
% 5.53/1.55 Prover 8: Preprocessing ...
% 6.14/1.57 Prover 10: Preprocessing ...
% 6.14/1.58 Prover 11: Preprocessing ...
% 6.14/1.59 Prover 4: Constructing countermodel ...
% 6.35/1.60 Prover 7: Constructing countermodel ...
% 6.66/1.64 Prover 0: Proving ...
% 6.66/1.64 Prover 0: stopped
% 6.66/1.64 Prover 10: Constructing countermodel ...
% 6.70/1.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.70/1.66 Prover 7: Found proof (size 7)
% 6.70/1.66 Prover 4: Found proof (size 12)
% 6.70/1.66 Prover 7: proved (174ms)
% 6.70/1.66 Prover 4: proved (1068ms)
% 6.70/1.66 Prover 10: stopped
% 6.70/1.66 Prover 1: stopped
% 6.70/1.68 Prover 13: Preprocessing ...
% 6.70/1.69 Prover 8: Warning: ignoring some quantifiers
% 6.70/1.69 Prover 13: stopped
% 7.10/1.71 Prover 8: Constructing countermodel ...
% 7.10/1.71 Prover 8: stopped
% 7.38/1.77 Prover 11: Constructing countermodel ...
% 7.38/1.78 Prover 11: stopped
% 7.38/1.78
% 7.38/1.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.38/1.78
% 7.38/1.79 % SZS output start Proof for theBenchmark
% 7.38/1.79 Assumptions after simplification:
% 7.38/1.79 ---------------------------------
% 7.38/1.79
% 7.38/1.79 (just1)
% 7.38/1.79 $i(c_tptpmarriagelicensedocument) & $i(c_tptp_member3356_mt) & ( ~
% 7.38/1.79 mtvisible(c_tptp_member3356_mt) |
% 7.38/1.79 marriagelicensedocument(c_tptpmarriagelicensedocument))
% 7.38/1.79
% 7.38/1.79 (query51)
% 7.38/1.80 $i(c_tptp_member3356_mt) & mtvisible(c_tptp_member3356_mt) & ! [v0: $i] : ( ~
% 7.38/1.80 $i(v0) | ~ marriagelicensedocument(v0))
% 7.38/1.80
% 7.38/1.80 Further assumptions not needed in the proof:
% 7.38/1.80 --------------------------------------------
% 7.38/1.80 just10, just11, just12, just13, just14, just15, just16, just17, just18, just19,
% 7.38/1.80 just2, just20, just21, just22, just23, just24, just25, just26, just27, just3,
% 7.38/1.80 just4, just5, just6, just7, just8, just9
% 7.38/1.80
% 7.38/1.80 Those formulas are unsatisfiable:
% 7.38/1.80 ---------------------------------
% 7.38/1.80
% 7.38/1.80 Begin of proof
% 7.38/1.80 |
% 7.38/1.80 | ALPHA: (query51) implies:
% 7.38/1.80 | (1) mtvisible(c_tptp_member3356_mt)
% 7.38/1.80 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ marriagelicensedocument(v0))
% 7.38/1.80 |
% 7.38/1.80 | ALPHA: (just1) implies:
% 7.38/1.80 | (3) $i(c_tptpmarriagelicensedocument)
% 7.38/1.80 | (4) ~ mtvisible(c_tptp_member3356_mt) |
% 7.38/1.80 | marriagelicensedocument(c_tptpmarriagelicensedocument)
% 7.38/1.80 |
% 7.38/1.80 | BETA: splitting (4) gives:
% 7.38/1.80 |
% 7.38/1.80 | Case 1:
% 7.38/1.80 | |
% 7.38/1.80 | | (5) ~ mtvisible(c_tptp_member3356_mt)
% 7.38/1.80 | |
% 7.38/1.80 | | PRED_UNIFY: (1), (5) imply:
% 7.38/1.80 | | (6) $false
% 7.38/1.80 | |
% 7.38/1.80 | | CLOSE: (6) is inconsistent.
% 7.38/1.80 | |
% 7.38/1.80 | Case 2:
% 7.38/1.80 | |
% 7.38/1.80 | | (7) marriagelicensedocument(c_tptpmarriagelicensedocument)
% 7.38/1.80 | |
% 7.38/1.80 | | GROUND_INST: instantiating (2) with c_tptpmarriagelicensedocument,
% 7.38/1.80 | | simplifying with (3), (7) gives:
% 7.38/1.80 | | (8) $false
% 7.38/1.80 | |
% 7.38/1.80 | | CLOSE: (8) is inconsistent.
% 7.38/1.80 | |
% 7.38/1.80 | End of split
% 7.38/1.80 |
% 7.38/1.80 End of proof
% 7.38/1.80 % SZS output end Proof for theBenchmark
% 7.38/1.81
% 7.38/1.81 1234ms
%------------------------------------------------------------------------------