TSTP Solution File: PUZ131+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.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 : n028.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   : Theorem 0.18s 0.36s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun May 29 01:54:33 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.18/0.36  # No SInE strategy applied
% 0.18/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36  #
% 0.18/0.36  # Presaturation interreduction done
% 0.18/0.36  # Number of axioms: 20 Number of unprocessed: 20
% 0.18/0.36  # Tableaux proof search.
% 0.18/0.36  # APR header successfully linked.
% 0.18/0.36  # Hello from C++
% 0.18/0.36  # The folding up rule is enabled...
% 0.18/0.36  # Local unification is enabled...
% 0.18/0.36  # Any saturation attempts will use folding labels...
% 0.18/0.36  # 20 beginning clauses after preprocessing and clausification
% 0.18/0.36  # Creating start rules for all 1 conjectures.
% 0.18/0.36  # There are 1 start rule candidates:
% 0.18/0.36  # Found 9 unit axioms.
% 0.18/0.36  # 1 start rule tableaux created.
% 0.18/0.36  # 11 extension rule candidate clauses
% 0.18/0.36  # 9 unit axiom clauses
% 0.18/0.36  
% 0.18/0.36  # Requested 8, 32 cores available to the main process.
% 0.18/0.36  # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36  # Creating equality axioms
% 0.18/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36  # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36  # We now have 24 tableaux to operate on
% 0.18/0.36  # There were 1 total branch saturation attempts.
% 0.18/0.36  # There were 0 of these attempts blocked.
% 0.18/0.36  # There were 0 deferred branch saturation attempts.
% 0.18/0.36  # There were 0 free duplicated saturations.
% 0.18/0.36  # There were 1 total successful branch saturations.
% 0.18/0.36  # There were 0 successful branch saturations in interreduction.
% 0.18/0.36  # There were 0 successful branch saturations on the branch.
% 0.18/0.36  # There were 1 successful branch saturations after the branch.
% 0.18/0.36  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # Begin clausification derivation
% 0.18/0.36  
% 0.18/0.36  # End clausification derivation
% 0.18/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36  cnf(i_0_4, plain, (student(michael))).
% 0.18/0.36  cnf(i_0_5, plain, (professor(victor))).
% 0.18/0.36  cnf(i_0_19, plain, (coordinatorof(csc410)=victor)).
% 0.18/0.36  cnf(i_0_1, plain, (student(esk1_0))).
% 0.18/0.36  cnf(i_0_2, plain, (professor(esk2_0))).
% 0.18/0.36  cnf(i_0_6, plain, (course(csc410))).
% 0.18/0.36  cnf(i_0_3, plain, (course(esk3_0))).
% 0.18/0.36  cnf(i_0_18, plain, (enrolled(michael,csc410))).
% 0.18/0.36  cnf(i_0_20, negated_conjecture, (~taughtby(michael,victor))).
% 0.18/0.36  cnf(i_0_13, plain, (student(esk6_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_7, plain, (professor(coordinatorof(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_15, plain, (professor(esk7_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_9, plain, (course(esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_11, plain, (course(esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_8, plain, (enrolled(X1,esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_10, plain, (teaches(X1,esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_12, plain, (enrolled(esk6_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_16, plain, (teaches(coordinatorof(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_14, plain, (teaches(esk7_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_17, plain, (taughtby(X1,X2)|~teaches(X2,X3)|~enrolled(X1,X3)|~course(X3)|~professor(X2)|~student(X1))).
% 0.18/0.36  cnf(i_0_74, plain, (X21=X21)).
% 0.18/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.36  # Begin printing tableau
% 0.18/0.36  # Found 4 steps
% 0.18/0.36  cnf(i_0_5, plain, (professor(victor)), inference(start_rule)).
% 0.18/0.36  cnf(i_0_86, plain, (professor(victor)), inference(extension_rule, [i_0_11])).
% 0.18/0.36  cnf(i_0_185, plain, (course(esk5_1(victor))), inference(extension_rule, [i_0_13])).
% 0.18/0.36  cnf(i_0_187, plain, (student(esk6_1(esk5_1(victor)))), inference(etableau_closure_rule, [i_0_187, ...])).
% 0.18/0.36  # End printing tableau
% 0.18/0.36  # SZS output end
% 0.18/0.36  # Branches closed with saturation will be marked with an "s"
% 0.18/0.36  # There were 1 total branch saturation attempts.
% 0.18/0.36  # There were 0 of these attempts blocked.
% 0.18/0.36  # There were 0 deferred branch saturation attempts.
% 0.18/0.36  # There were 0 free duplicated saturations.
% 0.18/0.36  # There were 1 total successful branch saturations.
% 0.18/0.36  # There were 0 successful branch saturations in interreduction.
% 0.18/0.36  # There were 0 successful branch saturations on the branch.
% 0.18/0.36  # There were 1 successful branch saturations after the branch.
% 0.18/0.36  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # Begin clausification derivation
% 0.18/0.36  
% 0.18/0.36  # End clausification derivation
% 0.18/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36  cnf(i_0_4, plain, (student(michael))).
% 0.18/0.36  cnf(i_0_5, plain, (professor(victor))).
% 0.18/0.36  cnf(i_0_19, plain, (coordinatorof(csc410)=victor)).
% 0.18/0.36  cnf(i_0_1, plain, (student(esk1_0))).
% 0.18/0.36  cnf(i_0_2, plain, (professor(esk2_0))).
% 0.18/0.36  cnf(i_0_6, plain, (course(csc410))).
% 0.18/0.36  cnf(i_0_3, plain, (course(esk3_0))).
% 0.18/0.36  cnf(i_0_18, plain, (enrolled(michael,csc410))).
% 0.18/0.36  cnf(i_0_20, negated_conjecture, (~taughtby(michael,victor))).
% 0.18/0.36  cnf(i_0_13, plain, (student(esk6_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_7, plain, (professor(coordinatorof(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_15, plain, (professor(esk7_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_9, plain, (course(esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_11, plain, (course(esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_8, plain, (enrolled(X1,esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_10, plain, (teaches(X1,esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_12, plain, (enrolled(esk6_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_16, plain, (teaches(coordinatorof(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_14, plain, (teaches(esk7_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_17, plain, (taughtby(X1,X2)|~teaches(X2,X3)|~enrolled(X1,X3)|~course(X3)|~professor(X2)|~student(X1))).
% 0.18/0.36  cnf(i_0_74, plain, (X21=X21)).
% 0.18/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.36  # Begin printing tableau
% 0.18/0.36  # Found 5 steps
% 0.18/0.36  cnf(i_0_4, plain, (student(michael)), inference(start_rule)).
% 0.18/0.36  cnf(i_0_85, plain, (student(michael)), inference(extension_rule, [i_0_78])).
% 0.18/0.36  cnf(i_0_154, plain, (student(michael)), inference(extension_rule, [i_0_9])).
% 0.18/0.36  cnf(i_0_155, plain, ($false), inference(closure_rule, [i_0_74])).
% 0.18/0.36  cnf(i_0_183, plain, (course(esk4_1(michael))), inference(etableau_closure_rule, [i_0_183, ...])).
% 0.18/0.36  # End printing tableau
% 0.18/0.36  # SZS output end
% 0.18/0.36  # Branches closed with saturation will be marked with an "s"
% 0.18/0.36  # There were 1 total branch saturation attempts.
% 0.18/0.36  # There were 0 of these attempts blocked.
% 0.18/0.36  # There were 0 deferred branch saturation attempts.
% 0.18/0.36  # There were 0 free duplicated saturations.
% 0.18/0.36  # There were 1 total successful branch saturations.
% 0.18/0.36  # There were 0 successful branch saturations in interreduction.
% 0.18/0.36  # There were 0 successful branch saturations on the branch.
% 0.18/0.36  # There were 1 successful branch saturations after the branch.
% 0.18/0.36  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36  # Begin clausification derivation
% 0.18/0.36  
% 0.18/0.36  # End clausification derivation
% 0.18/0.36  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36  cnf(i_0_4, plain, (student(michael))).
% 0.18/0.36  cnf(i_0_5, plain, (professor(victor))).
% 0.18/0.36  cnf(i_0_19, plain, (coordinatorof(csc410)=victor)).
% 0.18/0.36  cnf(i_0_1, plain, (student(esk1_0))).
% 0.18/0.36  cnf(i_0_2, plain, (professor(esk2_0))).
% 0.18/0.36  cnf(i_0_6, plain, (course(csc410))).
% 0.18/0.36  cnf(i_0_3, plain, (course(esk3_0))).
% 0.18/0.36  cnf(i_0_18, plain, (enrolled(michael,csc410))).
% 0.18/0.36  cnf(i_0_20, negated_conjecture, (~taughtby(michael,victor))).
% 0.18/0.36  cnf(i_0_13, plain, (student(esk6_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_7, plain, (professor(coordinatorof(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_15, plain, (professor(esk7_1(X1))|~course(X1))).
% 0.18/0.36  cnf(i_0_9, plain, (course(esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_11, plain, (course(esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_8, plain, (enrolled(X1,esk4_1(X1))|~student(X1))).
% 0.18/0.36  cnf(i_0_10, plain, (teaches(X1,esk5_1(X1))|~professor(X1))).
% 0.18/0.36  cnf(i_0_12, plain, (enrolled(esk6_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_16, plain, (teaches(coordinatorof(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_14, plain, (teaches(esk7_1(X1),X1)|~course(X1))).
% 0.18/0.36  cnf(i_0_17, plain, (taughtby(X1,X2)|~teaches(X2,X3)|~enrolled(X1,X3)|~course(X3)|~professor(X2)|~student(X1))).
% 0.18/0.36  cnf(i_0_74, plain, (X21=X21)).
% 0.18/0.36  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.36  # Begin printing tableau
% 0.18/0.36  # Found 10 steps
% 0.18/0.36  cnf(i_0_4, plain, (student(michael)), inference(start_rule)).
% 0.18/0.36  cnf(i_0_85, plain, (student(michael)), inference(extension_rule, [i_0_17])).
% 0.18/0.36  cnf(i_0_141, plain, (taughtby(michael,victor)), inference(closure_rule, [i_0_20])).
% 0.18/0.36  cnf(i_0_143, plain, (~enrolled(michael,csc410)), inference(closure_rule, [i_0_18])).
% 0.18/0.36  cnf(i_0_144, plain, (~course(csc410)), inference(closure_rule, [i_0_6])).
% 0.18/0.36  cnf(i_0_145, plain, (~professor(victor)), inference(closure_rule, [i_0_5])).
% 0.18/0.36  cnf(i_0_142, plain, (~teaches(victor,csc410)), inference(extension_rule, [i_0_83])).
% 0.18/0.36  cnf(i_0_226, plain, (coordinatorof(csc410)!=victor), inference(closure_rule, [i_0_19])).
% 0.18/0.36  cnf(i_0_227, plain, ($false), inference(closure_rule, [i_0_74])).
% 0.18/0.36  cnf(i_0_228, plain, (~teaches(coordinatorof(csc410),csc410)), inference(etableau_closure_rule, [i_0_228, ...])).
% 0.18/0.36  # End printing tableau
% 0.18/0.36  # SZS output end
% 0.18/0.36  # Branches closed with saturation will be marked with an "s"
% 0.18/0.36  # Child (12025) has found a proof.
% 0.18/0.36  
% 0.18/0.36  # Proof search is over...
% 0.18/0.36  # Freeing feature tree
%------------------------------------------------------------------------------