%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PUZ131_1 : TPTP v8.1.2. Released v5.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n017.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 13:23:13 EDT 2023 % Result : Theorem 4.28s 1.34s % Output : Proof 5.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PUZ131_1 : TPTP v8.1.2. Released v5.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n017.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 22:22:56 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.27/1.05 Prover 1: Preprocessing ... % 2.27/1.06 Prover 4: Preprocessing ... % 2.49/1.09 Prover 2: Preprocessing ... % 2.49/1.09 Prover 3: Preprocessing ... % 2.49/1.09 Prover 5: Preprocessing ... % 2.49/1.09 Prover 6: Preprocessing ... % 2.49/1.10 Prover 0: Preprocessing ... % 3.09/1.22 Prover 1: Warning: ignoring some quantifiers % 3.09/1.22 Prover 4: Warning: ignoring some quantifiers % 3.09/1.22 Prover 2: Proving ... % 3.09/1.22 Prover 6: Proving ... % 3.09/1.22 Prover 4: Constructing countermodel ... % 3.09/1.23 Prover 1: Constructing countermodel ... % 3.09/1.23 Prover 5: Proving ... % 3.09/1.23 Prover 3: Warning: ignoring some quantifiers % 3.09/1.24 Prover 3: Constructing countermodel ... % 3.09/1.27 Prover 0: Proving ... % 4.28/1.34 Prover 2: proved (701ms) % 4.28/1.34 Prover 5: proved (698ms) % 4.28/1.34 % 4.28/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.34 % 4.28/1.35 Prover 0: proved (703ms) % 4.28/1.35 % 4.28/1.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.35 % 4.28/1.35 % 4.28/1.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.28/1.35 % 4.28/1.35 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.28/1.35 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.28/1.35 Prover 6: stopped % 4.28/1.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.28/1.35 Prover 3: stopped % 4.28/1.37 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.28/1.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.28/1.38 Prover 10: Preprocessing ... % 4.28/1.39 Prover 8: Preprocessing ... % 4.28/1.39 Prover 11: Preprocessing ... % 4.28/1.39 Prover 7: Preprocessing ... % 4.28/1.40 Prover 13: Preprocessing ... % 4.72/1.40 Prover 4: Found proof (size 17) % 4.72/1.40 Prover 4: proved (759ms) % 4.72/1.40 Prover 1: stopped % 4.72/1.41 Prover 10: Warning: ignoring some quantifiers % 4.72/1.41 Prover 10: Constructing countermodel ... % 4.72/1.41 Prover 7: Warning: ignoring some quantifiers % 4.72/1.42 Prover 11: stopped % 4.72/1.42 Prover 7: Constructing countermodel ... % 4.72/1.42 Prover 10: stopped % 4.72/1.42 Prover 7: stopped % 4.72/1.42 Prover 13: Warning: ignoring some quantifiers % 4.72/1.42 Prover 8: Warning: ignoring some quantifiers % 4.72/1.43 Prover 13: Constructing countermodel ... % 4.72/1.43 Prover 13: stopped % 4.72/1.43 Prover 8: Constructing countermodel ... % 4.72/1.44 Prover 8: stopped % 4.72/1.44 % 4.72/1.44 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.72/1.44 % 4.72/1.44 % SZS output start Proof for theBenchmark % 4.72/1.44 Assumptions after simplification: % 4.72/1.44 --------------------------------- % 4.72/1.44 % 4.72/1.44 (coordinator_teaches) % 5.08/1.47 ! [v0: course] : ! [v1: professor] : ( ~ (coordinatorof(v0) = v1) | ~ % 5.08/1.47 course(v0) | teaches(v1, v0) = 0) % 5.08/1.47 % 5.08/1.47 (michael_enrolled_csc410_axiom) % 5.08/1.47 enrolled(michael, csc410) = 0 & course(csc410) & student(michael) % 5.08/1.47 % 5.08/1.47 (student_enrolled_taught) % 5.08/1.48 ! [v0: student] : ! [v1: course] : ! [v2: professor] : ! [v3: int] : (v3 = % 5.08/1.48 0 | ~ (taughtby(v0, v2) = v3) | ~ (enrolled(v0, v1) = 0) | ~ course(v1) | % 5.08/1.48 ~ professor(v2) | ~ student(v0) | ? [v4: int] : ( ~ (v4 = 0) & % 5.08/1.48 teaches(v2, v1) = v4)) & ! [v0: student] : ! [v1: course] : ! [v2: % 5.08/1.48 professor] : ( ~ (teaches(v2, v1) = 0) | ~ (enrolled(v0, v1) = 0) | ~ % 5.08/1.48 course(v1) | ~ professor(v2) | ~ student(v0) | taughtby(v0, v2) = 0) % 5.08/1.48 % 5.08/1.48 (teaching_conjecture) % 5.08/1.48 professor(victor) & student(michael) & ? [v0: int] : ( ~ (v0 = 0) & % 5.08/1.48 taughtby(michael, victor) = v0) % 5.08/1.48 % 5.08/1.48 (victor_coordinator_csc410_axiom) % 5.08/1.48 coordinatorof(csc410) = victor & course(csc410) & professor(victor) % 5.08/1.48 % 5.08/1.48 (function-axioms) % 5.08/1.48 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: professor] : % 5.08/1.48 ! [v3: student] : (v1 = v0 | ~ (taughtby(v3, v2) = v1) | ~ (taughtby(v3, % 5.08/1.48 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 5.08/1.48 ! [v2: course] : ! [v3: professor] : (v1 = v0 | ~ (teaches(v3, v2) = v1) | % 5.08/1.48 ~ (teaches(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 5.08/1.48 MultipleValueBool] : ! [v2: course] : ! [v3: student] : (v1 = v0 | ~ % 5.08/1.48 (enrolled(v3, v2) = v1) | ~ (enrolled(v3, v2) = v0)) & ! [v0: professor] : % 5.08/1.48 ! [v1: professor] : ! [v2: course] : (v1 = v0 | ~ (coordinatorof(v2) = v1) % 5.08/1.48 | ~ (coordinatorof(v2) = v0)) % 5.08/1.48 % 5.08/1.48 Further assumptions not needed in the proof: % 5.08/1.48 -------------------------------------------- % 5.08/1.48 course_enrolled, course_teaches, professor_teaches, student_enrolled_axiom % 5.08/1.48 % 5.08/1.48 Those formulas are unsatisfiable: % 5.08/1.48 --------------------------------- % 5.08/1.48 % 5.08/1.48 Begin of proof % 5.08/1.48 | % 5.08/1.48 | ALPHA: (student_enrolled_taught) implies: % 5.08/1.49 | (1) ! [v0: student] : ! [v1: course] : ! [v2: professor] : ! [v3: int] % 5.08/1.49 | : (v3 = 0 | ~ (taughtby(v0, v2) = v3) | ~ (enrolled(v0, v1) = 0) | ~ % 5.08/1.49 | course(v1) | ~ professor(v2) | ~ student(v0) | ? [v4: int] : ( ~ % 5.08/1.49 | (v4 = 0) & teaches(v2, v1) = v4)) % 5.08/1.49 | % 5.08/1.49 | ALPHA: (michael_enrolled_csc410_axiom) implies: % 5.08/1.49 | (2) enrolled(michael, csc410) = 0 % 5.08/1.49 | % 5.08/1.49 | ALPHA: (victor_coordinator_csc410_axiom) implies: % 5.08/1.49 | (3) course(csc410) % 5.08/1.49 | (4) coordinatorof(csc410) = victor % 5.08/1.49 | % 5.08/1.49 | ALPHA: (teaching_conjecture) implies: % 5.08/1.49 | (5) student(michael) % 5.08/1.49 | (6) professor(victor) % 5.08/1.49 | (7) ? [v0: int] : ( ~ (v0 = 0) & taughtby(michael, victor) = v0) % 5.08/1.49 | % 5.08/1.49 | ALPHA: (function-axioms) implies: % 5.08/1.49 | (8) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.08/1.49 | course] : ! [v3: professor] : (v1 = v0 | ~ (teaches(v3, v2) = v1) | % 5.08/1.49 | ~ (teaches(v3, v2) = v0)) % 5.08/1.49 | % 5.08/1.49 | DELTA: instantiating (7) with fresh symbol all_12_0 gives: % 5.08/1.49 | (9) ~ (all_12_0 = 0) & taughtby(michael, victor) = all_12_0 % 5.08/1.49 | % 5.08/1.49 | ALPHA: (9) implies: % 5.08/1.49 | (10) ~ (all_12_0 = 0) % 5.08/1.49 | (11) taughtby(michael, victor) = all_12_0 % 5.08/1.49 | % 5.08/1.49 | GROUND_INST: instantiating (coordinator_teaches) with csc410, victor, % 5.08/1.49 | simplifying with (3), (4) gives: % 5.08/1.49 | (12) teaches(victor, csc410) = 0 % 5.08/1.49 | % 5.08/1.50 | GROUND_INST: instantiating (1) with michael, csc410, victor, all_12_0, % 5.08/1.50 | simplifying with (2), (3), (5), (6), (11) gives: % 5.08/1.50 | (13) all_12_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & teaches(victor, csc410) = % 5.08/1.50 | v0) % 5.08/1.50 | % 5.08/1.50 | BETA: splitting (13) gives: % 5.08/1.50 | % 5.08/1.50 | Case 1: % 5.08/1.50 | | % 5.08/1.50 | | (14) all_12_0 = 0 % 5.08/1.50 | | % 5.08/1.50 | | REDUCE: (10), (14) imply: % 5.08/1.50 | | (15) $false % 5.08/1.50 | | % 5.08/1.50 | | CLOSE: (15) is inconsistent. % 5.08/1.50 | | % 5.08/1.50 | Case 2: % 5.08/1.50 | | % 5.08/1.50 | | (16) ? [v0: int] : ( ~ (v0 = 0) & teaches(victor, csc410) = v0) % 5.08/1.50 | | % 5.08/1.50 | | DELTA: instantiating (16) with fresh symbol all_28_0 gives: % 5.08/1.50 | | (17) ~ (all_28_0 = 0) & teaches(victor, csc410) = all_28_0 % 5.08/1.50 | | % 5.08/1.50 | | ALPHA: (17) implies: % 5.08/1.50 | | (18) ~ (all_28_0 = 0) % 5.08/1.50 | | (19) teaches(victor, csc410) = all_28_0 % 5.08/1.50 | | % 5.08/1.50 | | GROUND_INST: instantiating (8) with 0, all_28_0, csc410, victor, simplifying % 5.08/1.50 | | with (12), (19) gives: % 5.08/1.50 | | (20) all_28_0 = 0 % 5.08/1.50 | | % 5.08/1.50 | | REDUCE: (18), (20) imply: % 5.08/1.50 | | (21) $false % 5.08/1.50 | | % 5.08/1.50 | | CLOSE: (21) is inconsistent. % 5.08/1.50 | | % 5.08/1.50 | End of split % 5.08/1.50 | % 5.08/1.50 End of proof % 5.08/1.50 % SZS output end Proof for theBenchmark % 5.08/1.50 % 5.08/1.50 880ms %------------------------------------------------------------------------------