TSTP Solution File: SEU129+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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:51 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
subset(sK4,sK5),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1)]) ).
cnf(g1,plain,
~ subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1)]) ).
cnf(g2,plain,
( in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK4,sK6))
| subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g3,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6))
| subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g4,plain,
sPE(set_intersection2(sK5,sK6),set_intersection2(sK5,sK6)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(set_intersection2(sK4,sK6),set_intersection2(sK4,sK6)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(set_intersection2(sK4,sK6),set_intersection2(sK6,sK4)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).
cnf(g7,plain,
( ~ sPE(set_intersection2(sK4,sK6),set_intersection2(sK6,sK4))
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK4,sK6))
| in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g8,plain,
( ~ sPE(set_intersection2(sK5,sK6),set_intersection2(sK5,sK6))
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5)
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6)
| in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g9,plain,
( ~ sPE(set_intersection2(sK4,sK6),set_intersection2(sK4,sK6))
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK4,sK6))
| in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g10,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4)
| ~ subset(sK4,sK5)
| in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU129+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 12:38:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.47 % symbols: 15
% 0.20/0.47 % clauses: 34
% 0.20/0.47 % start clauses: 2
% 0.20/0.47 % iterative deepening steps: 501
% 0.20/0.47 % maximum path limit: 4
% 0.20/0.47 % literal attempts: 109692
% 0.20/0.47 % depth failures: 80117
% 0.20/0.47 % regularity failures: 1152
% 0.20/0.47 % tautology failures: 2579
% 0.20/0.47 % reductions: 4076
% 0.20/0.47 % extensions: 104939
% 0.20/0.47 % SAT variables: 13106
% 0.20/0.47 % SAT clauses: 22255
% 0.20/0.47 % WalkSAT solutions: 22254
% 0.20/0.47 % CDCL solutions: 0
% 0.20/0.47 % SZS status Theorem for theBenchmark
% 0.20/0.47 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------