TSTP Solution File: PUZ131-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n025.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 : 600s
% DateTime : Mon Jul 18 18:11:16 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n025.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 : 600
% 0.13/0.34 % DateTime : Sun May 29 01:47:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 21 Number of unprocessed: 21
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 21 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 21 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 0 extension rule candidate clauses
% 0.13/0.38 # 21 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # Creating equality axioms
% 0.13/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.38 # Returning from population with 41 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 41 tableaux to operate on
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 8 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_59])).
% 0.21/0.39 cnf(i_0_118, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_116, plain, (taughtby(student(michael),student(michael))=taughtby(true,true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_268, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_269, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_270, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_266, plain, (ifeq(taughtby(student(michael),student(michael)),student(michael),student(michael),student(michael))=ifeq(taughtby(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_266, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 7 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_58])).
% 0.21/0.39 cnf(i_0_114, plain, (sK1_course_teaches_Y(student(michael))=sK1_course_teaches_Y(true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_266, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_267, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_268, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_264, plain, (ifeq(sK1_course_teaches_Y(student(michael)),student(michael),student(michael),student(michael))=ifeq(sK1_course_teaches_Y(true),true,true,true)), inference(etableau_closure_rule, [i_0_264, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 7 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_57])).
% 0.21/0.39 cnf(i_0_112, plain, (sK2_course_enrolled_Y(student(michael))=sK2_course_enrolled_Y(true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_264, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_265, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_266, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_262, plain, (ifeq(sK2_course_enrolled_Y(student(michael)),student(michael),student(michael),student(michael))=ifeq(sK2_course_enrolled_Y(true),true,true,true)), inference(etableau_closure_rule, [i_0_262, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 8 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_110, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_109, plain, (teaches(student(michael),student(michael))=teaches(true,true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_261, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_262, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_263, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_259, plain, (ifeq(teaches(student(michael),student(michael)),student(michael),student(michael),student(michael))=ifeq(teaches(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_259, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 8 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_111, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_109, plain, (teaches(student(michael),student(michael))=teaches(true,true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_261, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_262, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_263, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_259, plain, (ifeq(teaches(student(michael),student(michael)),student(michael),student(michael),student(michael))=ifeq(teaches(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_259, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true)).
% 0.21/0.39 cnf(i_0_27, plain, (professor(victor)=true)).
% 0.21/0.39 cnf(i_0_23, plain, (student(sK7_student_type_A)=true)).
% 0.21/0.39 cnf(i_0_24, plain, (professor(sK6_professor_type_A)=true)).
% 0.21/0.39 cnf(i_0_25, plain, (course(sK5_course_type_A)=true)).
% 0.21/0.39 cnf(i_0_28, plain, (course(csc410)=true)).
% 0.21/0.39 cnf(i_0_41, plain, (coordinatorof(csc410)=victor)).
% 0.21/0.39 cnf(i_0_40, plain, (enrolled(michael,csc410)=true)).
% 0.21/0.39 cnf(i_0_22, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.21/0.39 cnf(i_0_31, plain, (ifeq(student(X1),true,course(sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_33, plain, (ifeq(professor(X1),true,course(sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_35, plain, (ifeq(course(X1),true,student(sK2_course_enrolled_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_29, plain, (ifeq(course(X1),true,professor(coordinatorof(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_37, plain, (ifeq(course(X1),true,professor(sK1_course_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_30, plain, (ifeq(student(X1),true,enrolled(X1,sK4_student_enrolled_axiom_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_32, plain, (ifeq(professor(X1),true,teaches(X1,sK3_professor_teaches_Y(X1)),true)=true)).
% 0.21/0.39 cnf(i_0_34, plain, (ifeq(course(X1),true,enrolled(sK2_course_enrolled_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_38, plain, (ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_36, plain, (ifeq(course(X1),true,teaches(sK1_course_teaches_Y(X1),X1),true)=true)).
% 0.21/0.39 cnf(i_0_39, plain, (ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true)=true)).
% 0.21/0.39 cnf(i_0_42, negated_conjecture, (taughtby(michael,victor)!=true)).
% 0.21/0.39 cnf(i_0_44, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 7 steps
% 0.21/0.39 cnf(i_0_26, plain, (student(michael)=true), inference(start_rule)).
% 0.21/0.39 cnf(i_0_60, plain, (student(michael)=true), inference(extension_rule, [i_0_55])).
% 0.21/0.39 cnf(i_0_107, plain, (sK3_professor_teaches_Y(student(michael))=sK3_professor_teaches_Y(true)), inference(extension_rule, [i_0_48])).
% 0.21/0.39 cnf(i_0_259, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_260, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_261, plain, (student(michael)!=true), inference(closure_rule, [i_0_26])).
% 0.21/0.39 cnf(i_0_257, plain, (ifeq(sK3_professor_teaches_Y(student(michael)),student(michael),student(michael),student(michael))=ifeq(sK3_professor_teaches_Y(true),true,true,true)), inference(etableau_closure_rule, [i_0_257, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Child (4761) has found a proof.
% 0.21/0.39
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------