%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PUZ131+1 : TPTP v8.1.2. Released v4.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n003.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:14 EDT 2023 % Result : Theorem 5.09s 1.47s % Output : Proof 7.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PUZ131+1 : TPTP v8.1.2. Released v4.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n003.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 22:44:39 EDT 2023 % 0.12/0.34 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.62 Running up to 7 provers in parallel. % 0.18/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.87/1.00 Prover 1: Preprocessing ... % 1.87/1.00 Prover 4: Preprocessing ... % 2.22/1.05 Prover 5: Preprocessing ... % 2.22/1.05 Prover 6: Preprocessing ... % 2.22/1.05 Prover 0: Preprocessing ... % 2.22/1.05 Prover 3: Preprocessing ... % 2.49/1.05 Prover 2: Preprocessing ... % 3.70/1.29 Prover 5: Constructing countermodel ... % 3.70/1.30 Prover 1: Constructing countermodel ... % 3.70/1.30 Prover 3: Constructing countermodel ... % 3.70/1.31 Prover 6: Proving ... % 3.70/1.31 Prover 2: Proving ... % 3.70/1.31 Prover 4: Constructing countermodel ... % 3.70/1.32 Prover 0: Proving ... % 5.09/1.46 Prover 0: proved (828ms) % 5.09/1.46 % 5.09/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.09/1.47 % 5.09/1.47 Prover 2: stopped % 5.09/1.47 Prover 5: stopped % 5.09/1.47 Prover 6: stopped % 5.09/1.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.09/1.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.09/1.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.09/1.47 Prover 3: stopped % 5.09/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.09/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.09/1.50 Prover 11: Preprocessing ... % 5.09/1.50 Prover 7: Preprocessing ... % 5.09/1.51 Prover 13: Preprocessing ... % 5.09/1.51 Prover 8: Preprocessing ... % 5.57/1.51 Prover 10: Preprocessing ... % 5.57/1.53 Prover 7: Constructing countermodel ... % 5.57/1.55 Prover 10: Constructing countermodel ... % 5.96/1.58 Prover 13: Constructing countermodel ... % 5.96/1.60 Prover 8: Warning: ignoring some quantifiers % 5.96/1.61 Prover 8: Constructing countermodel ... % 5.96/1.63 Prover 11: Constructing countermodel ... % 6.91/1.69 Prover 10: Found proof (size 9) % 6.91/1.69 Prover 10: proved (222ms) % 6.91/1.69 Prover 13: stopped % 6.91/1.69 Prover 7: stopped % 6.91/1.70 Prover 1: stopped % 6.91/1.70 Prover 8: stopped % 6.91/1.70 Prover 4: stopped % 6.91/1.70 Prover 11: stopped % 6.91/1.70 % 6.91/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.91/1.70 % 6.91/1.70 % SZS output start Proof for theBenchmark % 6.91/1.70 Assumptions after simplification: % 6.91/1.70 --------------------------------- % 6.91/1.70 % 6.91/1.70 (coordinator_teaches) % 6.91/1.73 ! [v0: $i] : ! [v1: $i] : ( ~ (coordinatorof(v0) = v1) | ~ $i(v0) | ~ % 6.91/1.73 course(v0) | teaches(v1, v0)) % 6.91/1.73 % 6.91/1.73 (csc410_type) % 6.91/1.73 $i(csc410) & course(csc410) % 6.91/1.73 % 6.91/1.73 (michael_enrolled_csc410_axiom) % 6.91/1.73 $i(csc410) & $i(michael) & enrolled(michael, csc410) % 6.91/1.73 % 6.91/1.73 (michael_type) % 6.91/1.73 $i(michael) & student(michael) % 6.91/1.73 % 6.91/1.73 (student_enrolled_taught) % 7.15/1.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 7.15/1.73 ~ teaches(v2, v1) | ~ enrolled(v0, v1) | ~ course(v1) | ~ professor(v2) % 7.15/1.73 | ~ student(v0) | taughtby(v0, v2)) % 7.15/1.73 % 7.15/1.73 (teaching_conjecture) % 7.15/1.73 $i(victor) & $i(michael) & ~ taughtby(michael, victor) % 7.15/1.73 % 7.15/1.73 (victor_coordinator_csc410_axiom) % 7.15/1.73 coordinatorof(csc410) = victor & $i(csc410) & $i(victor) % 7.15/1.73 % 7.15/1.73 (victor_type) % 7.15/1.73 $i(victor) & professor(victor) % 7.15/1.73 % 7.15/1.73 Further assumptions not needed in the proof: % 7.15/1.73 -------------------------------------------- % 7.15/1.73 coordinator_of_type, course_enrolled, course_teaches, course_type, % 7.15/1.73 professor_teaches, professor_type, student_enrolled_axiom, student_type % 7.15/1.73 % 7.15/1.73 Those formulas are unsatisfiable: % 7.15/1.73 --------------------------------- % 7.15/1.73 % 7.15/1.73 Begin of proof % 7.15/1.73 | % 7.15/1.73 | ALPHA: (michael_type) implies: % 7.15/1.73 | (1) student(michael) % 7.15/1.73 | % 7.15/1.73 | ALPHA: (victor_type) implies: % 7.15/1.73 | (2) professor(victor) % 7.15/1.73 | % 7.15/1.73 | ALPHA: (csc410_type) implies: % 7.15/1.73 | (3) course(csc410) % 7.15/1.73 | % 7.15/1.73 | ALPHA: (michael_enrolled_csc410_axiom) implies: % 7.15/1.74 | (4) enrolled(michael, csc410) % 7.15/1.74 | % 7.15/1.74 | ALPHA: (victor_coordinator_csc410_axiom) implies: % 7.15/1.74 | (5) $i(csc410) % 7.15/1.74 | (6) coordinatorof(csc410) = victor % 7.15/1.74 | % 7.15/1.74 | ALPHA: (teaching_conjecture) implies: % 7.15/1.74 | (7) ~ taughtby(michael, victor) % 7.15/1.74 | (8) $i(michael) % 7.15/1.74 | (9) $i(victor) % 7.15/1.74 | % 7.15/1.74 | GROUND_INST: instantiating (coordinator_teaches) with csc410, victor, % 7.15/1.74 | simplifying with (3), (5), (6) gives: % 7.15/1.74 | (10) teaches(victor, csc410) % 7.15/1.74 | % 7.15/1.74 | GROUND_INST: instantiating (student_enrolled_taught) with michael, csc410, % 7.21/1.74 | victor, simplifying with (1), (2), (3), (4), (5), (7), (8), (9), % 7.21/1.74 | (10) gives: % 7.21/1.74 | (11) $false % 7.21/1.74 | % 7.21/1.74 | CLOSE: (11) is inconsistent. % 7.21/1.74 | % 7.21/1.74 End of proof % 7.21/1.74 % SZS output end Proof for theBenchmark % 7.21/1.74 % 7.21/1.74 1148ms %------------------------------------------------------------------------------