TSTP Solution File: SWV973-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV973-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 : n012.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 : Wed Jul 20 18:24:07 EDT 2022
% Result : Satisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV973-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/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.34 % Computer : n012.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 : 600
% 0.12/0.34 % DateTime : Thu Jun 16 02:40:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 19 Number of unprocessed: 19
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 19 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 2 conjectures.
% 0.12/0.37 # There are 2 start rule candidates:
% 0.12/0.37 # Found 19 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 2 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 19 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 39 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 39 tableaux to operate on
% 0.12/0.37 # 22746 Satisfiable branch
% 0.12/0.37 # 22747 Satisfiable branch
% 0.12/0.37 # 22748 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # 22749 Satisfiable branch
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_99, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_100, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_101, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_102, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_98, plain, (c_WellTypeRT_OWTrt(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_WellTypeRT_OWTrt(b,b,b,b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_110, plain, (c_WellTypeRT_OWTrt(b,b,b,b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_WellTypeRT_OWTrt(b,b,b,b,b)),X1,c_WellTypeRT_OWTrt(b,b,b,b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # 22750 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_99, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_100, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_101, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_103, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_98, plain, (c_WellTypeRT_OWTrt(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_WellTypeRT_OWTrt(b,b,b,b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_110, plain, (c_WellTypeRT_OWTrt(b,b,b,b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_WellTypeRT_OWTrt(b,b,b,b,b)),X1,c_WellTypeRT_OWTrt(b,b,b,b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # 22751 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # 22752 Satisfiable branch
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_99, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_101, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_102, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_103, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_98, plain, (c_WellTypeRT_OWTrt(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_WellTypeRT_OWTrt(b,b,b,b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_110, plain, (c_WellTypeRT_OWTrt(b,b,b,b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_WellTypeRT_OWTrt(b,b,b,b,b)),X1,c_WellTypeRT_OWTrt(b,b,b,b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_100, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_101, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_102, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_103, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_98, plain, (c_WellTypeRT_OWTrt(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_WellTypeRT_OWTrt(b,b,b,b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_110, plain, (c_WellTypeRT_OWTrt(b,b,b,b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_WellTypeRT_OWTrt(b,b,b,b,b)),X1,c_WellTypeRT_OWTrt(b,b,b,b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 5 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_50])).
% 0.12/0.37 cnf(i_0_96, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_95, plain, (c_Expr_Oexp_OVal(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_Expr_Oexp_OVal(b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.37 cnf(i_0_110, plain, (c_Expr_Oexp_OVal(b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_Expr_Oexp_OVal(b,b)),X1,c_Expr_Oexp_OVal(b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_33, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_31, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_36, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_20, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_34, plain, (ifeq(c_Value_Oval_ONull,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_21, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.37 cnf(i_0_22, plain, (ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_23, plain, (ifeq2(c_Value_Oval_OIntg(X1),c_Value_Oval_OIntg(X2),X1,X2)=X2)).
% 0.12/0.37 cnf(i_0_25, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OAddr(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_35, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_32, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_ONull,a,b)=b)).
% 0.12/0.37 cnf(i_0_29, plain, (ifeq(c_Value_Oval_OUnit,c_Value_Oval_OIntg(X1),a,b)=b)).
% 0.12/0.37 cnf(i_0_28, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_30, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OUnit,a,b)=b)).
% 0.12/0.37 cnf(i_0_27, plain, (ifeq(c_Value_Oval_OAddr(X1),c_Value_Oval_OIntg(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_26, plain, (ifeq(c_Value_Oval_OIntg(X1),c_Value_Oval_OAddr(X2),a,b)=b)).
% 0.12/0.37 cnf(i_0_24, plain, (c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OVal(v_v____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_ONT)=true)).
% 0.12/0.37 cnf(i_0_38, negated_conjecture, (a!=b)).
% 0.12/0.37 cnf(i_0_41, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_37, negated_conjecture, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(start_rule)).
% 0.12/0.37 cnf(i_0_52, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)=b), inference(extension_rule, [i_0_51])).
% 0.12/0.37 cnf(i_0_99, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.38 cnf(i_0_100, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.38 cnf(i_0_102, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.38 cnf(i_0_103, plain, (ifeq(v_v____,c_Value_Oval_ONull,a,b)!=b), inference(closure_rule, [i_0_37])).
% 0.12/0.38 cnf(i_0_98, plain, (c_WellTypeRT_OWTrt(ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b),ifeq(v_v____,c_Value_Oval_ONull,a,b))=c_WellTypeRT_OWTrt(b,b,b,b,b)), inference(extension_rule, [i_0_44])).
% 0.12/0.38 cnf(i_0_110, plain, (c_WellTypeRT_OWTrt(b,b,b,b,b)!=ifeq2(c_Value_Oval_OAddr(X1),c_Value_Oval_OAddr(c_WellTypeRT_OWTrt(b,b,b,b,b)),X1,c_WellTypeRT_OWTrt(b,b,b,b,b))), inference(closure_rule, [i_0_22])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (22746) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------