TSTP Solution File: SET934+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET934+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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 05:05:05 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t81_zfmisc_1)]) ).
cnf(g1,plain,
( in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(powerset(sK5),powerset(sK6)))
| subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g2,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(set_union2(sK5,sK6)))
| subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g3,plain,
sPE(powerset(set_union2(sK5,sK6)),powerset(set_union2(sK5,sK6))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(set_union2(powerset(sK5),powerset(sK6)),set_union2(powerset(sK6),powerset(sK5))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0)]) ).
cnf(g5,plain,
( ~ sPE(powerset(set_union2(sK5,sK6)),powerset(set_union2(sK5,sK6)))
| ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(set_union2(sK5,sK6))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1)]) ).
cnf(g6,plain,
( ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK5)
| ~ subset(sK5,set_union2(sK5,sK6))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1)]) ).
cnf(g7,plain,
sPE(sK5,sK5),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(sK5,sK5)
| sPE(powerset(sK5),powerset(sK5)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(set_union2(powerset(sK5),powerset(sK6)),set_union2(powerset(sK6),powerset(sK5)))
| ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(powerset(sK5),powerset(sK6)))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK6))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
cnf(g10,plain,
subset(sK5,set_union2(sK5,sK6)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1)]) ).
cnf(g11,plain,
subset(sK6,set_union2(sK6,sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1)]) ).
cnf(g12,plain,
( ~ sPE(powerset(sK5),powerset(sK5))
| ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK5))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1)]) ).
cnf(g13,plain,
( ~ sPE(powerset(set_union2(sK5,sK6)),powerset(set_union2(sK6,sK5)))
| ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK6,sK5))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(set_union2(sK5,sK6))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1)]) ).
cnf(g14,plain,
( ~ sPE(set_union2(sK5,sK6),set_union2(sK6,sK5))
| sPE(powerset(set_union2(sK5,sK6)),powerset(set_union2(sK6,sK5))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(set_union2(sK5,sK6),set_union2(sK6,sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0)]) ).
cnf(g16,plain,
( ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK6)
| ~ subset(sK6,set_union2(sK6,sK5))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK6,sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1)]) ).
cnf(g17,plain,
sPE(powerset(sK6),powerset(sK6)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(powerset(sK6),powerset(sK6))
| ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK6))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET934+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n017.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 : Mon Jul 11 09:52:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % symbols: 16
% 0.19/0.48 % clauses: 41
% 0.19/0.48 % start clauses: 1
% 0.19/0.48 % iterative deepening steps: 455
% 0.19/0.48 % maximum path limit: 4
% 0.19/0.48 % literal attempts: 89912
% 0.19/0.48 % depth failures: 68784
% 0.19/0.48 % regularity failures: 682
% 0.19/0.48 % tautology failures: 2278
% 0.19/0.48 % reductions: 1878
% 0.19/0.48 % extensions: 87828
% 0.19/0.48 % SAT variables: 17992
% 0.19/0.48 % SAT clauses: 26229
% 0.19/0.48 % WalkSAT solutions: 26226
% 0.19/0.48 % CDCL solutions: 0
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------