%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET055+1 : TPTP v8.1.2. Bugfixed v5.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n001.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 15:23:26 EDT 2023 % Result : Theorem 6.26s 1.61s % Output : Proof 10.90s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET055+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n001.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sat Aug 26 09:55:30 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.33/1.18 Prover 1: Preprocessing ... % 3.33/1.19 Prover 4: Preprocessing ... % 3.33/1.22 Prover 2: Preprocessing ... % 3.33/1.22 Prover 6: Preprocessing ... % 3.33/1.22 Prover 3: Preprocessing ... % 3.33/1.22 Prover 0: Preprocessing ... % 3.33/1.22 Prover 5: Preprocessing ... % 6.26/1.58 Prover 6: Constructing countermodel ... % 6.26/1.58 Prover 3: Constructing countermodel ... % 6.26/1.61 Prover 3: proved (978ms) % 6.26/1.61 % 6.26/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.26/1.61 % 6.26/1.61 Prover 6: proved (973ms) % 6.26/1.61 % 6.26/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.26/1.61 % 6.26/1.62 Prover 2: stopped % 6.26/1.62 Prover 5: Constructing countermodel ... % 6.26/1.62 Prover 5: stopped % 6.26/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.26/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.26/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.26/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.26/1.63 Prover 0: stopped % 6.69/1.64 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.33/1.72 Prover 7: Preprocessing ... % 7.65/1.77 Prover 13: Preprocessing ... % 7.65/1.77 Prover 10: Preprocessing ... % 7.65/1.78 Prover 11: Preprocessing ... % 7.65/1.78 Prover 8: Preprocessing ... % 9.14/1.96 Prover 1: Warning: ignoring some quantifiers % 9.14/2.00 Prover 1: Constructing countermodel ... % 9.14/2.01 Prover 1: Found proof (size 1) % 9.14/2.01 Prover 1: proved (1384ms) % 9.14/2.11 Prover 13: Warning: ignoring some quantifiers % 9.14/2.11 Prover 10: Warning: ignoring some quantifiers % 9.14/2.14 Prover 4: Warning: ignoring some quantifiers % 9.14/2.15 Prover 4: Constructing countermodel ... % 9.14/2.15 Prover 4: stopped % 9.14/2.16 Prover 7: Warning: ignoring some quantifiers % 9.74/2.17 Prover 10: Constructing countermodel ... % 9.74/2.17 Prover 10: stopped % 9.74/2.18 Prover 13: Constructing countermodel ... % 9.74/2.18 Prover 13: stopped % 9.74/2.19 Prover 7: Constructing countermodel ... % 9.74/2.19 Prover 7: stopped % 9.74/2.20 Prover 8: Warning: ignoring some quantifiers % 10.90/2.22 Prover 11: Warning: ignoring some quantifiers % 10.90/2.22 Prover 8: Constructing countermodel ... % 10.90/2.22 Prover 8: stopped % 10.90/2.24 Prover 11: Constructing countermodel ... % 10.90/2.24 Prover 11: stopped % 10.90/2.24 % 10.90/2.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.90/2.24 % 10.90/2.24 % SZS output start Proof for theBenchmark % 10.90/2.25 Assumptions after simplification: % 10.90/2.25 --------------------------------- % 10.90/2.25 % 10.90/2.25 (reflexivity) % 10.90/2.25 $false % 10.90/2.25 % 10.90/2.25 Further assumptions not needed in the proof: % 10.90/2.25 -------------------------------------------- % 10.90/2.25 apply_defn, choice, class_elements_are_sets, complement, compose_defn1, % 10.90/2.25 compose_defn2, cross_product, cross_product_defn, disjoint_defn, domain_of, % 10.90/2.25 element_relation, element_relation_defn, extensionality, first_second, flip, % 10.90/2.25 flip_defn, function_defn, identity_relation, image_defn, inductive_defn, % 10.90/2.25 infinity, intersection, inverse_defn, null_class_defn, ordered_pair_defn, % 10.90/2.25 power_class, power_class_defn, range_of_defn, regularity, replacement, % 10.90/2.25 restrict_defn, rotate, rotate_defn, singleton_set_defn, subclass_defn, % 10.90/2.25 successor_defn, successor_relation_defn1, successor_relation_defn2, sum_class, % 10.90/2.25 sum_class_defn, union_defn, unordered_pair, unordered_pair_defn % 10.90/2.25 % 10.90/2.25 Those formulas are unsatisfiable: % 10.90/2.25 --------------------------------- % 10.90/2.25 % 10.90/2.25 Begin of proof % 10.90/2.25 | % 10.90/2.25 | CLOSE: (reflexivity) is inconsistent. % 10.90/2.25 | % 10.90/2.25 End of proof % 10.90/2.25 % SZS output end Proof for theBenchmark % 10.90/2.26 % 10.90/2.26 1651ms %------------------------------------------------------------------------------