TSTP Solution File: SET171+4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET171+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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 04:59:41 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ equal_set(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI11)]) ).
cnf(g1,plain,
( ~ subset(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5)))
| ~ subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5)))
| equal_set(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',equal_set)]) ).
cnf(g2,plain,
( subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5)))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(union(sK3,sK4),union(sK3,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g3,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| subset(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g4,plain,
( subset(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5)))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,intersection(sK4,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g5,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,intersection(sK4,sK5)))
| subset(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',subset)]) ).
cnf(g6,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g7,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(union(sK3,sK4),union(sK3,sK5)))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g8,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(sK4,sK5))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,intersection(sK4,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g9,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,intersection(sK4,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g10,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,intersection(sK4,sK5)))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g11,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4)
| ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),intersection(sK4,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g12,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4))
| ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(union(sK3,sK4),union(sK3,sK5))) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g13,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g14,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK5)
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g15,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK4))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK4) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g16,plain,
( ~ member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),union(sK3,sK5))
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK3)
| member(sK0(intersection(union(sK3,sK4),union(sK3,sK5)),union(sK3,intersection(sK4,sK5))),sK5) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g17,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK4)
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g18,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK3)
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),union(sK3,sK4)) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',union)]) ).
cnf(g19,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK4) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
cnf(g20,plain,
( ~ member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),intersection(sK4,sK5))
| member(sK0(union(sK3,intersection(sK4,sK5)),intersection(union(sK3,sK4),union(sK3,sK5))),sK5) ),
inference(ground_cnf,[],[file('Axioms/SET006+0.ax',intersection)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET171+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 06:27:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41 % symbols: 20
% 0.19/0.41 % clauses: 47
% 0.19/0.41 % start clauses: 1
% 0.19/0.41 % iterative deepening steps: 230
% 0.19/0.41 % maximum path limit: 4
% 0.19/0.41 % literal attempts: 27119
% 0.19/0.41 % depth failures: 20405
% 0.19/0.41 % regularity failures: 1378
% 0.19/0.41 % tautology failures: 548
% 0.19/0.41 % reductions: 1087
% 0.19/0.41 % extensions: 25931
% 0.19/0.41 % SAT variables: 14006
% 0.19/0.41 % SAT clauses: 16177
% 0.19/0.41 % WalkSAT solutions: 16174
% 0.19/0.41 % CDCL solutions: 0
% 0.19/0.41 % SZS status Theorem for theBenchmark
% 0.19/0.41 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------