TSTP Solution File: SWV276-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV276-2 : TPTP v8.1.0. Released v3.2.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 : n020.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:20:03 EDT 2022
% Result : Unsatisfiable 0.18s 0.35s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV276-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/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.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Thu Jun 16 01:12:34 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.34 # No SInE strategy applied
% 0.18/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.34 #
% 0.18/0.34 # Presaturation interreduction done
% 0.18/0.34 # Number of axioms: 19 Number of unprocessed: 19
% 0.18/0.34 # Tableaux proof search.
% 0.18/0.34 # APR header successfully linked.
% 0.18/0.34 # Hello from C++
% 0.18/0.34 # The folding up rule is enabled...
% 0.18/0.34 # Local unification is enabled...
% 0.18/0.34 # Any saturation attempts will use folding labels...
% 0.18/0.34 # 19 beginning clauses after preprocessing and clausification
% 0.18/0.34 # Creating start rules for all 4 conjectures.
% 0.18/0.34 # There are 4 start rule candidates:
% 0.18/0.34 # Found 10 unit axioms.
% 0.18/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.34 # 4 start rule tableaux created.
% 0.18/0.34 # 9 extension rule candidate clauses
% 0.18/0.34 # 10 unit axiom clauses
% 0.18/0.34
% 0.18/0.34 # Requested 8, 32 cores available to the main process.
% 0.18/0.34 # There are not enough tableaux to fork, creating more from the initial 4
% 0.18/0.34 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.34 # We now have 11 tableaux to operate on
% 0.18/0.35 # There were 1 total branch saturation attempts.
% 0.18/0.35 # There were 0 of these attempts blocked.
% 0.18/0.35 # There were 0 deferred branch saturation attempts.
% 0.18/0.35 # There were 0 free duplicated saturations.
% 0.18/0.35 # There were 1 total successful branch saturations.
% 0.18/0.35 # There were 0 successful branch saturations in interreduction.
% 0.18/0.35 # There were 0 successful branch saturations on the branch.
% 0.18/0.35 # There were 1 successful branch saturations after the branch.
% 0.18/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # Begin clausification derivation
% 0.18/0.35
% 0.18/0.35 # End clausification derivation
% 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.35 cnf(i_0_24, plain, (c_Message_OinvKey(c_Message_OinvKey(X1))=X1)).
% 0.18/0.35 cnf(i_0_36, negated_conjecture, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_35, negated_conjecture, (c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat))).
% 0.18/0.35 cnf(i_0_27, plain, (c_Message_Oparts(c_Message_Oanalz(X1))=c_Message_Oparts(X1))).
% 0.18/0.35 cnf(i_0_29, plain, (c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg)=c_Message_Oparts(c_Message_Osynth(X1)))).
% 0.18/0.35 cnf(i_0_23, plain, (c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_26, plain, (c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat)=c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_30, plain, (c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg)=c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_38, negated_conjecture, (~c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_37, negated_conjecture, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat))).
% 0.18/0.35 cnf(i_0_22, plain, (c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)|~c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_34, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X3,X4))).
% 0.18/0.35 cnf(i_0_33, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X2,X4))).
% 0.18/0.35 cnf(i_0_25, plain, (c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat))|~c_lessequals(X1,X2,tc_set(tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_21, plain, (c_Message_OinvKey(v_sko__uhi(X1,X2))=X2|c_in(X2,c_Message_OkeysFor(X1),tc_nat)|~c_in(X2,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat))).
% 0.18/0.35 cnf(i_0_20, plain, (c_in(c_Message_Omsg_OKey(v_sko__uhi(X1,X2)),X1,tc_Message_Omsg)|c_in(X2,c_Message_OkeysFor(X1),tc_nat)|~c_in(X2,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat))).
% 0.18/0.35 cnf(i_0_31, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.18/0.35 cnf(i_0_32, plain, (c_in(X1,X2,X3)|c_in(X1,X4,X3)|~c_in(X1,c_union(X2,X4,X3),X3))).
% 0.18/0.35 cnf(i_0_28, plain, (c_lessequals(c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))|~c_in(X1,X3,tc_Message_Omsg))).
% 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.35 # Begin printing tableau
% 0.18/0.35 # Found 6 steps
% 0.18/0.35 cnf(i_0_37, negated_conjecture, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(start_rule)).
% 0.18/0.35 cnf(i_0_39, plain, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(extension_rule, [i_0_32])).
% 0.18/0.35 cnf(i_0_61, plain, (c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(closure_rule, [i_0_37])).
% 0.18/0.35 cnf(i_0_62, plain, (~c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),tc_nat)), inference(extension_rule, [i_0_31])).
% 0.18/0.35 cnf(i_0_103, plain, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat)), inference(closure_rule, [i_0_35])).
% 0.18/0.35 cnf(i_0_102, plain, (~c_lessequals(c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),c_union(c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),tc_set(tc_nat))), inference(etableau_closure_rule, [i_0_102, ...])).
% 0.18/0.35 # End printing tableau
% 0.18/0.35 # SZS output end
% 0.18/0.35 # Branches closed with saturation will be marked with an "s"
% 0.18/0.35 # There were 1 total branch saturation attempts.
% 0.18/0.35 # There were 0 of these attempts blocked.
% 0.18/0.35 # There were 0 deferred branch saturation attempts.
% 0.18/0.35 # There were 0 free duplicated saturations.
% 0.18/0.35 # There were 1 total successful branch saturations.
% 0.18/0.35 # There were 0 successful branch saturations in interreduction.
% 0.18/0.35 # There were 0 successful branch saturations on the branch.
% 0.18/0.35 # There were 1 successful branch saturations after the branch.
% 0.18/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 # Begin clausification derivation
% 0.18/0.35
% 0.18/0.35 # End clausification derivation
% 0.18/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.35 cnf(i_0_24, plain, (c_Message_OinvKey(c_Message_OinvKey(X1))=X1)).
% 0.18/0.35 cnf(i_0_36, negated_conjecture, (c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_35, negated_conjecture, (c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat))).
% 0.18/0.35 cnf(i_0_27, plain, (c_Message_Oparts(c_Message_Oanalz(X1))=c_Message_Oparts(X1))).
% 0.18/0.35 cnf(i_0_29, plain, (c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg)=c_Message_Oparts(c_Message_Osynth(X1)))).
% 0.18/0.35 cnf(i_0_23, plain, (c_lessequals(c_Message_Oanalz(X1),c_Message_Oparts(X1),tc_set(tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_26, plain, (c_union(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_nat)=c_Message_OkeysFor(c_union(X1,X2,tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_30, plain, (c_union(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_Message_Omsg)=c_Message_Oparts(c_union(X1,X2,tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_38, negated_conjecture, (~c_in(c_Message_Omsg_OKey(c_Message_OinvKey(v_K)),c_Message_Oparts(v_H),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_37, negated_conjecture, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat))).
% 0.18/0.35 cnf(i_0_22, plain, (c_in(X1,c_Message_Oparts(X2),tc_Message_Omsg)|~c_in(X1,c_Message_Oanalz(X2),tc_Message_Omsg))).
% 0.18/0.35 cnf(i_0_34, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X3,X4))).
% 0.18/0.35 cnf(i_0_33, plain, (c_in(X1,c_union(X2,X3,X4),X4)|~c_in(X1,X2,X4))).
% 0.18/0.35 cnf(i_0_25, plain, (c_lessequals(c_Message_OkeysFor(X1),c_Message_OkeysFor(X2),tc_set(tc_nat))|~c_lessequals(X1,X2,tc_set(tc_Message_Omsg)))).
% 0.18/0.35 cnf(i_0_21, plain, (c_Message_OinvKey(v_sko__uhi(X1,X2))=X2|c_in(X2,c_Message_OkeysFor(X1),tc_nat)|~c_in(X2,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat))).
% 0.18/0.35 cnf(i_0_20, plain, (c_in(c_Message_Omsg_OKey(v_sko__uhi(X1,X2)),X1,tc_Message_Omsg)|c_in(X2,c_Message_OkeysFor(X1),tc_nat)|~c_in(X2,c_Message_OkeysFor(c_Message_Osynth(X1)),tc_nat))).
% 0.18/0.35 cnf(i_0_31, plain, (c_in(X1,X2,X3)|~c_lessequals(X4,X2,tc_set(X3))|~c_in(X1,X4,X3))).
% 0.18/0.35 cnf(i_0_32, plain, (c_in(X1,X2,X3)|c_in(X1,X4,X3)|~c_in(X1,c_union(X2,X4,X3),X3))).
% 0.18/0.35 cnf(i_0_28, plain, (c_lessequals(c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),c_Message_Oparts(c_union(X3,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg))|~c_in(X1,X3,tc_Message_Omsg))).
% 0.18/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.35 # Begin printing tableau
% 0.18/0.35 # Found 6 steps
% 0.18/0.35 cnf(i_0_37, negated_conjecture, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(start_rule)).
% 0.18/0.35 cnf(i_0_39, plain, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(extension_rule, [i_0_32])).
% 0.18/0.35 cnf(i_0_60, plain, (c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat)), inference(closure_rule, [i_0_37])).
% 0.18/0.35 cnf(i_0_62, plain, (~c_in(v_K,c_union(c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),tc_nat)), inference(extension_rule, [i_0_31])).
% 0.18/0.35 cnf(i_0_103, plain, (~c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),tc_nat)), inference(closure_rule, [i_0_35])).
% 0.18/0.35 cnf(i_0_102, plain, (~c_lessequals(c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg))),c_union(c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),c_Message_OkeysFor(c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg))),tc_nat),tc_set(tc_nat))), inference(etableau_closure_rule, [i_0_102, ...])).
% 0.18/0.35 # End printing tableau
% 0.18/0.35 # SZS output end
% 0.18/0.35 # Branches closed with saturation will be marked with an "s"
% 0.18/0.35 # Child (24341) has found a proof.
% 0.18/0.35
% 0.18/0.35 # Proof search is over...
% 0.18/0.35 # Freeing feature tree
%------------------------------------------------------------------------------