TSTP Solution File: HWC003-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWC003-2 : TPTP v8.1.0. Released v1.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 : 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 13:07:04 EDT 2022
% Result : Unsatisfiable 0.18s 0.38s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWC003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:57:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.18/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 23 Number of unprocessed: 23
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 23 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 4 conjectures.
% 0.18/0.37 # There are 4 start rule candidates:
% 0.18/0.37 # Found 17 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 4 start rule tableaux created.
% 0.18/0.37 # 6 extension rule candidate clauses
% 0.18/0.37 # 17 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.18/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 9 tableaux to operate on
% 0.18/0.38 # There were 1 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 1 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 1 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_30, plain, (not(n0)=n1)).
% 0.18/0.38 cnf(i_0_31, plain, (not(n1)=n0)).
% 0.18/0.38 cnf(i_0_47, negated_conjecture, (output(n0,n0,n0,n0,n1,n1,n1,n1,X1))).
% 0.18/0.38 cnf(i_0_48, negated_conjecture, (output(n0,n0,n1,n1,n0,n0,n1,n1,X1))).
% 0.18/0.38 cnf(i_0_49, negated_conjecture, (output(n0,n1,n0,n1,n0,n1,n0,n1,X1))).
% 0.18/0.38 cnf(i_0_26, plain, (and(X1,n0)=n0)).
% 0.18/0.38 cnf(i_0_29, plain, (or(X1,n1)=n1)).
% 0.18/0.38 cnf(i_0_27, plain, (and(X1,n1)=X1)).
% 0.18/0.38 cnf(i_0_28, plain, (or(X1,n0)=X1)).
% 0.18/0.38 cnf(i_0_39, plain, (list_reversion(not_reversion,X1)=X1)).
% 0.18/0.38 cnf(i_0_38, plain, (possible_reversion(X1,X2,X2)=not_reversion)).
% 0.18/0.38 cnf(i_0_37, plain, (possible_reversion(X1,n0,n1)=not_reversion)).
% 0.18/0.38 cnf(i_0_36, plain, (possible_reversion(X1,n1,n0)=X1)).
% 0.18/0.38 cnf(i_0_41, plain, (list_reversion(X1,list_reversion(X1,X2))=list_reversion(X1,X2))).
% 0.18/0.38 cnf(i_0_34, plain, (list_reversion(possible_reversion(r00m,X1,X2),list_reversion(possible_reversion(r01m,X3,X4),list_reversion(possible_reversion(r10m,X5,X6),list_reversion(possible_reversion(r11m,X7,X8),list_reversion(possible_reversion(r0m0,X1,X3),list_reversion(possible_reversion(r0m1,X2,X4),list_reversion(possible_reversion(r1m0,X5,X7),list_reversion(possible_reversion(r1m1,X6,X8),list_reversion(possible_reversion(rm00,X1,X5),list_reversion(possible_reversion(rm01,X2,X6),list_reversion(possible_reversion(rm10,X3,X7),list_reversion(possible_reversion(rm11,X4,X8),end))))))))))))=end)).
% 0.18/0.38 cnf(i_0_32, plain, (list(X1,list(X2,X3))=list(X2,list(X1,X3)))).
% 0.18/0.38 cnf(i_0_40, plain, (list_reversion(X1,list_reversion(X2,X3))=list_reversion(X2,list_reversion(X1,X3)))).
% 0.18/0.38 cnf(i_0_50, negated_conjecture, (~output(n1,n0,n1,n0,n1,n0,n1,n0,X1)|~output(n1,n1,n0,n0,n1,n1,n0,n0,X1)|~output(n1,n1,n1,n1,n0,n0,n0,n0,X1))).
% 0.18/0.38 cnf(i_0_45, plain, (output(X1,X2,X3,X4,X5,X6,X7,X8,X9)|~basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9))).
% 0.18/0.38 cnf(i_0_46, plain, (basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)|~test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10))).
% 0.18/0.38 cnf(i_0_42, plain, (basic_output(and(X1,X2),and(X3,X4),and(X5,X6),and(X7,X8),and(X9,X10),and(X11,X12),and(X13,X14),and(X15,X16),X17)|~basic_output(X2,X4,X6,X8,X10,X12,X14,X16,X17)|~basic_output(X1,X3,X5,X7,X9,X11,X13,X15,X17))).
% 0.18/0.38 cnf(i_0_43, plain, (output(or(X1,X2),or(X3,X4),or(X5,X6),or(X7,X8),or(X9,X10),or(X11,X12),or(X13,X14),or(X15,X16),X17)|~output(X2,X4,X6,X8,X10,X12,X14,X16,X17)|~basic_output(X1,X3,X5,X7,X9,X11,X13,X15,X17))).
% 0.18/0.38 cnf(i_0_44, plain, (test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9),end)|~output(X1,X2,X3,X4,X5,X6,X7,X8,X9))).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 4 steps
% 0.18/0.38 cnf(i_0_47, negated_conjecture, (output(n0,n0,n0,n0,n1,n1,n1,n1,X22)), inference(start_rule)).
% 0.18/0.38 cnf(i_0_56, plain, (output(n0,n0,n0,n0,n1,n1,n1,n1,X22)), inference(extension_rule, [i_0_44])).
% 0.18/0.38 cnf(i_0_142, plain, (test(not(n0),not(n0),not(n0),not(n0),not(n1),not(n1),not(n1),not(n1),list(inverter_table(not(n0),not(n0),not(n0),not(n0),not(n1),not(n1),not(n1),not(n1)),X22),end)), inference(extension_rule, [i_0_46])).
% 0.18/0.38 cnf(i_0_149, plain, (basic_output(not(n0),not(n0),not(n0),not(n0),not(n1),not(n1),not(n1),not(n1),list(inverter_table(not(n0),not(n0),not(n0),not(n0),not(n1),not(n1),not(n1),not(n1)),X22))), inference(etableau_closure_rule, [i_0_149, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # There were 1 total branch saturation attempts.
% 0.18/0.38 # There were 0 of these attempts blocked.
% 0.18/0.38 # There were 0 deferred branch saturation attempts.
% 0.18/0.38 # There were 0 free duplicated saturations.
% 0.18/0.38 # There were 1 total successful branch saturations.
% 0.18/0.38 # There were 0 successful branch saturations in interreduction.
% 0.18/0.38 # There were 0 successful branch saturations on the branch.
% 0.18/0.38 # There were 1 successful branch saturations after the branch.
% 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.38 # Begin clausification derivation
% 0.18/0.38
% 0.18/0.38 # End clausification derivation
% 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.38 cnf(i_0_30, plain, (not(n0)=n1)).
% 0.18/0.38 cnf(i_0_31, plain, (not(n1)=n0)).
% 0.18/0.38 cnf(i_0_47, negated_conjecture, (output(n0,n0,n0,n0,n1,n1,n1,n1,X1))).
% 0.18/0.38 cnf(i_0_48, negated_conjecture, (output(n0,n0,n1,n1,n0,n0,n1,n1,X1))).
% 0.18/0.38 cnf(i_0_49, negated_conjecture, (output(n0,n1,n0,n1,n0,n1,n0,n1,X1))).
% 0.18/0.38 cnf(i_0_26, plain, (and(X1,n0)=n0)).
% 0.18/0.38 cnf(i_0_29, plain, (or(X1,n1)=n1)).
% 0.18/0.38 cnf(i_0_27, plain, (and(X1,n1)=X1)).
% 0.18/0.38 cnf(i_0_28, plain, (or(X1,n0)=X1)).
% 0.18/0.38 cnf(i_0_39, plain, (list_reversion(not_reversion,X1)=X1)).
% 0.18/0.38 cnf(i_0_38, plain, (possible_reversion(X1,X2,X2)=not_reversion)).
% 0.18/0.38 cnf(i_0_37, plain, (possible_reversion(X1,n0,n1)=not_reversion)).
% 0.18/0.38 cnf(i_0_36, plain, (possible_reversion(X1,n1,n0)=X1)).
% 0.18/0.38 cnf(i_0_41, plain, (list_reversion(X1,list_reversion(X1,X2))=list_reversion(X1,X2))).
% 0.18/0.38 cnf(i_0_34, plain, (list_reversion(possible_reversion(r00m,X1,X2),list_reversion(possible_reversion(r01m,X3,X4),list_reversion(possible_reversion(r10m,X5,X6),list_reversion(possible_reversion(r11m,X7,X8),list_reversion(possible_reversion(r0m0,X1,X3),list_reversion(possible_reversion(r0m1,X2,X4),list_reversion(possible_reversion(r1m0,X5,X7),list_reversion(possible_reversion(r1m1,X6,X8),list_reversion(possible_reversion(rm00,X1,X5),list_reversion(possible_reversion(rm01,X2,X6),list_reversion(possible_reversion(rm10,X3,X7),list_reversion(possible_reversion(rm11,X4,X8),end))))))))))))=end)).
% 0.18/0.38 cnf(i_0_32, plain, (list(X1,list(X2,X3))=list(X2,list(X1,X3)))).
% 0.18/0.38 cnf(i_0_40, plain, (list_reversion(X1,list_reversion(X2,X3))=list_reversion(X2,list_reversion(X1,X3)))).
% 0.18/0.38 cnf(i_0_50, negated_conjecture, (~output(n1,n0,n1,n0,n1,n0,n1,n0,X1)|~output(n1,n1,n0,n0,n1,n1,n0,n0,X1)|~output(n1,n1,n1,n1,n0,n0,n0,n0,X1))).
% 0.18/0.38 cnf(i_0_45, plain, (output(X1,X2,X3,X4,X5,X6,X7,X8,X9)|~basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9))).
% 0.18/0.38 cnf(i_0_46, plain, (basic_output(X1,X2,X3,X4,X5,X6,X7,X8,X9)|~test(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10))).
% 0.18/0.38 cnf(i_0_42, plain, (basic_output(and(X1,X2),and(X3,X4),and(X5,X6),and(X7,X8),and(X9,X10),and(X11,X12),and(X13,X14),and(X15,X16),X17)|~basic_output(X2,X4,X6,X8,X10,X12,X14,X16,X17)|~basic_output(X1,X3,X5,X7,X9,X11,X13,X15,X17))).
% 0.18/0.38 cnf(i_0_43, plain, (output(or(X1,X2),or(X3,X4),or(X5,X6),or(X7,X8),or(X9,X10),or(X11,X12),or(X13,X14),or(X15,X16),X17)|~output(X2,X4,X6,X8,X10,X12,X14,X16,X17)|~basic_output(X1,X3,X5,X7,X9,X11,X13,X15,X17))).
% 0.18/0.38 cnf(i_0_44, plain, (test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),X9),end)|~output(X1,X2,X3,X4,X5,X6,X7,X8,X9))).
% 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.38 # Begin printing tableau
% 0.18/0.38 # Found 4 steps
% 0.18/0.38 cnf(i_0_48, negated_conjecture, (output(n0,n0,n1,n1,n0,n0,n1,n1,X22)), inference(start_rule)).
% 0.18/0.38 cnf(i_0_55, plain, (output(n0,n0,n1,n1,n0,n0,n1,n1,X22)), inference(extension_rule, [i_0_44])).
% 0.18/0.38 cnf(i_0_127, plain, (test(not(n0),not(n0),not(n1),not(n1),not(n0),not(n0),not(n1),not(n1),list(inverter_table(not(n0),not(n0),not(n1),not(n1),not(n0),not(n0),not(n1),not(n1)),X22),end)), inference(extension_rule, [i_0_46])).
% 0.18/0.38 cnf(i_0_149, plain, (basic_output(not(n0),not(n0),not(n1),not(n1),not(n0),not(n0),not(n1),not(n1),list(inverter_table(not(n0),not(n0),not(n1),not(n1),not(n0),not(n0),not(n1),not(n1)),X22))), inference(etableau_closure_rule, [i_0_149, ...])).
% 0.18/0.38 # End printing tableau
% 0.18/0.38 # SZS output end
% 0.18/0.38 # Branches closed with saturation will be marked with an "s"
% 0.18/0.38 # Child (30461) has found a proof.
% 0.18/0.38
% 0.18/0.38 # Proof search is over...
% 0.18/0.38 # Freeing feature tree
%------------------------------------------------------------------------------