TSTP Solution File: LCL544+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL544+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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 : Tue Apr 30 20:27:25 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL544+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 29 20:28:10 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.20/0.51 % Refutation found
% 0.20/0.51 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.51 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.51 fof(f1,axiom,(
% 0.20/0.51 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f5,axiom,(
% 0.20/0.51 ( implies_2<=> (! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f9,axiom,(
% 0.20/0.51 ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f35,axiom,(
% 0.20/0.51 modus_ponens ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f38,axiom,(
% 0.20/0.51 implies_2 ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f42,axiom,(
% 0.20/0.51 and_3 ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f50,axiom,(
% 0.20/0.51 ( necessitation<=> (! [X] :( is_a_theorem(X)=> is_a_theorem(necessarily(X)) ) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f66,axiom,(
% 0.20/0.51 ( axiom_m4<=> (! [X] : is_a_theorem(strict_implies(X,and(X,X))) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f75,axiom,(
% 0.20/0.51 ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f78,axiom,(
% 0.20/0.51 necessitation ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f86,axiom,(
% 0.20/0.51 op_strict_implies ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f89,conjecture,(
% 0.20/0.51 axiom_m4 ),
% 0.20/0.51 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.51 fof(f90,negated_conjecture,(
% 0.20/0.51 ~(axiom_m4 )),
% 0.20/0.51 inference(negated_conjecture,[status(cth)],[f89])).
% 0.20/0.51 fof(f91,plain,(
% 0.20/0.51 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.20/0.51 inference(pre_NNF_transformation,[status(esa)],[f1])).
% 0.20/0.51 fof(f92,plain,(
% 0.20/0.51 (~modus_ponens|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y))))&(modus_ponens|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))),
% 0.20/0.51 inference(NNF_transformation,[status(esa)],[f91])).
% 0.20/0.51 fof(f93,plain,(
% 0.20/0.51 (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|(?[Y]: ((?[X]: (is_a_theorem(X)&is_a_theorem(implies(X,Y))))&~is_a_theorem(Y))))),
% 0.20/0.51 inference(miniscoping,[status(esa)],[f92])).
% 0.20/0.51 fof(f94,plain,(
% 0.20/0.51 (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|((is_a_theorem(sk0_1)&is_a_theorem(implies(sk0_1,sk0_0)))&~is_a_theorem(sk0_0)))),
% 0.20/0.51 inference(skolemization,[status(esa)],[f93])).
% 0.20/0.51 fof(f95,plain,(
% 0.20/0.51 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f94])).
% 0.20/0.51 fof(f113,plain,(
% 0.20/0.51 (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|(?[X,Y]: ~is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))),
% 0.20/0.51 inference(NNF_transformation,[status(esa)],[f5])).
% 0.20/0.51 fof(f114,plain,(
% 0.20/0.51 (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|~is_a_theorem(implies(implies(sk0_8,implies(sk0_8,sk0_9)),implies(sk0_8,sk0_9))))),
% 0.20/0.51 inference(skolemization,[status(esa)],[f113])).
% 0.20/0.51 fof(f115,plain,(
% 0.20/0.51 ![X0,X1]: (~implies_2|is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f114])).
% 0.20/0.51 fof(f129,plain,(
% 0.20/0.51 (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|(?[X,Y]: ~is_a_theorem(implies(X,implies(Y,and(X,Y))))))),
% 0.20/0.51 inference(NNF_transformation,[status(esa)],[f9])).
% 0.20/0.51 fof(f130,plain,(
% 0.20/0.51 (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|~is_a_theorem(implies(sk0_17,implies(sk0_18,and(sk0_17,sk0_18)))))),
% 0.20/0.51 inference(skolemization,[status(esa)],[f129])).
% 0.20/0.51 fof(f131,plain,(
% 0.20/0.51 ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f130])).
% 0.20/0.51 fof(f214,plain,(
% 0.20/0.51 modus_ponens),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f35])).
% 0.20/0.51 fof(f217,plain,(
% 0.20/0.51 implies_2),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f38])).
% 0.20/0.51 fof(f221,plain,(
% 0.20/0.51 and_3),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f42])).
% 0.20/0.51 fof(f229,plain,(
% 0.20/0.51 necessitation<=>(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X))))),
% 0.20/0.51 inference(pre_NNF_transformation,[status(esa)],[f50])).
% 0.20/0.51 fof(f230,plain,(
% 0.20/0.51 (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(?[X]: (is_a_theorem(X)&~is_a_theorem(necessarily(X)))))),
% 0.20/0.51 inference(NNF_transformation,[status(esa)],[f229])).
% 0.20/0.51 fof(f231,plain,(
% 0.20/0.51 (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(is_a_theorem(sk0_55)&~is_a_theorem(necessarily(sk0_55))))),
% 0.20/0.51 inference(skolemization,[status(esa)],[f230])).
% 0.20/0.51 fof(f232,plain,(
% 0.20/0.51 ![X0]: (~necessitation|~is_a_theorem(X0)|is_a_theorem(necessarily(X0)))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f231])).
% 0.20/0.51 fof(f304,plain,(
% 0.20/0.51 (~axiom_m4|(![X]: is_a_theorem(strict_implies(X,and(X,X)))))&(axiom_m4|(?[X]: ~is_a_theorem(strict_implies(X,and(X,X)))))),
% 0.20/0.51 inference(NNF_transformation,[status(esa)],[f66])).
% 0.20/0.51 fof(f305,plain,(
% 0.20/0.51 (~axiom_m4|(![X]: is_a_theorem(strict_implies(X,and(X,X)))))&(axiom_m4|~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83))))),
% 0.20/0.51 inference(skolemization,[status(esa)],[f304])).
% 0.20/0.51 fof(f307,plain,(
% 0.20/0.51 axiom_m4|~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f305])).
% 0.20/0.51 fof(f336,plain,(
% 0.20/0.51 ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 0.20/0.51 inference(pre_NNF_transformation,[status(esa)],[f75])).
% 0.20/0.51 fof(f337,plain,(
% 0.20/0.51 ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f336])).
% 0.20/0.51 fof(f341,plain,(
% 0.20/0.51 necessitation),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f78])).
% 0.20/0.51 fof(f349,plain,(
% 0.20/0.51 op_strict_implies),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f86])).
% 0.20/0.51 fof(f352,plain,(
% 0.20/0.51 ~axiom_m4),
% 0.20/0.51 inference(cnf_transformation,[status(esa)],[f90])).
% 0.20/0.51 fof(f353,plain,(
% 0.20/0.51 spl0_0 <=> modus_ponens),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f355,plain,(
% 0.20/0.51 ~modus_ponens|spl0_0),
% 0.20/0.51 inference(component_clause,[status(thm)],[f353])).
% 0.20/0.51 fof(f356,plain,(
% 0.20/0.51 spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f357,plain,(
% 0.20/0.51 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 0.20/0.51 inference(component_clause,[status(thm)],[f356])).
% 0.20/0.51 fof(f359,plain,(
% 0.20/0.51 ~spl0_0|spl0_1),
% 0.20/0.51 inference(split_clause,[status(thm)],[f95,f353,f356])).
% 0.20/0.51 fof(f409,plain,(
% 0.20/0.51 spl0_15 <=> implies_2),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f411,plain,(
% 0.20/0.51 ~implies_2|spl0_15),
% 0.20/0.51 inference(component_clause,[status(thm)],[f409])).
% 0.20/0.51 fof(f412,plain,(
% 0.20/0.51 spl0_16 <=> is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f413,plain,(
% 0.20/0.51 ![X0,X1]: (is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))|~spl0_16)),
% 0.20/0.51 inference(component_clause,[status(thm)],[f412])).
% 0.20/0.51 fof(f415,plain,(
% 0.20/0.51 ~spl0_15|spl0_16),
% 0.20/0.51 inference(split_clause,[status(thm)],[f115,f409,f412])).
% 0.20/0.51 fof(f453,plain,(
% 0.20/0.51 spl0_27 <=> and_3),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f455,plain,(
% 0.20/0.51 ~and_3|spl0_27),
% 0.20/0.51 inference(component_clause,[status(thm)],[f453])).
% 0.20/0.51 fof(f456,plain,(
% 0.20/0.51 spl0_28 <=> is_a_theorem(implies(X0,implies(X1,and(X0,X1))))),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f457,plain,(
% 0.20/0.51 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1))))|~spl0_28)),
% 0.20/0.51 inference(component_clause,[status(thm)],[f456])).
% 0.20/0.51 fof(f459,plain,(
% 0.20/0.51 ~spl0_27|spl0_28),
% 0.20/0.51 inference(split_clause,[status(thm)],[f131,f453,f456])).
% 0.20/0.51 fof(f533,plain,(
% 0.20/0.51 spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.51 fof(f534,plain,(
% 0.20/0.51 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 0.20/0.51 inference(component_clause,[status(thm)],[f533])).
% 0.20/0.51 fof(f677,plain,(
% 0.20/0.51 spl0_88 <=> necessitation),
% 0.20/0.51 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f679,plain,(
% 0.20/0.52 ~necessitation|spl0_88),
% 0.20/0.52 inference(component_clause,[status(thm)],[f677])).
% 0.20/0.52 fof(f680,plain,(
% 0.20/0.52 spl0_89 <=> ~is_a_theorem(X0)|is_a_theorem(necessarily(X0))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f681,plain,(
% 0.20/0.52 ![X0]: (~is_a_theorem(X0)|is_a_theorem(necessarily(X0))|~spl0_89)),
% 0.20/0.52 inference(component_clause,[status(thm)],[f680])).
% 0.20/0.52 fof(f683,plain,(
% 0.20/0.52 ~spl0_88|spl0_89),
% 0.20/0.52 inference(split_clause,[status(thm)],[f232,f677,f680])).
% 0.20/0.52 fof(f877,plain,(
% 0.20/0.52 spl0_142 <=> axiom_m4),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f878,plain,(
% 0.20/0.52 axiom_m4|~spl0_142),
% 0.20/0.52 inference(component_clause,[status(thm)],[f877])).
% 0.20/0.52 fof(f884,plain,(
% 0.20/0.52 spl0_144 <=> is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f886,plain,(
% 0.20/0.52 ~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))|spl0_144),
% 0.20/0.52 inference(component_clause,[status(thm)],[f884])).
% 0.20/0.52 fof(f887,plain,(
% 0.20/0.52 spl0_142|~spl0_144),
% 0.20/0.52 inference(split_clause,[status(thm)],[f307,f877,f884])).
% 0.20/0.52 fof(f968,plain,(
% 0.20/0.52 spl0_167 <=> op_strict_implies),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f970,plain,(
% 0.20/0.52 ~op_strict_implies|spl0_167),
% 0.20/0.52 inference(component_clause,[status(thm)],[f968])).
% 0.20/0.52 fof(f971,plain,(
% 0.20/0.52 spl0_168 <=> strict_implies(X0,X1)=necessarily(implies(X0,X1))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f972,plain,(
% 0.20/0.52 ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1))|~spl0_168)),
% 0.20/0.52 inference(component_clause,[status(thm)],[f971])).
% 0.20/0.52 fof(f974,plain,(
% 0.20/0.52 ~spl0_167|spl0_168),
% 0.20/0.52 inference(split_clause,[status(thm)],[f337,f968,f971])).
% 0.20/0.52 fof(f984,plain,(
% 0.20/0.52 $false|spl0_0),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f355,f214])).
% 0.20/0.52 fof(f985,plain,(
% 0.20/0.52 spl0_0),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f984])).
% 0.20/0.52 fof(f986,plain,(
% 0.20/0.52 $false|spl0_88),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f679,f341])).
% 0.20/0.52 fof(f987,plain,(
% 0.20/0.52 spl0_88),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f986])).
% 0.20/0.52 fof(f992,plain,(
% 0.20/0.52 $false|spl0_167),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f970,f349])).
% 0.20/0.52 fof(f993,plain,(
% 0.20/0.52 spl0_167),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f992])).
% 0.20/0.52 fof(f1009,plain,(
% 0.20/0.52 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(strict_implies(X0,X1))|~spl0_89|~spl0_168)),
% 0.20/0.52 inference(paramodulation,[status(thm)],[f972,f681])).
% 0.20/0.52 fof(f1137,plain,(
% 0.20/0.52 ~is_a_theorem(implies(sk0_83,and(sk0_83,sk0_83)))|~spl0_89|~spl0_168|spl0_144),
% 0.20/0.52 inference(resolution,[status(thm)],[f1009,f886])).
% 0.20/0.52 fof(f1384,plain,(
% 0.20/0.52 $false|spl0_27),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f455,f221])).
% 0.20/0.52 fof(f1385,plain,(
% 0.20/0.52 spl0_27),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f1384])).
% 0.20/0.52 fof(f1418,plain,(
% 0.20/0.52 ![X0,X1]: (~is_a_theorem(implies(X0,implies(X0,X1)))|is_a_theorem(implies(X0,X1))|~spl0_1|~spl0_16)),
% 0.20/0.52 inference(resolution,[status(thm)],[f357,f413])).
% 0.20/0.52 fof(f1675,plain,(
% 0.20/0.52 $false|spl0_15),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f411,f217])).
% 0.20/0.52 fof(f1676,plain,(
% 0.20/0.52 spl0_15),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f1675])).
% 0.20/0.52 fof(f2617,plain,(
% 0.20/0.52 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_1|~spl0_16|~spl0_28)),
% 0.20/0.52 inference(resolution,[status(thm)],[f1418,f457])).
% 0.20/0.52 fof(f2618,plain,(
% 0.20/0.52 spl0_49|~spl0_1|~spl0_16|~spl0_28),
% 0.20/0.52 inference(split_clause,[status(thm)],[f2617,f533,f356,f412,f456])).
% 0.20/0.52 fof(f2634,plain,(
% 0.20/0.52 $false|~spl0_49|~spl0_89|~spl0_168|spl0_144),
% 0.20/0.52 inference(backward_subsumption_resolution,[status(thm)],[f1137,f534])).
% 0.20/0.52 fof(f2635,plain,(
% 0.20/0.52 ~spl0_49|~spl0_89|~spl0_168|spl0_144),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f2634])).
% 0.20/0.52 fof(f2640,plain,(
% 0.20/0.52 $false|~spl0_142),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f878,f352])).
% 0.20/0.52 fof(f2641,plain,(
% 0.20/0.52 ~spl0_142),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f2640])).
% 0.20/0.52 fof(f2642,plain,(
% 0.20/0.52 $false),
% 0.20/0.52 inference(sat_refutation,[status(thm)],[f359,f415,f459,f683,f887,f974,f985,f987,f993,f1385,f1676,f2618,f2635,f2641])).
% 0.20/0.52 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.53 % Elapsed time: 0.177045 seconds
% 0.20/0.53 % CPU time: 1.289353 seconds
% 0.20/0.53 % Total memory used: 81.569 MB
% 0.20/0.53 % Net memory used: 80.400 MB
%------------------------------------------------------------------------------