TSTP Solution File: SEU150+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n006.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:04 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(singleton(sK0),unordered_pair(sK1,sK2)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1)]) ).
cnf(g1,plain,
~ sPE(sK1,sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1)]) ).
cnf(g2,plain,
( ~ sPE(singleton(sK0),unordered_pair(sK1,sK2))
| sPE(unordered_pair(sK1,sK2),singleton(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(sK2,sK1)
| sPE(sK1,sK2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(singleton(sK0),unordered_pair(sK1,sK2))
| ~ sPE(unordered_pair(sK1,sK2),unordered_pair(sK2,sK1))
| sPE(singleton(sK0),unordered_pair(sK2,sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
sPE(unordered_pair(sK1,sK2),unordered_pair(sK2,sK1)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski)]) ).
cnf(g6,plain,
( ~ sPE(singleton(sK0),unordered_pair(sK2,sK1))
| sPE(sK0,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1)]) ).
cnf(g7,plain,
( ~ sPE(singleton(sK2),unordered_pair(sK1,sK2))
| sPE(sK2,sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1)]) ).
cnf(g8,plain,
( ~ sPE(unordered_pair(sK1,sK2),singleton(sK0))
| ~ sPE(singleton(sK0),singleton(sK2))
| sPE(unordered_pair(sK1,sK2),singleton(sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(sK0,sK2)
| sPE(singleton(sK0),singleton(sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(unordered_pair(sK1,sK2),singleton(sK2))
| sPE(singleton(sK2),unordered_pair(sK1,sK2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n006.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 : Sun Jun 19 11:45:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % symbols: 7
% 0.13/0.35 % clauses: 9
% 0.13/0.35 % start clauses: 2
% 0.13/0.35 % iterative deepening steps: 48
% 0.13/0.35 % maximum path limit: 2
% 0.13/0.35 % literal attempts: 2798
% 0.13/0.35 % depth failures: 1743
% 0.13/0.35 % regularity failures: 67
% 0.13/0.35 % tautology failures: 252
% 0.13/0.35 % reductions: 525
% 0.13/0.35 % extensions: 2186
% 0.13/0.35 % SAT variables: 964
% 0.13/0.35 % SAT clauses: 1088
% 0.13/0.35 % WalkSAT solutions: 1080
% 0.13/0.35 % CDCL solutions: 0
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------