TSTP Solution File: SET082+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET082+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:40 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ member(sK7,universal_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class)]) ).
cnf(g1,plain,
~ sPE(singleton(sK7),null_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class)]) ).
cnf(g2,plain,
( ~ member(sK7,unordered_pair(sK7,sK7))
| member(sK7,universal_class) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g3,plain,
( ~ sPE(singleton(sK7),unordered_pair(sK7,sK7))
| ~ sPE(unordered_pair(sK7,sK7),null_class)
| sPE(singleton(sK7),null_class) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(singleton(sK7),unordered_pair(sK7,sK7)),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',singleton_set_defn)]) ).
cnf(g5,plain,
( sPE(unordered_pair(sK7,sK7),null_class)
| member(sK5(unordered_pair(sK7,sK7)),unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',regularity)]) ).
cnf(g6,plain,
sPE(sK7,sK7),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(sK7,sK7)
| ~ sPE(sK7,sK7)
| sPE(unordered_pair(sK7,sK7),unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(sK5(unordered_pair(sK7,sK7)),sK7)
| ~ sPE(unordered_pair(sK7,sK7),unordered_pair(sK7,sK7))
| ~ member(sK5(unordered_pair(sK7,sK7)),unordered_pair(sK7,sK7))
| member(sK7,unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ member(sK5(unordered_pair(sK7,sK7)),unordered_pair(sK7,sK7))
| sPE(sK5(unordered_pair(sK7,sK7)),sK7)
| sPE(sK5(unordered_pair(sK7,sK7)),sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET082+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n019.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 : Sat Jul 9 22:17:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 % symbols: 41
% 0.19/0.37 % clauses: 125
% 0.19/0.37 % start clauses: 2
% 0.19/0.37 % iterative deepening steps: 96
% 0.19/0.37 % maximum path limit: 3
% 0.19/0.37 % literal attempts: 43122
% 0.19/0.37 % depth failures: 35384
% 0.19/0.37 % regularity failures: 3181
% 0.19/0.37 % tautology failures: 1076
% 0.19/0.37 % reductions: 1020
% 0.19/0.37 % extensions: 42003
% 0.19/0.37 % SAT variables: 14641
% 0.19/0.37 % SAT clauses: 16164
% 0.19/0.37 % WalkSAT solutions: 16167
% 0.19/0.37 % CDCL solutions: 0
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------