TSTP Solution File: SET697+4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET697+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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:03:13 EDT 2022
% Result : Theorem 209.45s 27.26s
% Output : Proof 209.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
subset(sK3,sK5),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI31)]) ).
cnf(g1,plain,
( subset(sK3,sK4)
| equal_set(intersection(sK3,difference(sK5,sK4)),empty_set) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI31)]) ).
cnf(g2,plain,
( ~ subset(sK3,sK4)
| ~ equal_set(intersection(sK3,difference(sK5,sK4)),empty_set) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI31)]) ).
cnf(g3,plain,
( subset(sK3,sK4)
| member(sK0(sK3,sK4),sK3) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g4,plain,
( ~ subset(intersection(sK3,difference(sK5,sK4)),empty_set)
| ~ subset(empty_set,intersection(sK3,difference(sK5,sK4)))
| equal_set(intersection(sK3,difference(sK5,sK4)),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).
cnf(g5,plain,
( ~ subset(sK3,sK5)
| ~ member(sK0(sK3,sK4),sK3)
| member(sK0(sK3,sK4),sK5) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g6,plain,
( ~ member(sK0(sK3,sK4),sK4)
| subset(sK3,sK4) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g7,plain,
( ~ equal_set(intersection(sK3,difference(sK5,sK4)),empty_set)
| subset(intersection(sK3,difference(sK5,sK4)),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).
cnf(g8,plain,
( subset(empty_set,intersection(sK3,difference(sK5,sK4)))
| member(sK0(empty_set,intersection(sK3,difference(sK5,sK4))),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g9,plain,
( subset(intersection(sK3,difference(sK5,sK4)),empty_set)
| member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),intersection(sK3,difference(sK5,sK4))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g10,plain,
~ member(sK0(empty_set,intersection(sK3,difference(sK5,sK4))),empty_set),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',empty_set)]) ).
cnf(g11,plain,
( ~ member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),intersection(sK3,difference(sK5,sK4)))
| member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),difference(sK5,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g12,plain,
( ~ member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),intersection(sK3,difference(sK5,sK4)))
| member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),sK3) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g13,plain,
( ~ member(sK0(sK3,sK4),sK5)
| member(sK0(sK3,sK4),sK4)
| member(sK0(sK3,sK4),difference(sK5,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',difference)]) ).
cnf(g14,plain,
~ member(sK0(sK3,sK4),empty_set),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',empty_set)]) ).
cnf(g15,plain,
( ~ member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),sK4)
| ~ member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),difference(sK5,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',difference)]) ).
cnf(g16,plain,
( ~ subset(sK3,sK4)
| ~ member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),sK3)
| member(sK0(intersection(sK3,difference(sK5,sK4)),empty_set),sK4) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g17,plain,
( ~ member(sK0(sK3,sK4),sK3)
| ~ member(sK0(sK3,sK4),difference(sK5,sK4))
| member(sK0(sK3,sK4),intersection(sK3,difference(sK5,sK4))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g18,plain,
( ~ subset(intersection(sK3,difference(sK5,sK4)),empty_set)
| ~ member(sK0(sK3,sK4),intersection(sK3,difference(sK5,sK4)))
| member(sK0(sK3,sK4),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET697+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.14/0.36 % Computer : n009.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 Jul 11 02:25:37 EDT 2022
% 0.14/0.36 % CPUTime :
% 209.45/27.26 % symbols: 20
% 209.45/27.26 % clauses: 50
% 209.45/27.26 % start clauses: 4
% 209.45/27.26 % iterative deepening steps: 1994
% 209.45/27.26 % maximum path limit: 4
% 209.45/27.26 % literal attempts: 5198350
% 209.45/27.26 % depth failures: 3948043
% 209.45/27.26 % regularity failures: 305982
% 209.45/27.26 % tautology failures: 125048
% 209.45/27.26 % reductions: 339553
% 209.45/27.26 % extensions: 4856874
% 209.45/27.26 % SAT variables: 453791
% 209.45/27.26 % SAT clauses: 589910
% 209.45/27.26 % WalkSAT solutions: 585803
% 209.45/27.26 % CDCL solutions: 4099
% 209.45/27.26 % SZS status Theorem for theBenchmark
% 209.45/27.26 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------