%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET878+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n003.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:04:40 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(set_intersection2(singleton(sK3),unordered_pair(sK3,sK4)),singleton(sK3)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_zfmisc_1)]) ).
cnf(g1,plain,
( ~ sPE(singleton(sK3),set_intersection2(singleton(sK3),unordered_pair(sK3,sK4)))
| sPE(set_intersection2(singleton(sK3),unordered_pair(sK3,sK4)),singleton(sK3)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ in(sK3,unordered_pair(sK3,sK4))
| sPE(set_intersection2(unordered_pair(sK3,sK4),singleton(sK3)),singleton(sK3)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_zfmisc_1)]) ).
cnf(g3,plain,
sPE(set_intersection2(unordered_pair(sK3,sK4),singleton(sK3)),set_intersection2(singleton(sK3),unordered_pair(sK3,sK4))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).
cnf(g4,plain,
sPE(sK3,sK3),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(singleton(sK3),set_intersection2(unordered_pair(sK3,sK4),singleton(sK3)))
| ~ sPE(set_intersection2(unordered_pair(sK3,sK4),singleton(sK3)),set_intersection2(singleton(sK3),unordered_pair(sK3,sK4)))
| sPE(singleton(sK3),set_intersection2(singleton(sK3),unordered_pair(sK3,sK4))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(set_intersection2(unordered_pair(sK3,sK4),singleton(sK3)),singleton(sK3))
| sPE(singleton(sK3),set_intersection2(unordered_pair(sK3,sK4),singleton(sK3))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(unordered_pair(sK3,sK4),unordered_pair(sK3,sK4)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(unordered_pair(sK3,sK4),unordered_pair(sK3,sK4))
| ~ sPE(sK3,sK3)
| in(sK3,unordered_pair(sK3,sK4)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET878+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n003.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 23:36:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % symbols: 13
% 0.20/0.51 % clauses: 26
% 0.20/0.51 % start clauses: 1
% 0.20/0.51 % iterative deepening steps: 610
% 0.20/0.51 % maximum path limit: 5
% 0.20/0.51 % literal attempts: 114990
% 0.20/0.51 % depth failures: 82721
% 0.20/0.51 % regularity failures: 1969
% 0.20/0.51 % tautology failures: 3448
% 0.20/0.51 % reductions: 11496
% 0.20/0.51 % extensions: 103331
% 0.20/0.51 % SAT variables: 25646
% 0.20/0.51 % SAT clauses: 32435
% 0.20/0.51 % WalkSAT solutions: 32435
% 0.20/0.51 % CDCL solutions: 0
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------