TSTP Solution File: SET084+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET084+1 : TPTP v8.1.0. Bugfixed v5.4.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 04:58:43 EDT 2022
% Result : Theorem 1.75s 0.59s
% Output : Proof 1.75s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(singleton(sK7),singleton(sK8)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_identified_by_element2)]) ).
cnf(g1,plain,
member(sK8,universal_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_identified_by_element2)]) ).
cnf(g2,plain,
~ sPE(sK7,sK8),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_identified_by_element2)]) ).
cnf(g3,plain,
( ~ sPE(singleton(sK7),singleton(sK8))
| subclass(singleton(sK8),singleton(sK7)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',extensionality)]) ).
cnf(g4,plain,
( ~ sPE(sK8,sK8)
| ~ member(sK8,universal_class)
| member(sK8,unordered_pair(sK8,sK8)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g5,plain,
( ~ sPE(sK8,sK7)
| sPE(sK7,sK8) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(singleton(sK8),unordered_pair(sK8,sK8)),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',singleton_set_defn)]) ).
cnf(g7,plain,
( ~ sPE(singleton(sK8),unordered_pair(sK8,sK8))
| ~ sPE(singleton(sK7),singleton(sK8))
| ~ subclass(singleton(sK8),singleton(sK7))
| subclass(unordered_pair(sK8,sK8),singleton(sK8)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ subclass(unordered_pair(sK8,sK8),singleton(sK8))
| ~ member(sK8,unordered_pair(sK8,sK8))
| member(sK8,singleton(sK8)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).
cnf(g9,plain,
sPE(sK8,sK8),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ member(sK8,unordered_pair(sK7,sK7))
| sPE(sK8,sK7)
| sPE(sK8,sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g11,plain,
( ~ sPE(unordered_pair(sK7,sK7),singleton(sK7))
| ~ sPE(singleton(sK7),singleton(sK8))
| sPE(unordered_pair(sK7,sK7),singleton(sK8)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(singleton(sK7),unordered_pair(sK7,sK7))
| sPE(unordered_pair(sK7,sK7),singleton(sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(singleton(sK7),unordered_pair(sK7,sK7)),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',singleton_set_defn)]) ).
cnf(g14,plain,
( ~ sPE(unordered_pair(sK7,sK7),singleton(sK8))
| sPE(singleton(sK8),unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(sK8,sK8)
| ~ sPE(singleton(sK8),unordered_pair(sK7,sK7))
| ~ member(sK8,singleton(sK8))
| member(sK8,unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET084+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 03:01:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/0.59 % symbols: 42
% 1.75/0.59 % clauses: 126
% 1.75/0.59 % start clauses: 3
% 1.75/0.59 % iterative deepening steps: 223
% 1.75/0.59 % maximum path limit: 3
% 1.75/0.59 % literal attempts: 486574
% 1.75/0.59 % depth failures: 440191
% 1.75/0.59 % regularity failures: 3418
% 1.75/0.59 % tautology failures: 2835
% 1.75/0.59 % reductions: 26822
% 1.75/0.59 % extensions: 459373
% 1.75/0.59 % SAT variables: 75617
% 1.75/0.59 % SAT clauses: 69845
% 1.75/0.59 % WalkSAT solutions: 69841
% 1.75/0.59 % CDCL solutions: 3
% 1.75/0.59 % SZS status Theorem for theBenchmark
% 1.75/0.59 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------