TSTP Solution File: HAL003+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.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 : n027.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 : Sat Jul 16 12:45:13 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.0.
% 0.04/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 : n027.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.35 % DateTime : Tue Jun 7 21:36:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 59 Number of unprocessed: 58
% 0.20/0.38 # Tableaux proof search.
% 0.20/0.38 # APR header successfully linked.
% 0.20/0.38 # Hello from C++
% 0.20/0.39 # The folding up rule is enabled...
% 0.20/0.39 # Local unification is enabled...
% 0.20/0.39 # Any saturation attempts will use folding labels...
% 0.20/0.39 # 58 beginning clauses after preprocessing and clausification
% 0.20/0.39 # Creating start rules for all 1 conjectures.
% 0.20/0.39 # There are 1 start rule candidates:
% 0.20/0.39 # Found 18 unit axioms.
% 0.20/0.39 # 1 start rule tableaux created.
% 0.20/0.39 # 40 extension rule candidate clauses
% 0.20/0.39 # 18 unit axiom clauses
% 0.20/0.39
% 0.20/0.39 # Requested 8, 32 cores available to the main process.
% 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_37, plain, (surjection(beta))).
% 0.20/0.39 cnf(i_0_38, plain, (surjection(delta))).
% 0.20/0.39 cnf(i_0_43, hypothesis, (surjection(f))).
% 0.20/0.39 cnf(i_0_44, hypothesis, (surjection(h))).
% 0.20/0.39 cnf(i_0_35, plain, (injection(alpha))).
% 0.20/0.39 cnf(i_0_36, plain, (injection(gamma))).
% 0.20/0.39 cnf(i_0_39, plain, (exact(alpha,beta))).
% 0.20/0.39 cnf(i_0_40, plain, (exact(gammma,delta))).
% 0.20/0.39 cnf(i_0_28, plain, (morphism(alpha,a,b))).
% 0.20/0.39 cnf(i_0_29, plain, (morphism(beta,b,c))).
% 0.20/0.39 cnf(i_0_33, plain, (morphism(g,b,e))).
% 0.20/0.39 cnf(i_0_30, plain, (morphism(gamma,d,e))).
% 0.20/0.39 cnf(i_0_31, plain, (morphism(delta,e,r))).
% 0.20/0.39 cnf(i_0_32, plain, (morphism(f,a,d))).
% 0.20/0.39 cnf(i_0_34, plain, (morphism(h,c,r))).
% 0.20/0.39 cnf(i_0_41, plain, (commute(alpha,g,f,gamma))).
% 0.20/0.39 cnf(i_0_42, plain, (commute(beta,h,g,delta))).
% 0.20/0.39 cnf(i_0_59, negated_conjecture, (~surjection(g))).
% 0.20/0.39 cnf(i_0_48, plain, (esk9_1(X1)=apply(delta,X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_49, plain, (element(esk9_1(X1),r)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_47, plain, (element(esk10_1(X1),b)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_55, plain, (element(esk11_1(X1),b)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_54, plain, (element(esk12_1(X1),e)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_52, plain, (element(esk13_1(X1),a)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_58, plain, (element(esk14_1(X1),b)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_57, plain, (element(esk15_1(X1),b)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_25, plain, (subtract(X1,X2,X2)=zero(X1)|~element(X2,X1))).
% 0.20/0.39 cnf(i_0_51, plain, (apply(gamma,apply(f,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_45, plain, (apply(delta,apply(g,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_4, plain, (injection(X1)|esk2_2(X1,X2)!=esk1_2(X1,X2)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_10, plain, (surjection(X1)|apply(X1,X2)!=esk4_3(X1,X3,X4)|~element(X2,X3)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_24, plain, (element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1))).
% 0.20/0.39 cnf(i_0_7, plain, (injection(X1)|element(esk1_2(X1,X2),X2)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_50, plain, (apply(g,apply(alpha,esk13_1(X1)))=esk12_1(X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_11, plain, (surjection(X1)|element(esk4_3(X1,X2,X3),X3)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_46, plain, (apply(h,apply(beta,esk10_1(X1)))=esk9_1(X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_1, plain, (apply(X1,zero(X2))=zero(X3)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_53, plain, (subtract(e,apply(g,esk11_1(X1)),X1)=esk12_1(X1)|~element(X1,e))).
% 0.20/0.39 cnf(i_0_6, plain, (injection(X1)|element(esk2_2(X1,X2),X2)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_56, plain, (apply(g,subtract(b,esk14_1(X1),esk15_1(X1)))=X1|~element(X1,e))).
% 0.20/0.39 cnf(i_0_2, plain, (element(apply(X1,X2),X3)|~element(X2,X4)|~morphism(X1,X4,X3))).
% 0.20/0.39 cnf(i_0_9, plain, (element(esk3_4(X1,X2,X3,X4),X2)|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_26, plain, (subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1))).
% 0.20/0.39 cnf(i_0_3, plain, (X1=X2|apply(X3,X1)!=apply(X3,X2)|~injection(X3)|~element(X2,X4)|~element(X1,X4)|~morphism(X3,X4,X5))).
% 0.20/0.39 cnf(i_0_8, plain, (apply(X1,esk3_4(X1,X2,X3,X4))=X4|~surjection(X1)|~element(X4,X3)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_5, plain, (apply(X1,esk2_2(X1,X2))=apply(X1,esk1_2(X1,X2))|injection(X1)|~morphism(X1,X2,X3))).
% 0.20/0.39 cnf(i_0_12, plain, (apply(X1,apply(X2,X3))=zero(X4)|~exact(X2,X1)|~element(X3,X5)|~morphism(X2,X5,X6)|~morphism(X1,X6,X4))).
% 0.20/0.39 cnf(i_0_27, plain, (apply(X1,subtract(X2,X3,X4))=subtract(X5,apply(X1,X3),apply(X1,X4))|~element(X4,X2)|~element(X3,X2)|~morphism(X1,X2,X5))).
% 0.20/0.39 cnf(i_0_15, plain, (element(esk5_6(X1,X2,X3,X4,X5,X6),X3)|apply(X2,X6)!=zero(X5)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_14, plain, (apply(X1,esk5_6(X1,X2,X3,X4,X5,X6))=X6|apply(X2,X6)!=zero(X5)|~exact(X1,X2)|~element(X6,X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_23, plain, (commute(X1,X2,X3,X4)|element(esk8_5(X1,X2,X3,X4,X5),X5)|~morphism(X4,X6,X7)|~morphism(X3,X5,X6)|~morphism(X2,X8,X7)|~morphism(X1,X5,X8))).
% 0.20/0.39 cnf(i_0_20, plain, (exact(X1,X2)|apply(X2,esk6_5(X1,X2,X3,X4,X5))!=zero(X5)|apply(X1,X6)!=esk6_5(X1,X2,X3,X4,X5)|~element(esk6_5(X1,X2,X3,X4,X5),X4)|~element(X6,X3)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_19, plain, (exact(X1,X2)|element(esk7_5(X1,X2,X3,X4,X5),X3)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_17, plain, (apply(X1,esk6_5(X2,X1,X3,X4,X5))=zero(X5)|exact(X2,X1)|element(esk7_5(X2,X1,X3,X4,X5),X3)|~morphism(X1,X4,X5)|~morphism(X2,X3,X4))).
% 0.20/0.39 cnf(i_0_18, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|exact(X1,X2)|element(esk6_5(X1,X2,X3,X4,X5),X4)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_21, plain, (apply(X1,apply(X2,X3))=apply(X4,apply(X5,X3))|~commute(X2,X1,X5,X4)|~element(X3,X6)|~morphism(X4,X7,X8)|~morphism(X5,X6,X7)|~morphism(X1,X9,X8)|~morphism(X2,X6,X9))).
% 0.20/0.39 cnf(i_0_16, plain, (apply(X1,esk7_5(X1,X2,X3,X4,X5))=esk6_5(X1,X2,X3,X4,X5)|apply(X2,esk6_5(X1,X2,X3,X4,X5))=zero(X5)|exact(X1,X2)|~morphism(X2,X4,X5)|~morphism(X1,X3,X4))).
% 0.20/0.39 cnf(i_0_22, plain, (commute(X1,X2,X3,X4)|apply(X2,apply(X1,esk8_5(X1,X2,X3,X4,X5)))!=apply(X4,apply(X3,esk8_5(X1,X2,X3,X4,X5)))|~morphism(X4,X6,X7)|~morphism(X3,X5,X6)|~morphism(X1,X5,X8)|~morphism(X2,X8,X7))).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 5 steps
% 0.20/0.39 cnf(i_0_59, negated_conjecture, (~surjection(g)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_62, plain, (~surjection(g)), inference(extension_rule, [i_0_11])).
% 0.20/0.39 cnf(i_0_102, plain, (~morphism(g,b,e)), inference(closure_rule, [i_0_33])).
% 0.20/0.39 cnf(i_0_101, plain, (element(esk4_3(g,b,e),e)), inference(extension_rule, [i_0_48])).
% 0.20/0.39 cnf(i_0_204, plain, (esk9_1(esk4_3(g,b,e))=apply(delta,esk4_3(g,b,e))), inference(etableau_closure_rule, [i_0_204, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.39 # We now have 2 tableaux to operate on
% 0.20/0.39 # Found closed tableau during pool population.
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------