TSTP Solution File: SWW948+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWW948+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 : n018.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.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/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 : n018.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 : Sun Jun 5 12:54:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 108 Number of unprocessed: 108
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 108 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 86 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 22 extension rule candidate clauses
% 0.13/0.38 # 86 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 10 tableaux to operate on
% 0.19/0.40 # There were 1 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 1 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 1 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_96, plain, (pred_attacker(constr_CONST_0x30))).
% 0.19/0.40 cnf(i_0_95, plain, (pred_attacker(constr_CONST_1))).
% 0.19/0.40 cnf(i_0_94, plain, (pred_attacker(constr_CONST_2))).
% 0.19/0.40 cnf(i_0_93, plain, (pred_attacker(constr_CONST_3))).
% 0.19/0.40 cnf(i_0_92, plain, (pred_attacker(constr_CONST_4))).
% 0.19/0.40 cnf(i_0_82, plain, (pred_attacker(constr_ZERO))).
% 0.19/0.40 cnf(i_0_99, plain, (pred_attacker(name_c))).
% 0.19/0.40 cnf(i_0_72, plain, (pred_attacker(tuple_true))).
% 0.19/0.40 cnf(i_0_81, plain, (pred_attacker(tuple_false))).
% 0.19/0.40 cnf(i_0_100, plain, (pred_equal(X1,X1))).
% 0.19/0.40 cnf(i_0_102, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)))).
% 0.19/0.40 cnf(i_0_105, plain, (pred_attacker(tuple_R_out_1(name_r0x30)))).
% 0.19/0.40 cnf(i_0_101, plain, (pred_attacker(name_new0x2Dname(X1)))).
% 0.19/0.40 cnf(i_0_68, plain, (constr_xor(X1,constr_ZERO)=X1)).
% 0.19/0.40 cnf(i_0_67, plain, (constr_xor(X1,X1)=constr_ZERO)).
% 0.19/0.40 cnf(i_0_70, plain, (constr_xor(constr_xor(X1,X2),X3)=constr_xor(X1,constr_xor(X2,X3)))).
% 0.19/0.40 cnf(i_0_103, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st))))))).
% 0.19/0.40 cnf(i_0_104, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_3(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st)))))))))).
% 0.19/0.40 cnf(i_0_69, plain, (constr_xor(X1,X2)=constr_xor(X2,X1))).
% 0.19/0.40 cnf(i_0_48, plain, (name_objective_R!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_108, negated_conjecture, (~pred_attacker(name_objective_R))).
% 0.19/0.40 cnf(i_0_57, plain, (name_objective_R!=name_k)).
% 0.19/0.40 cnf(i_0_61, plain, (name_objective_R!=name_r0x30)).
% 0.19/0.40 cnf(i_0_62, plain, (name_objective_R!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_1, plain, (constr_CONST_1!=constr_CONST_0x30)).
% 0.19/0.40 cnf(i_0_2, plain, (constr_CONST_2!=constr_CONST_0x30)).
% 0.19/0.40 cnf(i_0_12, plain, (constr_CONST_2!=constr_CONST_1)).
% 0.19/0.40 cnf(i_0_3, plain, (constr_CONST_3!=constr_CONST_0x30)).
% 0.19/0.40 cnf(i_0_13, plain, (constr_CONST_3!=constr_CONST_1)).
% 0.19/0.40 cnf(i_0_63, plain, (name_objective_R!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_8, plain, (constr_CONST_0x30!=name_objective_R)).
% 0.19/0.40 cnf(i_0_18, plain, (constr_CONST_1!=name_objective_R)).
% 0.19/0.40 cnf(i_0_27, plain, (constr_CONST_2!=name_objective_R)).
% 0.19/0.40 cnf(i_0_35, plain, (constr_CONST_3!=name_objective_R)).
% 0.19/0.40 cnf(i_0_22, plain, (constr_CONST_3!=constr_CONST_2)).
% 0.19/0.40 cnf(i_0_4, plain, (constr_CONST_4!=constr_CONST_0x30)).
% 0.19/0.40 cnf(i_0_14, plain, (constr_CONST_4!=constr_CONST_1)).
% 0.19/0.40 cnf(i_0_23, plain, (constr_CONST_4!=constr_CONST_2)).
% 0.19/0.40 cnf(i_0_31, plain, (constr_CONST_4!=constr_CONST_3)).
% 0.19/0.40 cnf(i_0_42, plain, (constr_CONST_4!=name_objective_R)).
% 0.19/0.40 cnf(i_0_53, plain, (name_c!=name_objective_R)).
% 0.19/0.40 cnf(i_0_5, plain, (constr_CONST_0x30!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_15, plain, (constr_CONST_1!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_24, plain, (constr_CONST_2!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_32, plain, (constr_CONST_3!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_39, plain, (constr_CONST_4!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_6, plain, (name_c!=constr_CONST_0x30)).
% 0.19/0.40 cnf(i_0_16, plain, (name_c!=constr_CONST_1)).
% 0.19/0.40 cnf(i_0_25, plain, (name_c!=constr_CONST_2)).
% 0.19/0.40 cnf(i_0_33, plain, (name_c!=constr_CONST_3)).
% 0.19/0.40 cnf(i_0_40, plain, (name_c!=constr_CONST_4)).
% 0.19/0.40 cnf(i_0_46, plain, (name_c!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_7, plain, (constr_CONST_0x30!=name_k)).
% 0.19/0.40 cnf(i_0_17, plain, (constr_CONST_1!=name_k)).
% 0.19/0.40 cnf(i_0_26, plain, (constr_CONST_2!=name_k)).
% 0.19/0.40 cnf(i_0_34, plain, (constr_CONST_3!=name_k)).
% 0.19/0.40 cnf(i_0_41, plain, (constr_CONST_4!=name_k)).
% 0.19/0.40 cnf(i_0_47, plain, (constr_ZERO!=name_k)).
% 0.19/0.40 cnf(i_0_52, plain, (name_c!=name_k)).
% 0.19/0.40 cnf(i_0_9, plain, (constr_CONST_0x30!=name_r0x30)).
% 0.19/0.40 cnf(i_0_19, plain, (constr_CONST_1!=name_r0x30)).
% 0.19/0.40 cnf(i_0_28, plain, (constr_CONST_2!=name_r0x30)).
% 0.19/0.40 cnf(i_0_36, plain, (constr_CONST_3!=name_r0x30)).
% 0.19/0.40 cnf(i_0_43, plain, (constr_CONST_4!=name_r0x30)).
% 0.19/0.40 cnf(i_0_49, plain, (constr_ZERO!=name_r0x30)).
% 0.19/0.40 cnf(i_0_54, plain, (name_c!=name_r0x30)).
% 0.19/0.40 cnf(i_0_58, plain, (name_r0x30!=name_k)).
% 0.19/0.40 cnf(i_0_10, plain, (constr_CONST_0x30!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_20, plain, (constr_CONST_1!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_29, plain, (constr_CONST_2!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_37, plain, (constr_CONST_3!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_44, plain, (constr_CONST_4!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_50, plain, (constr_ZERO!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_55, plain, (name_c!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_59, plain, (name_r0x30_from_1st!=name_k)).
% 0.19/0.40 cnf(i_0_64, plain, (name_r0x30_from_1st!=name_r0x30)).
% 0.19/0.40 cnf(i_0_11, plain, (constr_CONST_0x30!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_21, plain, (constr_CONST_1!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_30, plain, (constr_CONST_2!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_38, plain, (constr_CONST_3!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_45, plain, (constr_CONST_4!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_51, plain, (name_r1_from_1st!=constr_ZERO)).
% 0.19/0.40 cnf(i_0_56, plain, (name_c!=name_r1_from_1st)).
% 0.19/0.40 cnf(i_0_60, plain, (name_r1_from_1st!=name_k)).
% 0.19/0.40 cnf(i_0_65, plain, (name_r1_from_1st!=name_r0x30)).
% 0.19/0.40 cnf(i_0_66, plain, (name_r1_from_1st!=name_r0x30_from_1st)).
% 0.19/0.40 cnf(i_0_74, plain, (pred_attacker(X1)|~pred_attacker(tuple_knowledge_from_1st_round_out_3(X1)))).
% 0.19/0.40 cnf(i_0_79, plain, (pred_attacker(X1)|~pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)))).
% 0.19/0.40 cnf(i_0_84, plain, (pred_attacker(X1)|~pred_attacker(tuple_R_out_4(X1)))).
% 0.19/0.40 cnf(i_0_86, plain, (pred_attacker(X1)|~pred_attacker(tuple_R_out_3(X1)))).
% 0.19/0.40 cnf(i_0_88, plain, (pred_attacker(X1)|~pred_attacker(tuple_R_out_1(X1)))).
% 0.19/0.40 cnf(i_0_77, plain, (pred_attacker(X1)|~pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)))).
% 0.19/0.40 cnf(i_0_73, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_3(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_78, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_1(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_80, plain, (pred_attacker(constr_h(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_83, plain, (pred_attacker(tuple_R_out_4(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_85, plain, (pred_attacker(tuple_R_out_3(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_87, plain, (pred_attacker(tuple_R_out_1(X1))|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_91, plain, (pred_attacker(X1)|~pred_attacker(tuple_R_in_2(X2,X1)))).
% 0.19/0.40 cnf(i_0_76, plain, (pred_attacker(X1)|~pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)))).
% 0.19/0.40 cnf(i_0_90, plain, (pred_attacker(X1)|~pred_attacker(tuple_R_in_2(X1,X2)))).
% 0.19/0.40 cnf(i_0_97, plain, (pred_attacker(X1)|~pred_mess(X2,X1)|~pred_attacker(X2))).
% 0.19/0.40 cnf(i_0_98, plain, (pred_mess(X1,X2)|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_71, plain, (pred_attacker(constr_xor(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_75, plain, (pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_89, plain, (pred_attacker(tuple_R_in_2(X1,X2))|~pred_attacker(X2)|~pred_attacker(X1))).
% 0.19/0.40 cnf(i_0_107, plain, (pred_attacker(tuple_R_out_4(name_objective_R))|~pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))))).
% 0.19/0.40 cnf(i_0_106, plain, (pred_attacker(tuple_R_out_3(constr_h(constr_xor(name_k,constr_xor(name_r0x30,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))))))|~pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))))).
% 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 4 steps
% 0.19/0.40 cnf(i_0_108, negated_conjecture, (~pred_attacker(name_objective_R)), inference(start_rule)).
% 0.19/0.40 cnf(i_0_109, plain, (~pred_attacker(name_objective_R)), inference(extension_rule, [i_0_84])).
% 0.19/0.40 cnf(i_0_115, plain, (~pred_attacker(tuple_R_out_4(name_objective_R))), inference(extension_rule, [i_0_74])).
% 0.19/0.40 cnf(i_0_160, plain, (~pred_attacker(tuple_knowledge_from_1st_round_out_3(tuple_R_out_4(name_objective_R)))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # Child (9031) has found a proof.
% 0.19/0.40
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------