TSTP Solution File: SWW951+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.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 : Thu Jul 21 00:13:55 EDT 2022
% Result : Theorem 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 600
% 0.15/0.34 % DateTime : Sun Jun 5 16:24:08 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 66 Number of unprocessed: 66
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 66 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 1 conjectures.
% 0.21/0.38 # There are 1 start rule candidates:
% 0.21/0.38 # Found 52 unit axioms.
% 0.21/0.38 # 1 start rule tableaux created.
% 0.21/0.38 # 14 extension rule candidate clauses
% 0.21/0.38 # 52 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_58, plain, (pred_attacker(constr_CONST_0x30))).
% 0.21/0.38 cnf(i_0_57, plain, (pred_attacker(constr_CONST_1))).
% 0.21/0.38 cnf(i_0_56, plain, (pred_attacker(constr_CONST_2))).
% 0.21/0.38 cnf(i_0_55, plain, (pred_attacker(constr_CONST_3))).
% 0.21/0.38 cnf(i_0_54, plain, (pred_attacker(constr_CONST_4))).
% 0.21/0.38 cnf(i_0_45, plain, (pred_attacker(constr_ZERO))).
% 0.21/0.38 cnf(i_0_61, plain, (pred_attacker(name_c))).
% 0.21/0.38 cnf(i_0_42, plain, (pred_attacker(tuple_true))).
% 0.21/0.38 cnf(i_0_44, plain, (pred_attacker(tuple_false))).
% 0.21/0.38 cnf(i_0_63, plain, (pred_attacker(name_new0x2Dname(X1)))).
% 0.21/0.38 cnf(i_0_38, plain, (constr_xor(X1,constr_ZERO)=X1)).
% 0.21/0.38 cnf(i_0_62, plain, (pred_equal(X1,X1))).
% 0.21/0.38 cnf(i_0_37, plain, (constr_xor(X1,X1)=constr_ZERO)).
% 0.21/0.38 cnf(i_0_40, plain, (constr_xor(constr_xor(X1,X2),X3)=constr_xor(X1,constr_xor(X2,X3)))).
% 0.21/0.38 cnf(i_0_39, plain, (constr_xor(X1,X2)=constr_xor(X2,X1))).
% 0.21/0.38 cnf(i_0_33, plain, (name_objective!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_66, negated_conjecture, (~pred_attacker(name_objective))).
% 0.21/0.38 cnf(i_0_8, plain, (constr_CONST_0x30!=name_objective)).
% 0.21/0.38 cnf(i_0_15, plain, (constr_CONST_1!=name_objective)).
% 0.21/0.38 cnf(i_0_21, plain, (constr_CONST_2!=name_objective)).
% 0.21/0.38 cnf(i_0_1, plain, (constr_CONST_1!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_2, plain, (constr_CONST_2!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_9, plain, (constr_CONST_2!=constr_CONST_1)).
% 0.21/0.38 cnf(i_0_3, plain, (constr_CONST_3!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_10, plain, (constr_CONST_3!=constr_CONST_1)).
% 0.21/0.38 cnf(i_0_26, plain, (constr_CONST_3!=name_objective)).
% 0.21/0.38 cnf(i_0_30, plain, (constr_CONST_4!=name_objective)).
% 0.21/0.38 cnf(i_0_35, plain, (name_c!=name_objective)).
% 0.21/0.38 cnf(i_0_36, plain, (name_k!=name_objective)).
% 0.21/0.38 cnf(i_0_16, plain, (constr_CONST_3!=constr_CONST_2)).
% 0.21/0.38 cnf(i_0_4, plain, (constr_CONST_4!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_11, plain, (constr_CONST_4!=constr_CONST_1)).
% 0.21/0.38 cnf(i_0_17, plain, (constr_CONST_4!=constr_CONST_2)).
% 0.21/0.38 cnf(i_0_22, plain, (constr_CONST_4!=constr_CONST_3)).
% 0.21/0.38 cnf(i_0_5, plain, (constr_CONST_0x30!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_12, plain, (constr_CONST_1!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_18, plain, (constr_CONST_2!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_23, plain, (constr_CONST_3!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_27, plain, (constr_CONST_4!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_6, plain, (name_c!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_13, plain, (name_c!=constr_CONST_1)).
% 0.21/0.38 cnf(i_0_19, plain, (name_c!=constr_CONST_2)).
% 0.21/0.38 cnf(i_0_24, plain, (name_c!=constr_CONST_3)).
% 0.21/0.38 cnf(i_0_28, plain, (name_c!=constr_CONST_4)).
% 0.21/0.38 cnf(i_0_31, plain, (name_c!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_7, plain, (name_k!=constr_CONST_0x30)).
% 0.21/0.38 cnf(i_0_14, plain, (name_k!=constr_CONST_1)).
% 0.21/0.38 cnf(i_0_20, plain, (name_k!=constr_CONST_2)).
% 0.21/0.38 cnf(i_0_25, plain, (name_k!=constr_CONST_3)).
% 0.21/0.38 cnf(i_0_29, plain, (name_k!=constr_CONST_4)).
% 0.21/0.38 cnf(i_0_32, plain, (name_k!=constr_ZERO)).
% 0.21/0.38 cnf(i_0_34, plain, (name_k!=name_c)).
% 0.21/0.38 cnf(i_0_47, plain, (pred_attacker(X1)|~pred_attacker(tuple_T_out_4(X1)))).
% 0.21/0.38 cnf(i_0_49, plain, (pred_attacker(X1)|~pred_attacker(tuple_T_out_2(X1)))).
% 0.21/0.38 cnf(i_0_51, plain, (pred_attacker(X1)|~pred_attacker(tuple_T_in_3(X1)))).
% 0.21/0.38 cnf(i_0_53, plain, (pred_attacker(X1)|~pred_attacker(tuple_T_in_1(X1)))).
% 0.21/0.38 cnf(i_0_59, plain, (pred_attacker(X1)|~pred_mess(X2,X1)|~pred_attacker(X2))).
% 0.21/0.38 cnf(i_0_43, plain, (pred_attacker(constr_h(X1))|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_46, plain, (pred_attacker(tuple_T_out_4(X1))|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_48, plain, (pred_attacker(tuple_T_out_2(X1))|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_50, plain, (pred_attacker(tuple_T_in_3(X1))|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_52, plain, (pred_attacker(tuple_T_in_1(X1))|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_60, plain, (pred_mess(X1,X2)|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_41, plain, (pred_attacker(constr_xor(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.21/0.38 cnf(i_0_65, plain, (pred_attacker(tuple_T_out_4(name_objective))|~pred_attacker(tuple_T_in_3(X1))|~pred_attacker(tuple_T_in_1(X2)))).
% 0.21/0.38 cnf(i_0_64, plain, (pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,X1))))|~pred_attacker(tuple_T_in_1(X1)))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 4 steps
% 0.21/0.38 cnf(i_0_66, negated_conjecture, (~pred_attacker(name_objective)), inference(start_rule)).
% 0.21/0.38 cnf(i_0_67, plain, (~pred_attacker(name_objective)), inference(extension_rule, [i_0_53])).
% 0.21/0.38 cnf(i_0_75, plain, (~pred_attacker(tuple_T_in_1(name_objective))), inference(extension_rule, [i_0_47])).
% 0.21/0.38 cnf(i_0_133, plain, (~pred_attacker(tuple_T_out_4(tuple_T_in_1(name_objective)))), inference(etableau_closure_rule, [i_0_133, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 4 tableaux to operate on
% 0.21/0.38 # Found closed tableau during pool population.
% 0.21/0.38 # Proof search is over...
% 0.21/0.38 # Freeing feature tree
%------------------------------------------------------------------------------