TSTP Solution File: SWW965+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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 01:24:20 EDT 2022
% Result : Theorem 6.53s 1.31s
% Output : Proof 7.17s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ pred_attacker(name_objective),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0)]) ).
cnf(g1,plain,
( ~ pred_attacker(tuple_client_B_out_6(name_objective))
| pred_attacker(name_objective) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax131)]) ).
cnf(g2,plain,
pred_attacker(name_new0x2Dname(name_objective)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax173)]) ).
cnf(g3,plain,
pred_attacker(tuple_false),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax127)]) ).
cnf(g4,plain,
pred_attacker(constr_CONST_0x30),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax162)]) ).
cnf(g5,plain,
( ~ pred_attacker(tuple_false)
| pred_attacker(tuple_client_B_in_5(tuple_false)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax137)]) ).
cnf(g6,plain,
pred_eq_bitstring_bitstring(name_Nb(name_objective),constr_adec(tuple_false,name_skB)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103)]) ).
cnf(g7,plain,
( ~ pred_attacker(constr_CONST_0x30)
| pred_attacker(tuple_client_B_in_2(constr_CONST_0x30)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax141)]) ).
cnf(g8,plain,
pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(constr_CONST_0x30,constr_pkey(name_skS)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103)]) ).
cnf(g9,plain,
( ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(name_new0x2Dname(name_objective),name_skB)))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(constr_CONST_0x30,constr_pkey(name_skS))))
| ~ pred_eq_bitstring_bitstring(name_Nb(name_objective),constr_adec(tuple_false,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(tuple_false))
| ~ pred_attacker(tuple_client_B_in_3(name_new0x2Dname(name_objective)))
| ~ pred_attacker(tuple_client_B_in_2(constr_CONST_0x30))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax184)]) ).
cnf(g10,plain,
( ~ pred_attacker(name_new0x2Dname(name_objective))
| pred_attacker(tuple_client_B_in_3(name_new0x2Dname(name_objective))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax139)]) ).
cnf(g11,plain,
pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(name_new0x2Dname(name_objective),name_skB))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 6 08:20:03 EDT 2022
% 0.14/0.36 % CPUTime :
% 6.53/1.31 % symbols: 58
% 6.53/1.31 % clauses: 231
% 6.53/1.31 % start clauses: 1
% 6.53/1.31 % iterative deepening steps: 481
% 6.53/1.31 % maximum path limit: 3
% 6.53/1.31 % literal attempts: 5115994
% 6.53/1.31 % depth failures: 4737530
% 6.53/1.31 % regularity failures: 156324
% 6.53/1.31 % tautology failures: 772
% 6.53/1.31 % reductions: 0
% 6.53/1.31 % extensions: 5115759
% 6.53/1.31 % SAT variables: 211416
% 6.53/1.31 % SAT clauses: 229544
% 6.53/1.31 % WalkSAT solutions: 229544
% 6.53/1.31 % CDCL solutions: 0
% 6.53/1.31 % SZS status Theorem for theBenchmark
% 6.53/1.31 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------