TSTP Solution File: LAT268-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT268-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 : n008.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 : Sun Jul 17 04:49:54 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT268-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/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 : n008.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 : Wed Jun 29 19:39:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 11 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 3 conjectures.
% 0.13/0.37 # There are 3 start rule candidates:
% 0.13/0.37 # Found 11 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 3 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 11 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 43 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 43 tableaux to operate on
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.37 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.37 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.37 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.37 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.37 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.37 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.37 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.37 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.37 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.37 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.37 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 8 steps
% 0.13/0.37 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.37 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_42])).
% 0.13/0.37 cnf(i_0_101, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_100, plain, (c_Tarski_Odual(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Odual(true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.37 cnf(i_0_296, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_297, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_298, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.37 cnf(i_0_294, plain, (ifeq(c_Tarski_Odual(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Odual(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_294, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.37 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.37 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.37 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.37 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.37 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.37 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.37 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_97, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_98, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_96, plain, (c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Opotype_Oorder(true,true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_292, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_293, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_294, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_290, plain, (ifeq(c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Opotype_Oorder(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_290, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.38 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.38 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.38 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 8 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_42])).
% 0.13/0.38 cnf(i_0_102, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_100, plain, (c_Tarski_Odual(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Odual(true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_296, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_297, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_298, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_294, plain, (ifeq(c_Tarski_Odual(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Odual(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_294, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.38 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.38 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.38 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_98, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_99, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_96, plain, (c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Opotype_Oorder(true,true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_292, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_293, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_294, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_290, plain, (ifeq(c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Opotype_Oorder(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_290, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.38 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.38 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.38 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_40])).
% 0.13/0.38 cnf(i_0_93, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_94, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_92, plain, (c_Tarski_Olub(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Olub(true,true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_288, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_289, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_290, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_286, plain, (ifeq(c_Tarski_Olub(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Olub(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_286, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.38 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.38 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.38 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_41])).
% 0.13/0.38 cnf(i_0_97, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_99, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_96, plain, (c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Opotype_Oorder(true,true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_292, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_293, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_294, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_290, plain, (ifeq(c_Tarski_Opotype_Oorder(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Opotype_Oorder(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_290, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true)).
% 0.13/0.38 cnf(i_0_14, negated_conjecture, (c_lessequals(v_S,v_A,tc_set(t_a))=true)).
% 0.13/0.38 cnf(i_0_17, plain, (c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A)).
% 0.13/0.38 cnf(i_0_24, plain, (c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r)).
% 0.13/0.38 cnf(i_0_20, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_13, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.38 cnf(i_0_23, plain, (c_Tarski_Opotype_Opset(c_Tarski_Odual(X1,X2),X2,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit))).
% 0.13/0.38 cnf(i_0_21, plain, (c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true)).
% 0.13/0.38 cnf(i_0_19, plain, (ifeq(c_in(c_Pair(X1,X2,X3,X3),c_Tarski_Opotype_Oorder(c_Tarski_Odual(X4,X3),X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true,c_in(c_Pair(X2,X1,X3,X3),c_Tarski_Opotype_Oorder(X4,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true)=true)).
% 0.13/0.38 cnf(i_0_18, plain, (ifeq(c_lessequals(X1,c_Tarski_Opotype_Opset(X2,X3,tc_Product__Type_Ounit),tc_set(X3)),true,ifeq(c_in(X2,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X2,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X3,tc_Product__Type_Ounit)),true,ifeq(c_in(X4,X1,X3),true,c_in(c_Pair(X4,c_Tarski_Olub(X1,X2,X3),X3,X3),c_Tarski_Opotype_Oorder(X2,X3,tc_Product__Type_Ounit),tc_prod(X3,X3)),true),true),true),true)=true)).
% 0.13/0.38 cnf(i_0_16, negated_conjecture, (c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true)).
% 0.13/0.38 cnf(i_0_28, plain, (X5=X5)).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 9 steps
% 0.13/0.38 cnf(i_0_15, negated_conjecture, (c_in(v_x,v_S,t_a)=true), inference(start_rule)).
% 0.13/0.38 cnf(i_0_43, plain, (c_in(v_x,v_S,t_a)=true), inference(extension_rule, [i_0_40])).
% 0.13/0.38 cnf(i_0_93, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_95, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_92, plain, (c_Tarski_Olub(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=c_Tarski_Olub(true,true,true)), inference(extension_rule, [i_0_32])).
% 0.13/0.38 cnf(i_0_288, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_289, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_290, plain, (c_in(v_x,v_S,t_a)!=true), inference(closure_rule, [i_0_15])).
% 0.13/0.38 cnf(i_0_286, plain, (ifeq(c_Tarski_Olub(c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a),c_in(v_x,v_S,t_a))=ifeq(c_Tarski_Olub(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_286, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Child (3926) has found a proof.
% 0.13/0.38
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------