TSTP Solution File: SET065+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n018.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:23 EDT 2022
% Result : Theorem 0.19s 0.35s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ member(null_class,universal_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_a_set)]) ).
cnf(g1,plain,
( ~ subclass(sK1,universal_class)
| ~ member(null_class,sK1)
| member(null_class,universal_class) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).
cnf(g2,plain,
( ~ inductive(sK1)
| member(null_class,sK1) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',inductive_defn)]) ).
cnf(g3,plain,
inductive(sK1),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',infinity)]) ).
cnf(g4,plain,
subclass(sK1,universal_class),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',class_elements_are_sets)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n018.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 : Mon Jul 11 00:03:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 % symbols: 40
% 0.19/0.35 % clauses: 124
% 0.19/0.35 % start clauses: 1
% 0.19/0.35 % iterative deepening steps: 98
% 0.19/0.35 % maximum path limit: 3
% 0.19/0.35 % literal attempts: 17830
% 0.19/0.35 % depth failures: 14655
% 0.19/0.35 % regularity failures: 1664
% 0.19/0.35 % tautology failures: 606
% 0.19/0.35 % reductions: 16
% 0.19/0.35 % extensions: 17781
% 0.19/0.35 % SAT variables: 4539
% 0.19/0.35 % SAT clauses: 4968
% 0.19/0.35 % WalkSAT solutions: 4971
% 0.19/0.35 % CDCL solutions: 0
% 0.19/0.35 % SZS status Theorem for theBenchmark
% 0.19/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------