%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n009.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:59:01 EDT 2022
% Result : Theorem 87.90s 11.46s
% Output : Proof 87.90s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(unordered_pair(singleton(sK7),unordered_pair(sK7,null_class)),ordered_pair(sK7,sK8)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_1_of_ordered_pair)]) ).
cnf(g1,plain,
~ member(sK8,universal_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_1_of_ordered_pair)]) ).
cnf(g2,plain,
( ~ sPE(ordered_pair(sK7,sK8),unordered_pair(singleton(sK7),unordered_pair(sK7,null_class)))
| sPE(unordered_pair(singleton(sK7),unordered_pair(sK7,null_class)),ordered_pair(sK7,sK8)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(universal_class,universal_class),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( subclass(sK7,sK7)
| member(sK0(sK7,sK7),sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).
cnf(g5,plain,
( ~ sPE(ordered_pair(sK7,sK8),unordered_pair(singleton(sK7),unordered_pair(sK7,singleton(sK8))))
| ~ sPE(unordered_pair(singleton(sK7),unordered_pair(sK7,singleton(sK8))),unordered_pair(singleton(sK7),unordered_pair(sK7,null_class)))
| sPE(ordered_pair(sK7,sK8),unordered_pair(singleton(sK7),unordered_pair(sK7,null_class))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(ordered_pair(sK7,sK8),unordered_pair(singleton(sK7),unordered_pair(sK7,singleton(sK8)))),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',ordered_pair_defn)]) ).
cnf(g7,plain,
( ~ sPE(singleton(sK7),singleton(sK7))
| ~ sPE(unordered_pair(sK7,singleton(sK8)),unordered_pair(sK7,null_class))
| sPE(unordered_pair(singleton(sK7),unordered_pair(sK7,singleton(sK8))),unordered_pair(singleton(sK7),unordered_pair(sK7,null_class))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ subclass(sK7,sK7)
| ~ subclass(sK7,sK7)
| sPE(sK7,sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',extensionality)]) ).
cnf(g9,plain,
( ~ member(sK0(sK7,sK7),sK7)
| subclass(sK7,sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).
cnf(g10,plain,
sPE(singleton(sK7),singleton(sK7)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(singleton(sK8),unordered_pair(sK8,sK8)),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',singleton_set_defn)]) ).
cnf(g12,plain,
( ~ sPE(sK7,sK7)
| ~ sPE(singleton(sK8),null_class)
| sPE(unordered_pair(sK7,singleton(sK8)),unordered_pair(sK7,null_class)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( sPE(singleton(sK8),null_class)
| member(sK5(singleton(sK8)),singleton(sK8)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',regularity)]) ).
cnf(g14,plain,
( ~ member(sK5(singleton(sK8)),unordered_pair(sK8,sK8))
| sPE(sK5(singleton(sK8)),sK8)
| sPE(sK5(singleton(sK8)),sK8) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g15,plain,
( ~ sPE(sK5(singleton(sK8)),sK5(singleton(sK8)))
| ~ sPE(singleton(sK8),unordered_pair(sK8,sK8))
| ~ member(sK5(singleton(sK8)),singleton(sK8))
| member(sK5(singleton(sK8)),unordered_pair(sK8,sK8)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
sPE(sK5(singleton(sK8)),sK5(singleton(sK8))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( sPE(singleton(sK8),null_class)
| member(sK5(singleton(sK8)),universal_class) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',regularity)]) ).
cnf(g18,plain,
( ~ sPE(sK5(singleton(sK8)),sK8)
| ~ sPE(universal_class,universal_class)
| ~ member(sK5(singleton(sK8)),universal_class)
| member(sK8,universal_class) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET103+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.13 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 Jul 10 16:57:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 87.90/11.46 % symbols: 42
% 87.90/11.46 % clauses: 125
% 87.90/11.46 % start clauses: 2
% 87.90/11.46 % iterative deepening steps: 1979
% 87.90/11.46 % maximum path limit: 4
% 87.90/11.46 % literal attempts: 6951038
% 87.90/11.46 % depth failures: 5775191
% 87.90/11.46 % regularity failures: 488120
% 87.90/11.46 % tautology failures: 61588
% 87.90/11.46 % reductions: 145812
% 87.90/11.46 % extensions: 6804111
% 87.90/11.46 % SAT variables: 639928
% 87.90/11.46 % SAT clauses: 777479
% 87.90/11.46 % WalkSAT solutions: 776724
% 87.90/11.46 % CDCL solutions: 749
% 87.90/11.46 % SZS status Theorem for theBenchmark
% 87.90/11.46 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------