TSTP Solution File: MGT013-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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 : 300s
% DateTime : Wed May 31 12:21:08 EDT 2023
% Result : Unsatisfiable 0.10s 0.32s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 11:11:23 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.10/0.32 % Drodi V3.5.1
% 0.10/0.32 % Refutation found
% 0.10/0.32 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.32 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.32 fof(f1,axiom,(
% 0.10/0.32 (![A,B]: (( ~ greater(A,B)| A != B ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f3,axiom,(
% 0.10/0.32 (![A,B]: (( ~ organization(A,B)| time(B) ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f4,axiom,(
% 0.10/0.32 (![A,B]: (( ~ time(A)| ~ time(B)| greater(A,B)| A = B| greater(B,A) ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f5,axiom,(
% 0.10/0.32 (![A,B,C]: (( ~ reorganization_free(A,B,C)| reorganization_free(A,C,B) ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f6,axiom,(
% 0.10/0.32 (![A,B,C,D,E]: (( ~ organization(A,B)| ~ organization(A,C)| ~ complexity(A,D,B)| ~ complexity(A,E,C)| B != C| D = E ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f7,hypothesis,(
% 0.10/0.32 (![A,B,C,D,E]: (( ~ organization(A,B)| ~ organization(A,C)| ~ reorganization_free(A,B,C)| ~ size(A,D,B)| ~ size(A,E,C)| ~ greater(C,B)| ~ greater(D,E) ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f8,hypothesis,(
% 0.10/0.32 (![A,B,C,D,E]: (( ~ organization(A,B)| ~ organization(A,C)| ~ reorganization_free(A,B,C)| ~ complexity(A,D,B)| ~ complexity(A,E,C)| ~ greater(C,B)| ~ greater(D,E) ) ))),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f9,negated_conjecture,(
% 0.10/0.32 organization(sk1,sk6) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f10,negated_conjecture,(
% 0.10/0.32 organization(sk1,sk7) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f11,negated_conjecture,(
% 0.10/0.32 reorganization_free(sk1,sk6,sk7) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f12,negated_conjecture,(
% 0.10/0.32 complexity(sk1,sk2,sk6) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f13,negated_conjecture,(
% 0.10/0.32 complexity(sk1,sk3,sk7) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f14,negated_conjecture,(
% 0.10/0.32 size(sk1,sk4,sk6) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f15,negated_conjecture,(
% 0.10/0.32 size(sk1,sk5,sk7) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f16,negated_conjecture,(
% 0.10/0.32 greater(sk3,sk2) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f17,negated_conjecture,(
% 0.10/0.32 greater(sk4,sk5) ),
% 0.10/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.32 fof(f18,plain,(
% 0.10/0.32 ![X0,X1]: (~greater(X0,X1)|~X0=X1)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f1])).
% 0.10/0.32 fof(f20,plain,(
% 0.10/0.32 ![B]: ((![A]: ~organization(A,B))|time(B))),
% 0.10/0.32 inference(miniscoping,[status(esa)],[f3])).
% 0.10/0.32 fof(f21,plain,(
% 0.10/0.32 ![X0,X1]: (~organization(X0,X1)|time(X1))),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f20])).
% 0.10/0.32 fof(f22,plain,(
% 0.10/0.32 ![X0,X1]: (~time(X0)|~time(X1)|greater(X0,X1)|X0=X1|greater(X1,X0))),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.32 fof(f23,plain,(
% 0.10/0.32 ![X0,X1,X2]: (~reorganization_free(X0,X1,X2)|reorganization_free(X0,X2,X1))),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f5])).
% 0.10/0.32 fof(f24,plain,(
% 0.10/0.32 ![D,E]: ((![B,C]: ((![A]: (((~organization(A,B)|~organization(A,C))|~complexity(A,D,B))|~complexity(A,E,C)))|~B=C))|D=E)),
% 0.10/0.32 inference(miniscoping,[status(esa)],[f6])).
% 0.10/0.32 fof(f25,plain,(
% 0.10/0.32 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~complexity(X0,X3,X1)|~complexity(X0,X4,X2)|~X1=X2|X3=X4)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f24])).
% 0.10/0.32 fof(f26,plain,(
% 0.10/0.32 ![D,E]: ((![B,C]: ((![A]: ((((~organization(A,B)|~organization(A,C))|~reorganization_free(A,B,C))|~size(A,D,B))|~size(A,E,C)))|~greater(C,B)))|~greater(D,E))),
% 0.10/0.32 inference(miniscoping,[status(esa)],[f7])).
% 0.10/0.32 fof(f27,plain,(
% 0.10/0.32 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~reorganization_free(X0,X1,X2)|~size(X0,X3,X1)|~size(X0,X4,X2)|~greater(X2,X1)|~greater(X3,X4))),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f26])).
% 0.10/0.32 fof(f28,plain,(
% 0.10/0.32 ![D,E]: ((![B,C]: ((![A]: ((((~organization(A,B)|~organization(A,C))|~reorganization_free(A,B,C))|~complexity(A,D,B))|~complexity(A,E,C)))|~greater(C,B)))|~greater(D,E))),
% 0.10/0.32 inference(miniscoping,[status(esa)],[f8])).
% 0.10/0.32 fof(f29,plain,(
% 0.10/0.32 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~organization(X0,X2)|~reorganization_free(X0,X1,X2)|~complexity(X0,X3,X1)|~complexity(X0,X4,X2)|~greater(X2,X1)|~greater(X3,X4))),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f28])).
% 0.10/0.32 fof(f30,plain,(
% 0.10/0.32 organization(sk1,sk6)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f9])).
% 0.10/0.32 fof(f31,plain,(
% 0.10/0.32 organization(sk1,sk7)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f10])).
% 0.10/0.32 fof(f32,plain,(
% 0.10/0.32 reorganization_free(sk1,sk6,sk7)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.32 fof(f33,plain,(
% 0.10/0.32 complexity(sk1,sk2,sk6)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f12])).
% 0.10/0.32 fof(f34,plain,(
% 0.10/0.32 complexity(sk1,sk3,sk7)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f13])).
% 0.10/0.32 fof(f35,plain,(
% 0.10/0.32 size(sk1,sk4,sk6)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f14])).
% 0.10/0.32 fof(f36,plain,(
% 0.10/0.32 size(sk1,sk5,sk7)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f15])).
% 0.10/0.32 fof(f37,plain,(
% 0.10/0.32 greater(sk3,sk2)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f16])).
% 0.10/0.32 fof(f38,plain,(
% 0.10/0.32 greater(sk4,sk5)),
% 0.10/0.32 inference(cnf_transformation,[status(esa)],[f17])).
% 0.10/0.32 fof(f39,plain,(
% 0.10/0.32 ![X0]: (~greater(X0,X0))),
% 0.10/0.32 inference(destructive_equality_resolution,[status(esa)],[f18])).
% 0.10/0.32 fof(f40,plain,(
% 0.10/0.32 ![X0,X2,X3,X4]: (~organization(X0,X2)|~organization(X0,X2)|~complexity(X0,X3,X2)|~complexity(X0,X4,X2)|X3=X4)),
% 0.10/0.32 inference(destructive_equality_resolution,[status(esa)],[f25])).
% 0.10/0.32 fof(f41,plain,(
% 0.10/0.32 ![X0,X1,X2,X3]: (~organization(X0,X1)|~complexity(X0,X2,X1)|~complexity(X0,X3,X1)|X2=X3)),
% 0.10/0.32 inference(duplicate_literals_removal,[status(esa)],[f40])).
% 0.10/0.32 fof(f45,plain,(
% 0.10/0.32 ![X0,X1]: (~complexity(sk1,X0,sk6)|~complexity(sk1,X1,sk6)|X0=X1)),
% 0.10/0.32 inference(resolution,[status(thm)],[f41,f30])).
% 0.10/0.32 fof(f47,plain,(
% 0.10/0.32 ![X0,X1,X2]: (~organization(sk1,X0)|~reorganization_free(sk1,X0,sk7)|~size(sk1,X1,X0)|~size(sk1,X2,sk7)|~greater(sk7,X0)|~greater(X1,X2))),
% 0.10/0.32 inference(resolution,[status(thm)],[f27,f31])).
% 0.10/0.32 fof(f50,plain,(
% 0.10/0.32 ![X0,X1,X2]: (~organization(sk1,X0)|~reorganization_free(sk1,X0,sk6)|~complexity(sk1,X1,X0)|~complexity(sk1,X2,sk6)|~greater(sk6,X0)|~greater(X1,X2))),
% 0.10/0.32 inference(resolution,[status(thm)],[f29,f30])).
% 0.10/0.32 fof(f51,plain,(
% 0.10/0.32 time(sk7)),
% 0.10/0.32 inference(resolution,[status(thm)],[f21,f31])).
% 0.10/0.32 fof(f52,plain,(
% 0.10/0.32 time(sk6)),
% 0.10/0.32 inference(resolution,[status(thm)],[f21,f30])).
% 0.10/0.32 fof(f53,plain,(
% 0.10/0.32 ![X0]: (~time(X0)|greater(X0,sk6)|X0=sk6|greater(sk6,X0))),
% 0.10/0.32 inference(resolution,[status(thm)],[f22,f52])).
% 0.10/0.32 fof(f55,plain,(
% 0.10/0.32 ![X0]: (~complexity(sk1,X0,sk6)|X0=sk2)),
% 0.10/0.32 inference(resolution,[status(thm)],[f45,f33])).
% 0.10/0.32 fof(f64,plain,(
% 0.10/0.32 spl0_2 <=> greater(sk7,sk6)),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f65,plain,(
% 0.10/0.32 greater(sk7,sk6)|~spl0_2),
% 0.10/0.32 inference(component_clause,[status(thm)],[f64])).
% 0.10/0.32 fof(f67,plain,(
% 0.10/0.32 spl0_3 <=> sk7=sk6),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f68,plain,(
% 0.10/0.32 sk7=sk6|~spl0_3),
% 0.10/0.32 inference(component_clause,[status(thm)],[f67])).
% 0.10/0.32 fof(f70,plain,(
% 0.10/0.32 spl0_4 <=> greater(sk6,sk7)),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f71,plain,(
% 0.10/0.32 greater(sk6,sk7)|~spl0_4),
% 0.10/0.32 inference(component_clause,[status(thm)],[f70])).
% 0.10/0.32 fof(f73,plain,(
% 0.10/0.32 greater(sk7,sk6)|sk7=sk6|greater(sk6,sk7)),
% 0.10/0.32 inference(resolution,[status(thm)],[f53,f51])).
% 0.10/0.32 fof(f74,plain,(
% 0.10/0.32 spl0_2|spl0_3|spl0_4),
% 0.10/0.32 inference(split_clause,[status(thm)],[f73,f64,f67,f70])).
% 0.10/0.32 fof(f89,plain,(
% 0.10/0.32 spl0_7 <=> organization(sk1,sk7)),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f91,plain,(
% 0.10/0.32 ~organization(sk1,sk7)|spl0_7),
% 0.10/0.32 inference(component_clause,[status(thm)],[f89])).
% 0.10/0.32 fof(f92,plain,(
% 0.10/0.32 spl0_8 <=> reorganization_free(sk1,sk7,sk6)),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f94,plain,(
% 0.10/0.32 ~reorganization_free(sk1,sk7,sk6)|spl0_8),
% 0.10/0.32 inference(component_clause,[status(thm)],[f92])).
% 0.10/0.32 fof(f95,plain,(
% 0.10/0.32 spl0_9 <=> ~complexity(sk1,X0,sk7)|~complexity(sk1,X1,sk6)|~greater(X0,X1)),
% 0.10/0.32 introduced(split_symbol_definition)).
% 0.10/0.32 fof(f96,plain,(
% 0.10/0.32 ![X0,X1]: (~complexity(sk1,X0,sk7)|~complexity(sk1,X1,sk6)|~greater(X0,X1)|~spl0_9)),
% 0.10/0.32 inference(component_clause,[status(thm)],[f95])).
% 0.10/0.32 fof(f98,plain,(
% 0.10/0.32 ![X0,X1]: (~organization(sk1,sk7)|~reorganization_free(sk1,sk7,sk6)|~complexity(sk1,X0,sk7)|~complexity(sk1,X1,sk6)|~greater(X0,X1)|~spl0_4)),
% 0.15/0.54 inference(resolution,[status(thm)],[f71,f50])).
% 0.15/0.54 fof(f99,plain,(
% 0.15/0.54 ~spl0_7|~spl0_8|spl0_9|~spl0_4),
% 0.15/0.54 inference(split_clause,[status(thm)],[f98,f89,f92,f95,f70])).
% 0.15/0.54 fof(f106,plain,(
% 0.15/0.54 $false|spl0_7),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f91,f31])).
% 0.15/0.54 fof(f107,plain,(
% 0.15/0.54 spl0_7),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f106])).
% 0.15/0.54 fof(f122,plain,(
% 0.15/0.54 complexity(sk1,sk3,sk6)|~spl0_3),
% 0.15/0.54 inference(backward_demodulation,[status(thm)],[f68,f34])).
% 0.15/0.54 fof(f125,plain,(
% 0.15/0.54 sk3=sk2|~spl0_3),
% 0.15/0.54 inference(resolution,[status(thm)],[f122,f55])).
% 0.15/0.54 fof(f129,plain,(
% 0.15/0.54 greater(sk2,sk2)|~spl0_3),
% 0.15/0.54 inference(backward_demodulation,[status(thm)],[f125,f37])).
% 0.15/0.54 fof(f130,plain,(
% 0.15/0.54 $false|~spl0_3),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f129,f39])).
% 0.15/0.54 fof(f131,plain,(
% 0.15/0.54 ~spl0_3),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f130])).
% 0.15/0.54 fof(f137,plain,(
% 0.15/0.54 ~reorganization_free(sk1,sk6,sk7)|spl0_8),
% 0.15/0.54 inference(resolution,[status(thm)],[f94,f23])).
% 0.15/0.54 fof(f147,plain,(
% 0.15/0.54 $false|spl0_8),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f32,f137])).
% 0.15/0.54 fof(f148,plain,(
% 0.15/0.54 spl0_8),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f147])).
% 0.15/0.54 fof(f156,plain,(
% 0.15/0.54 ![X0,X1]: (~organization(sk1,X0)|~reorganization_free(sk1,X0,sk7)|~size(sk1,X1,X0)|~greater(sk7,X0)|~greater(X1,sk5))),
% 0.15/0.54 inference(resolution,[status(thm)],[f47,f36])).
% 0.15/0.54 fof(f157,plain,(
% 0.15/0.54 spl0_11 <=> organization(sk1,sk6)),
% 0.15/0.54 introduced(split_symbol_definition)).
% 0.15/0.54 fof(f159,plain,(
% 0.15/0.54 ~organization(sk1,sk6)|spl0_11),
% 0.15/0.54 inference(component_clause,[status(thm)],[f157])).
% 0.15/0.54 fof(f160,plain,(
% 0.15/0.54 spl0_12 <=> reorganization_free(sk1,sk6,sk7)),
% 0.15/0.54 introduced(split_symbol_definition)).
% 0.15/0.54 fof(f162,plain,(
% 0.15/0.54 ~reorganization_free(sk1,sk6,sk7)|spl0_12),
% 0.15/0.54 inference(component_clause,[status(thm)],[f160])).
% 0.15/0.54 fof(f163,plain,(
% 0.15/0.54 spl0_13 <=> ~size(sk1,X0,sk6)|~greater(X0,sk5)),
% 0.15/0.54 introduced(split_symbol_definition)).
% 0.15/0.54 fof(f164,plain,(
% 0.15/0.54 ![X0]: (~size(sk1,X0,sk6)|~greater(X0,sk5)|~spl0_13)),
% 0.15/0.54 inference(component_clause,[status(thm)],[f163])).
% 0.15/0.54 fof(f166,plain,(
% 0.15/0.54 ![X0]: (~organization(sk1,sk6)|~reorganization_free(sk1,sk6,sk7)|~size(sk1,X0,sk6)|~greater(X0,sk5)|~spl0_2)),
% 0.15/0.54 inference(resolution,[status(thm)],[f156,f65])).
% 0.15/0.54 fof(f167,plain,(
% 0.15/0.54 ~spl0_11|~spl0_12|spl0_13|~spl0_2),
% 0.15/0.54 inference(split_clause,[status(thm)],[f166,f157,f160,f163,f64])).
% 0.15/0.54 fof(f168,plain,(
% 0.15/0.54 $false|spl0_12),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f162,f32])).
% 0.15/0.54 fof(f169,plain,(
% 0.15/0.54 spl0_12),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f168])).
% 0.15/0.54 fof(f170,plain,(
% 0.15/0.54 $false|spl0_11),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f159,f30])).
% 0.15/0.54 fof(f171,plain,(
% 0.15/0.54 spl0_11),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f170])).
% 0.15/0.54 fof(f172,plain,(
% 0.15/0.54 ~greater(sk4,sk5)|~spl0_13),
% 0.15/0.54 inference(resolution,[status(thm)],[f164,f35])).
% 0.15/0.54 fof(f173,plain,(
% 0.15/0.54 $false|~spl0_13),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f172,f38])).
% 0.15/0.54 fof(f174,plain,(
% 0.15/0.54 ~spl0_13),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f173])).
% 0.15/0.54 fof(f180,plain,(
% 0.15/0.54 ![X0]: (~complexity(sk1,X0,sk6)|~greater(sk3,X0)|~spl0_9)),
% 0.15/0.54 inference(resolution,[status(thm)],[f96,f34])).
% 0.15/0.54 fof(f182,plain,(
% 0.15/0.54 ~greater(sk3,sk2)|~spl0_9),
% 0.15/0.54 inference(resolution,[status(thm)],[f180,f33])).
% 0.15/0.54 fof(f183,plain,(
% 0.15/0.54 $false|~spl0_9),
% 0.15/0.54 inference(forward_subsumption_resolution,[status(thm)],[f182,f37])).
% 0.15/0.54 fof(f184,plain,(
% 0.15/0.54 ~spl0_9),
% 0.15/0.54 inference(contradiction_clause,[status(thm)],[f183])).
% 0.15/0.54 fof(f185,plain,(
% 0.15/0.54 $false),
% 0.15/0.54 inference(sat_refutation,[status(thm)],[f74,f99,f107,f131,f148,f167,f169,f171,f174,f184])).
% 0.15/0.54 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.54 % Elapsed time: 0.012559 seconds
% 0.15/0.54 % CPU time: 0.012910 seconds
% 0.15/0.54 % Memory used: 2.937 MB
%------------------------------------------------------------------------------