%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n013.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 20:11:33 EDT 2023 % Result : Theorem 2.89s 1.11s % Output : Proof 3.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.35 % Computer : n013.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Sun Aug 27 07:05:02 EDT 2023 % 0.15/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.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.90/0.94 Prover 1: Preprocessing ... % 1.90/0.94 Prover 4: Preprocessing ... % 1.90/0.98 Prover 5: Preprocessing ... % 1.90/0.98 Prover 0: Preprocessing ... % 1.90/0.98 Prover 6: Preprocessing ... % 1.90/0.98 Prover 3: Preprocessing ... % 1.90/0.98 Prover 2: Preprocessing ... % 2.50/1.03 Prover 1: Constructing countermodel ... % 2.50/1.03 Prover 3: Constructing countermodel ... % 2.50/1.03 Prover 5: Constructing countermodel ... % 2.50/1.03 Prover 4: Constructing countermodel ... % 2.50/1.04 Prover 0: Proving ... % 2.50/1.04 Prover 2: Proving ... % 2.50/1.04 Prover 6: Proving ... % 2.89/1.11 Prover 3: proved (466ms) % 2.89/1.11 % 2.89/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/1.11 % 2.89/1.11 Prover 5: proved (461ms) % 2.89/1.11 % 2.89/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/1.11 % 2.89/1.11 Prover 0: proved (477ms) % 2.89/1.11 % 2.89/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/1.11 % 2.89/1.11 Prover 2: proved (476ms) % 2.89/1.11 % 2.89/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/1.11 % 2.89/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.89/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.89/1.11 Prover 6: stopped % 2.89/1.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.89/1.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.89/1.12 Prover 1: Found proof (size 6) % 2.89/1.12 Prover 4: Found proof (size 6) % 2.89/1.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.89/1.12 Prover 8: Preprocessing ... % 2.89/1.12 Prover 1: proved (487ms) % 2.89/1.12 Prover 4: proved (477ms) % 2.89/1.12 Prover 10: Preprocessing ... % 2.89/1.13 Prover 13: Preprocessing ... % 2.89/1.13 Prover 11: Preprocessing ... % 2.89/1.13 Prover 7: Preprocessing ... % 2.89/1.14 Prover 13: Constructing countermodel ... % 2.89/1.14 Prover 8: Warning: ignoring some quantifiers % 2.89/1.14 Prover 13: stopped % 2.89/1.14 Prover 8: Constructing countermodel ... % 2.89/1.15 Prover 8: stopped % 2.89/1.15 Prover 10: Constructing countermodel ... % 2.89/1.15 Prover 11: Constructing countermodel ... % 2.89/1.15 Prover 10: stopped % 2.89/1.15 Prover 7: Constructing countermodel ... % 2.89/1.15 Prover 11: stopped % 2.89/1.15 Prover 7: stopped % 2.89/1.15 % 2.89/1.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.89/1.15 % 2.89/1.16 % SZS output start Proof for theBenchmark % 2.89/1.16 Assumptions after simplification: % 2.89/1.16 --------------------------------- % 2.89/1.16 % 2.89/1.16 (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) % 3.48/1.21 $i(uri_ex_s) & $i(uri_ex_p) & ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0) % 3.48/1.21 = 0) | ~ $i(v0)) % 3.48/1.21 % 3.48/1.21 (testcase_premise_fullish_003_Blank_Nodes_for_Literals) % 3.48/1.21 $i(dat_str_foo) & $i(uri_ex_s) & $i(uri_ex_p) & ? [v0: $i] : % 3.48/1.21 (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0)) % 3.48/1.21 % 3.48/1.21 Those formulas are unsatisfiable: % 3.48/1.21 --------------------------------- % 3.48/1.21 % 3.48/1.21 Begin of proof % 3.48/1.21 | % 3.48/1.21 | ALPHA: (testcase_premise_fullish_003_Blank_Nodes_for_Literals) implies: % 3.48/1.21 | (1) ? [v0: $i] : (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p, % 3.48/1.21 | uri_ex_s, v0) = 0 & $i(v0)) % 3.48/1.21 | % 3.48/1.21 | ALPHA: (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) implies: % 3.48/1.22 | (2) ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0) = 0) | ~ $i(v0)) % 3.48/1.22 | % 3.48/1.22 | DELTA: instantiating (1) with fresh symbol all_5_0 gives: % 3.48/1.22 | (3) literal_plain(dat_str_foo) = all_5_0 & iext(uri_ex_p, uri_ex_s, % 3.48/1.22 | all_5_0) = 0 & $i(all_5_0) % 3.48/1.22 | % 3.48/1.22 | ALPHA: (3) implies: % 3.48/1.22 | (4) $i(all_5_0) % 3.48/1.22 | (5) iext(uri_ex_p, uri_ex_s, all_5_0) = 0 % 3.48/1.22 | % 3.48/1.22 | GROUND_INST: instantiating (2) with all_5_0, simplifying with (4), (5) gives: % 3.48/1.22 | (6) $false % 3.48/1.22 | % 3.48/1.22 | CLOSE: (6) is inconsistent. % 3.48/1.22 | % 3.48/1.22 End of proof % 3.48/1.22 % SZS output end Proof for theBenchmark % 3.48/1.22 % 3.48/1.22 608ms %------------------------------------------------------------------------------