%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n016.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 : Tue Jul 19 14:11:43 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ subset(finite_subsets(sK12),powerset(sK12)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finsub_1)]) ).
cnf(g1,plain,
( in(sK0(finite_subsets(sK12),powerset(sK12)),finite_subsets(sK12))
| subset(finite_subsets(sK12),powerset(sK12)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g2,plain,
( ~ in(sK0(finite_subsets(sK12),powerset(sK12)),powerset(sK12))
| subset(finite_subsets(sK12),powerset(sK12)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g3,plain,
( ~ element(sK0(finite_subsets(sK12),powerset(sK12)),powerset(sK12))
| in(sK0(finite_subsets(sK12),powerset(sK12)),powerset(sK12))
| empty(powerset(sK12)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset)]) ).
cnf(g4,plain,
sPE(finite_subsets(sK12),finite_subsets(sK12)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(finite_subsets(sK12),finite_subsets(sK12))
| ~ in(sK0(finite_subsets(sK12),powerset(sK12)),finite_subsets(sK12))
| ~ preboolean(finite_subsets(sK12))
| subset(sK0(finite_subsets(sK12),powerset(sK12)),sK12) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1)]) ).
cnf(g6,plain,
preboolean(finite_subsets(sK12)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1)]) ).
cnf(g7,plain,
( ~ subset(sK0(finite_subsets(sK12),powerset(sK12)),sK12)
| element(sK0(finite_subsets(sK12),powerset(sK12)),powerset(sK12)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset)]) ).
cnf(g8,plain,
~ empty(powerset(sK12)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 04:29:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % symbols: 35
% 0.13/0.36 % clauses: 100
% 0.13/0.36 % start clauses: 1
% 0.13/0.36 % iterative deepening steps: 61
% 0.13/0.36 % maximum path limit: 2
% 0.13/0.36 % literal attempts: 2636
% 0.13/0.36 % depth failures: 1992
% 0.13/0.36 % regularity failures: 64
% 0.13/0.36 % tautology failures: 42
% 0.13/0.36 % reductions: 7
% 0.13/0.36 % extensions: 2569
% 0.13/0.36 % SAT variables: 913
% 0.13/0.36 % SAT clauses: 1143
% 0.13/0.36 % WalkSAT solutions: 1135
% 0.13/0.36 % CDCL solutions: 0
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------