TSTP Solution File: SEU159+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SEU159+2 : TPTP v8.1.0. Released v3.3.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 14:12:11 EDT 2022
% Result : Theorem 79.71s 10.37s
% Output : Proof 79.71s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( in(sK19,sK21)
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).
cnf(g1,plain,
( in(sK20,sK21)
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).
cnf(g2,plain,
( ~ in(sK19,sK21)
| ~ in(sK20,sK21)
| ~ subset(unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1)]) ).
cnf(g3,plain,
( ~ subset(unordered_pair(sK19,sK20),sK21)
| sPE(set_intersection2(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1)]) ).
cnf(g4,plain,
( ~ in(sK10(unordered_pair(sK19,sK20),sK21),sK21)
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g5,plain,
sPE(sK21,sK21),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( in(sK10(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| subset(unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g7,plain,
( ~ in(sK4(sK21,unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| ~ subset(unordered_pair(sK19,sK20),sK21)
| in(sK4(sK21,unordered_pair(sK19,sK20),sK21),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g8,plain,
( in(sK4(sK21,unordered_pair(sK19,sK20),sK21),sK21)
| in(sK4(sK21,unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| ~ sP3(sK21,unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
cnf(g9,plain,
( ~ sPE(sK21,sK21)
| ~ sPE(set_intersection2(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| ~ sPE(sK21,sK21)
| ~ sP3(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21),sK21)
| sP3(sK21,unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(sK19,sK19),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(unordered_pair(sK19,sK20),unordered_pair(sK19,sK20)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(set_union2(sK20,empty_set),sK20)
| ~ sPE(sK21,sK21)
| ~ in(set_union2(sK20,empty_set),sK21)
| in(sK20,sK21) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(set_union2(sK20,empty_set),sK20),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_boole)]) ).
cnf(g14,plain,
sPE(unordered_pair(sK19,sK20),unordered_pair(sK20,sK19)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski)]) ).
cnf(g15,plain,
( ~ in(set_union2(sK20,empty_set),unordered_pair(sK19,sK20))
| ~ subset(unordered_pair(sK19,sK20),sK21)
| in(set_union2(sK20,empty_set),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski)]) ).
cnf(g16,plain,
( ~ sPE(unordered_pair(sK19,sK20),unordered_pair(sK19,sK20))
| ~ sPE(set_union2(sK20,empty_set),sK20)
| in(set_union2(sK20,empty_set),unordered_pair(sK19,sK20)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g17,plain,
( ~ sPE(sK19,sK10(unordered_pair(sK19,sK20),sK21))
| ~ sPE(sK21,sK21)
| ~ in(sK19,sK21)
| in(sK10(unordered_pair(sK19,sK20),sK21),sK21) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(sK10(unordered_pair(sK19,sK20),sK21),sK19)
| sPE(sK19,sK10(unordered_pair(sK19,sK20),sK21)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(sK20,sK10(unordered_pair(sK19,sK20),sK21))
| ~ sPE(sK21,sK21)
| ~ in(sK20,sK21)
| in(sK10(unordered_pair(sK19,sK20),sK21),sK21) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ in(sK4(sK21,unordered_pair(sK19,sK20),sK21),sK21)
| ~ sP3(sK21,unordered_pair(sK19,sK20),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
cnf(g21,plain,
( ~ in(sK4(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21),sK21),sK21)
| sPE(sK21,set_union2(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21)))
| sP3(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
cnf(g22,plain,
( sPE(sK21,set_union2(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21)))
| in(sK4(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21),sK21),sK21)
| sP3(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21),sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
cnf(g23,plain,
( ~ sPE(unordered_pair(sK19,sK20),unordered_pair(sK20,sK19))
| ~ in(sK10(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| sPE(sK10(unordered_pair(sK19,sK20),sK21),sK20)
| sPE(sK10(unordered_pair(sK19,sK20),sK21),sK19) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g24,plain,
( ~ sPE(sK10(unordered_pair(sK19,sK20),sK21),sK20)
| sPE(sK20,sK10(unordered_pair(sK19,sK20),sK21)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(set_intersection2(unordered_pair(sK19,sK20),sK21),unordered_pair(sK19,sK20))
| ~ sPE(sK19,sK19)
| in(sK19,set_intersection2(unordered_pair(sK19,sK20),sK21)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski)]) ).
cnf(g26,plain,
( ~ sPE(sK21,set_union2(sK21,set_intersection2(unordered_pair(sK19,sK20),sK21)))
| ~ in(sK19,set_intersection2(unordered_pair(sK19,sK20),sK21))
| in(sK19,sK21) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU159+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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 : Mon Jun 20 07:16:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 79.71/10.37 % symbols: 49
% 79.71/10.37 % clauses: 201
% 79.71/10.37 % start clauses: 3
% 79.71/10.37 % iterative deepening steps: 799
% 79.71/10.37 % maximum path limit: 3
% 79.71/10.37 % literal attempts: 1772536
% 79.71/10.37 % depth failures: 1612553
% 79.71/10.37 % regularity failures: 19104
% 79.71/10.37 % tautology failures: 8351
% 79.71/10.37 % reductions: 57174
% 79.71/10.37 % extensions: 1714459
% 79.71/10.37 % SAT variables: 349314
% 79.71/10.37 % SAT clauses: 380529
% 79.71/10.37 % WalkSAT solutions: 378586
% 79.71/10.37 % CDCL solutions: 1936
% 79.71/10.37 % SZS status Theorem for theBenchmark
% 79.71/10.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------