TSTP Solution File: SET072+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SET072+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:58:31 EDT 2022
% Result : Theorem 16.60s 2.50s
% Output : Proof 17.37s
% 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',right_cancellation)]) ).
cnf(g1,plain,
member(sK8,universal_class),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation)]) ).
cnf(g2,plain,
sPE(unordered_pair(sK7,sK9),unordered_pair(sK8,sK9)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation)]) ).
cnf(g3,plain,
~ sPE(sK7,sK8),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation)]) ).
cnf(g4,plain,
( ~ member(sK7,universal_class)
| ~ member(sK7,universal_class)
| sPE(first(ordered_pair(sK7,sK7)),sK7) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',first_second)]) ).
cnf(g5,plain,
( ~ member(sK7,universal_class)
| ~ member(sK8,universal_class)
| sPE(second(ordered_pair(sK7,sK8)),sK8) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',first_second)]) ).
cnf(g6,plain,
( ~ sPE(unordered_pair(sK7,sK9),unordered_pair(sK8,sK9))
| subclass(unordered_pair(sK7,sK9),unordered_pair(sK8,sK9)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',extensionality)]) ).
cnf(g7,plain,
( ~ sPE(sK8,sK7)
| sPE(sK7,sK8) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(first(ordered_pair(sK7,sK7)),sK7)
| sPE(sK7,first(ordered_pair(sK7,sK7))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(sK7,first(ordered_pair(sK7,sK7)))
| ~ sPE(first(ordered_pair(sK7,sK7)),sK7)
| sPE(sK7,sK7) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(universal_class,universal_class),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ subclass(unordered_pair(sK7,sK9),unordered_pair(sK8,sK9))
| ~ member(sK7,unordered_pair(sK7,sK9))
| member(sK7,unordered_pair(sK8,sK9)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',subclass_defn)]) ).
cnf(g12,plain,
( ~ sPE(sK7,sK7)
| ~ sPE(sK7,sK9)
| sPE(unordered_pair(sK7,sK7),unordered_pair(sK7,sK9)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(second(ordered_pair(sK7,sK8)),sK8)
| ~ member(second(ordered_pair(sK7,sK8)),universal_class)
| member(second(ordered_pair(sK7,sK8)),unordered_pair(sK8,sK7)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g14,plain,
( ~ sPE(second(ordered_pair(sK7,sK8)),sK8)
| sPE(sK8,second(ordered_pair(sK7,sK8))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,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(g16,plain,
sPE(sK8,sK8),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(sK7,sK7)
| ~ member(sK7,universal_class)
| member(sK7,unordered_pair(sK7,sK9)) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g18,plain,
( ~ member(sK7,unordered_pair(sK8,sK9))
| sPE(sK7,sK8)
| sPE(sK7,sK9) ),
inference(ground_cnf,[],[file('Axioms/SET005+0.ax',unordered_pair_defn)]) ).
cnf(g19,plain,
( ~ sPE(sK8,second(ordered_pair(sK7,sK8)))
| ~ sPE(universal_class,universal_class)
| ~ member(sK8,universal_class)
| member(second(ordered_pair(sK7,sK8)),universal_class) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(second(ordered_pair(sK7,sK8)),sK8)
| ~ sPE(unordered_pair(sK8,sK7),unordered_pair(sK7,sK7))
| ~ member(second(ordered_pair(sK7,sK8)),unordered_pair(sK8,sK7))
| member(sK8,unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(sK7,sK9)
| sPE(sK9,sK7) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(unordered_pair(sK7,sK9),unordered_pair(sK8,sK9))
| ~ sPE(unordered_pair(sK8,sK9),unordered_pair(sK8,sK7))
| sPE(unordered_pair(sK7,sK9),unordered_pair(sK8,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(sK8,sK8)
| ~ sPE(sK9,sK7)
| sPE(unordered_pair(sK8,sK9),unordered_pair(sK8,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(unordered_pair(sK7,sK7),unordered_pair(sK7,sK9))
| ~ sPE(unordered_pair(sK7,sK9),unordered_pair(sK8,sK7))
| sPE(unordered_pair(sK7,sK7),unordered_pair(sK8,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(unordered_pair(sK7,sK7),unordered_pair(sK8,sK7))
| sPE(unordered_pair(sK8,sK7),unordered_pair(sK7,sK7)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n009.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 01:09:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 16.60/2.50 % symbols: 43
% 16.60/2.50 % clauses: 127
% 16.60/2.50 % start clauses: 4
% 16.60/2.50 % iterative deepening steps: 1511
% 16.60/2.50 % maximum path limit: 3
% 16.60/2.50 % literal attempts: 4360945
% 16.60/2.50 % depth failures: 3862951
% 16.60/2.50 % regularity failures: 98828
% 16.60/2.50 % tautology failures: 35341
% 16.60/2.50 % reductions: 178964
% 16.60/2.50 % extensions: 4180440
% 16.60/2.50 % SAT variables: 930110
% 16.60/2.50 % SAT clauses: 901596
% 16.60/2.50 % WalkSAT solutions: 901587
% 16.60/2.50 % CDCL solutions: 8
% 16.60/2.50 % SZS status Theorem for theBenchmark
% 16.60/2.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------