TSTP Solution File: SET919+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET919+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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:57 EDT 2022
% Result : Theorem 42.32s 5.78s
% Output : Proof 42.32s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
in(sK5,sK6),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_zfmisc_1)]) ).
cnf(g1,plain,
( ~ in(sK7,sK6)
| sPE(sK5,sK7) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_zfmisc_1)]) ).
cnf(g2,plain,
~ sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),singleton(sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_zfmisc_1)]) ).
cnf(g3,plain,
( ~ sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5)
| sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),singleton(sK5))
| sP0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski)]) ).
cnf(g4,plain,
( sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),singleton(sK5))
| in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| sP0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski)]) ).
cnf(g5,plain,
( ~ sPE(sK5,sK7)
| sPE(sK7,sK5) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| ~ sP0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski)]) ).
cnf(g7,plain,
( sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5)
| ~ sP0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski)]) ).
cnf(g8,plain,
sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(sK6,unordered_pair(sK5,sK7))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).
cnf(g9,plain,
sPE(sK5,sK5),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)),unordered_pair(sK7,sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k3_xboole_0)]) ).
cnf(g11,plain,
sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK7)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(unordered_pair(sK5,sK7),unordered_pair(sK7,sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski)]) ).
cnf(g14,plain,
( ~ sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5)
| sPE(sK5,sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(set_intersection2(sK6,unordered_pair(sK5,sK7)),set_intersection2(unordered_pair(sK5,sK7),sK6)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0)]) ).
cnf(g16,plain,
( ~ sPE(set_intersection2(sK6,unordered_pair(sK5,sK7)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| ~ in(sK5,unordered_pair(sK5,sK7))
| ~ in(sK5,sK6)
| in(sK5,set_intersection2(sK6,unordered_pair(sK5,sK7))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g17,plain,
sPE(unordered_pair(sK7,sK5),unordered_pair(sK5,sK7)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski)]) ).
cnf(g18,plain,
( ~ sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK5))
| ~ in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),unordered_pair(sK5,sK7))
| sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5)
| sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g19,plain,
( ~ sPE(sK5,sK5)
| ~ sPE(sK7,sK5)
| sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK5)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(sK6,unordered_pair(sK5,sK7)))
| ~ in(sK7,set_intersection2(unordered_pair(sK5,sK7),sK6))
| in(sK7,sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g21,plain,
( ~ sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6))
| ~ in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),unordered_pair(sK5,sK7)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0)]) ).
cnf(g22,plain,
( ~ sPE(unordered_pair(sK5,sK7),unordered_pair(sK5,sK7))
| ~ sPE(sK5,sK7)
| in(sK5,unordered_pair(sK5,sK7)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g23,plain,
( ~ sPE(unordered_pair(sK5,sK7),unordered_pair(sK7,sK5))
| ~ in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),unordered_pair(sK5,sK7))
| sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK7)
| sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g24,plain,
( ~ sPE(sK5,sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)))
| ~ sPE(set_intersection2(sK6,unordered_pair(sK5,sK7)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| ~ in(sK5,set_intersection2(sK6,unordered_pair(sK5,sK7)))
| in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)),unordered_pair(sK7,sK5))
| ~ sPE(unordered_pair(sK7,sK5),unordered_pair(sK5,sK7))
| sPE(set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)),unordered_pair(sK5,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(sK5,sK5)
| ~ sPE(set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)),unordered_pair(sK5,sK7))
| ~ in(sK5,set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)))
| in(sK5,unordered_pair(sK5,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5)),unordered_pair(sK5,sK7))
| ~ sPE(sK5,sK5)
| in(sK5,set_intersection2(unordered_pair(sK7,sK5),unordered_pair(sK7,sK5))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g28,plain,
( ~ sPE(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),sK7)
| ~ sPE(set_intersection2(unordered_pair(sK5,sK7),sK6),set_intersection2(unordered_pair(sK5,sK7),sK6))
| ~ in(sK0(sK5,set_intersection2(unordered_pair(sK5,sK7),sK6)),set_intersection2(unordered_pair(sK5,sK7),sK6))
| in(sK7,set_intersection2(unordered_pair(sK5,sK7),sK6)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET919+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.15 % Command : satcop --statistics %s
% 0.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sat Jul 9 19:07:10 EDT 2022
% 0.16/0.37 % CPUTime :
% 42.32/5.78 % symbols: 18
% 42.32/5.78 % clauses: 45
% 42.32/5.78 % start clauses: 3
% 42.32/5.78 % iterative deepening steps: 5539
% 42.32/5.78 % maximum path limit: 4
% 42.32/5.78 % literal attempts: 9289501
% 42.32/5.78 % depth failures: 7400770
% 42.32/5.78 % regularity failures: 110531
% 42.32/5.78 % tautology failures: 151954
% 42.32/5.78 % reductions: 486330
% 42.32/5.78 % extensions: 8796005
% 42.32/5.78 % SAT variables: 662770
% 42.32/5.78 % SAT clauses: 890049
% 42.32/5.78 % WalkSAT solutions: 890036
% 42.32/5.78 % CDCL solutions: 10
% 42.32/5.78 % SZS status Theorem for theBenchmark
% 42.32/5.78 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------