TSTP Solution File: SET696+4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET696+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n029.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 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ equal_set(intersection(difference(sK4,sK3),sK3),empty_set),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI28)]) ).
cnf(g1,plain,
( ~ subset(intersection(difference(sK4,sK3),sK3),empty_set)
| ~ subset(empty_set,intersection(difference(sK4,sK3),sK3))
| equal_set(intersection(difference(sK4,sK3),sK3),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).
cnf(g2,plain,
( subset(intersection(difference(sK4,sK3),sK3),empty_set)
| member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),intersection(difference(sK4,sK3),sK3)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g3,plain,
( subset(empty_set,intersection(difference(sK4,sK3),sK3))
| member(sK0(empty_set,intersection(difference(sK4,sK3),sK3)),empty_set) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g4,plain,
~ member(sK0(empty_set,intersection(difference(sK4,sK3),sK3)),empty_set),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',empty_set)]) ).
cnf(g5,plain,
( ~ member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),intersection(difference(sK4,sK3),sK3))
| member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),difference(sK4,sK3)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g6,plain,
( ~ member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),intersection(difference(sK4,sK3),sK3))
| member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),sK3) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g7,plain,
( ~ member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),sK3)
| ~ member(sK0(intersection(difference(sK4,sK3),sK3),empty_set),difference(sK4,sK3)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',difference)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET696+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n029.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 : Sat Jul 9 21:16:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.40 % symbols: 19
% 0.20/0.40 % clauses: 48
% 0.20/0.40 % start clauses: 2
% 0.20/0.40 % iterative deepening steps: 323
% 0.20/0.40 % maximum path limit: 4
% 0.20/0.40 % literal attempts: 72266
% 0.20/0.40 % depth failures: 52915
% 0.20/0.40 % regularity failures: 4437
% 0.20/0.40 % tautology failures: 1189
% 0.20/0.40 % reductions: 3977
% 0.20/0.40 % extensions: 67981
% 0.20/0.40 % SAT variables: 13669
% 0.20/0.40 % SAT clauses: 15918
% 0.20/0.40 % WalkSAT solutions: 15915
% 0.20/0.40 % CDCL solutions: 0
% 0.20/0.40 % SZS status Theorem for theBenchmark
% 0.20/0.40 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------