TSTP Solution File: SYN982-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN982-1 : TPTP v8.1.0. Released v3.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 : n007.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 06:15:14 EDT 2022
% Result : Unsatisfiable 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN982-1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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.34 % Computer : n007.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 : Tue Jul 12 03:40:33 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_S4d
% 0.12/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 37 Number of unprocessed: 37
% 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.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 37 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 1 conjectures.
% 0.12/0.38 # There are 1 start rule candidates:
% 0.12/0.38 # Found 14 unit axioms.
% 0.12/0.38 # 1 start rule tableaux created.
% 0.12/0.38 # 23 extension rule candidate clauses
% 0.12/0.38 # 14 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.38 # We now have 13 tableaux to operate on
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_61])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_472, plain, (~ssIm(quadr(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)),X7,X8,X9))), inference(etableau_closure_rule, [i_0_472, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_59])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_468, plain, (~ssIm(quadr(X7,X8,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)),X9))), inference(etableau_closure_rule, [i_0_468, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_56])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_461, plain, (~ssIm(triple(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)),X7,X8))), inference(etableau_closure_rule, [i_0_461, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_55])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_459, plain, (~ssIm(triple(X7,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)),X8))), inference(etableau_closure_rule, [i_0_459, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_457, plain, (~ssM(sent(X7,X8,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(etableau_closure_rule, [i_0_457, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_41, plain, (ssP(b))).
% 0.12/0.39 cnf(i_0_42, plain, (ssP(a))).
% 0.12/0.39 cnf(i_0_38, plain, (ssNonce(na))).
% 0.12/0.39 cnf(i_0_39, plain, (ssP(t))).
% 0.12/0.39 cnf(i_0_40, plain, (ssBf(na))).
% 0.12/0.39 cnf(i_0_43, plain, (ssNonce(nb(X1)))).
% 0.12/0.39 cnf(i_0_44, plain, (ssNonce(tb(X1)))).
% 0.12/0.39 cnf(i_0_46, plain, (ssTk(key(bt,b)))).
% 0.12/0.39 cnf(i_0_47, plain, (ssTk(key(at,a)))).
% 0.12/0.39 cnf(i_0_48, plain, (ssBk(key(bt,t)))).
% 0.12/0.39 cnf(i_0_49, plain, (ssSa(pair(b,na)))).
% 0.12/0.39 cnf(i_0_50, plain, (ssAk(key(at,t)))).
% 0.12/0.39 cnf(i_0_53, plain, (ssM(sent(a,b,pair(a,na))))).
% 0.12/0.39 cnf(i_0_45, plain, (~ssNonce(kt(X1)))).
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(X1,b))|~ssBk(key(X1,a)))).
% 0.12/0.39 cnf(i_0_51, plain, (ssIm(X1)|~ssIm(pair(X2,X1)))).
% 0.12/0.39 cnf(i_0_52, plain, (ssIm(X1)|~ssIm(pair(X1,X2)))).
% 0.12/0.39 cnf(i_0_63, plain, (ssIm(pair(X1,X2))|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_54, plain, (ssIm(X1)|~ssIm(triple(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_57, plain, (ssIm(X1)|~ssM(sent(X2,X3,X1)))).
% 0.12/0.39 cnf(i_0_55, plain, (ssIm(X1)|~ssIm(triple(X2,X1,X3)))).
% 0.12/0.39 cnf(i_0_56, plain, (ssIm(X1)|~ssIm(triple(X1,X2,X3)))).
% 0.12/0.39 cnf(i_0_62, plain, (ssIk(key(X1,X2))|~ssIm(X1)|~ssP(X2))).
% 0.12/0.39 cnf(i_0_58, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X4,X1)))).
% 0.12/0.39 cnf(i_0_59, plain, (ssIm(X1)|~ssIm(quadr(X2,X3,X1,X4)))).
% 0.12/0.39 cnf(i_0_60, plain, (ssIm(X1)|~ssIm(quadr(X2,X1,X3,X4)))).
% 0.12/0.39 cnf(i_0_61, plain, (ssIm(X1)|~ssIm(quadr(X1,X2,X3,X4)))).
% 0.12/0.39 cnf(i_0_66, plain, (ssIm(encr(X1,X2))|~ssIk(key(X2,X3))|~ssIm(X1)|~ssP(X3))).
% 0.12/0.39 cnf(i_0_65, plain, (ssIm(triple(X1,X2,X3))|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_64, plain, (ssM(sent(X1,X2,X3))|~ssIm(X3)|~ssP(X2)|~ssP(X1))).
% 0.12/0.39 cnf(i_0_67, plain, (ssSb(pair(X1,X2))|~ssM(sent(X1,b,pair(X1,X2)))|~ssBf(X2))).
% 0.12/0.39 cnf(i_0_68, plain, (ssIm(quadr(X1,X2,X3,X4))|~ssIm(X4)|~ssIm(X3)|~ssIm(X2)|~ssIm(X1))).
% 0.12/0.39 cnf(i_0_69, plain, (ssAk(key(X1,X2))|~ssM(sent(t,a,triple(encr(quadr(X2,X3,X1,X4),at),X5,X6)))|~ssSa(pair(X2,X3)))).
% 0.12/0.39 cnf(i_0_71, plain, (ssBk(key(X1,X2))|~ssSb(pair(X2,X3))|~ssM(sent(X2,b,pair(encr(triple(X2,X1,tb(X3)),bt),encr(nb(X3),X1)))))).
% 0.12/0.39 cnf(i_0_72, plain, (ssM(sent(a,X1,pair(X2,encr(X3,X4))))|~ssM(sent(t,a,triple(encr(quadr(X1,X5,X4,X6),at),X2,X3)))|~ssSa(pair(X1,X5)))).
% 0.12/0.39 cnf(i_0_70, plain, (ssM(sent(b,t,triple(b,nb(X1),encr(triple(X2,X1,tb(X1)),bt))))|~ssM(sent(X2,b,pair(X2,X1)))|~ssBf(X1))).
% 0.12/0.39 cnf(i_0_73, plain, (ssM(sent(t,X1,triple(encr(quadr(X2,X3,kt(X3),X4),X5),encr(triple(X1,kt(X3),X4),X6),X7)))|~ssM(sent(X2,t,triple(X2,X7,encr(triple(X1,X3,X4),X6))))|~ssTk(key(X5,X1))|~ssTk(key(X6,X2))|~ssNonce(X3))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 15 steps
% 0.12/0.39 cnf(i_0_74, negated_conjecture, (~ssIk(key(na,b))|~ssBk(key(na,a))), inference(start_rule)).
% 0.12/0.39 cnf(i_0_76, plain, (~ssBk(key(na,a))), inference(extension_rule, [i_0_71])).
% 0.12/0.39 cnf(i_0_193, plain, (~ssM(sent(a,b,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(extension_rule, [i_0_64])).
% 0.12/0.39 cnf(i_0_308, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_309, plain, (~ssP(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.39 cnf(i_0_307, plain, (~ssIm(pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na)))), inference(extension_rule, [i_0_58])).
% 0.12/0.39 cnf(i_0_192, plain, (~ssSb(pair(a,na))), inference(extension_rule, [i_0_67])).
% 0.12/0.39 cnf(i_0_551, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_552, plain, (~ssBf(na)), inference(closure_rule, [i_0_40])).
% 0.12/0.39 cnf(i_0_75, plain, (~ssIk(key(na,b))), inference(extension_rule, [i_0_62])).
% 0.12/0.39 cnf(i_0_570, plain, (~ssP(b)), inference(closure_rule, [i_0_41])).
% 0.12/0.39 cnf(i_0_569, plain, (~ssIm(na)), inference(extension_rule, [i_0_51])).
% 0.12/0.39 cnf(i_0_572, plain, (~ssIm(pair(a,na))), inference(extension_rule, [i_0_57])).
% 0.12/0.39 cnf(i_0_584, plain, (~ssM(sent(a,b,pair(a,na)))), inference(closure_rule, [i_0_53])).
% 0.12/0.39 cnf(i_0_466, plain, (~ssIm(quadr(X7,X8,X9,pair(encr(triple(a,na,tb(na)),bt),encr(nb(na),na))))), inference(etableau_closure_rule, [i_0_466, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # Child (9002) has found a proof.
% 0.12/0.39
% 0.12/0.39 # Proof search is over...
% 0.12/0.39 # Freeing feature tree
%------------------------------------------------------------------------------