%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL442-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:12:46 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 46 ( 7 unt; 6 nHn; 30 RR)
% Number of literals : 92 ( 0 equ; 48 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 68 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Ofalse__imp_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ofalse__imp_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_PropLog_Oweaken__left__Un2_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__Un2_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_PropLog_Oweaken__left__Un1_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X2,X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__Un1_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_PropLog_Oweaken__right_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_9,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_9) ).
cnf(cls_PropLog_Oimp__false_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oimp__false_0) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_12,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Ofalse__imp_0]) ).
cnf(c_0_13,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_14,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__Un2_0]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_16,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X2,X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__Un1_0]) ).
cnf(c_0_17,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
cls_conjecture_1 ).
cnf(c_0_19,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
c_0_13 ).
cnf(c_0_20,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__right_0]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_23,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
c_0_15 ).
cnf(c_0_25,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_union(X2,X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
c_0_16 ).
cnf(c_0_26,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,X1,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
c_0_22 ).
cnf(c_0_30,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oimp__false_0]) ).
cnf(c_0_31,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
c_0_23 ).
cnf(c_0_32,negated_conjecture,
c_PropLog_Oeval(v_tt,v_pl1,t_a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ c_PropLog_Oeval(v_tt,v_pl2,t_a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
( c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
cls_conjecture_3 ).
cnf(c_0_36,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ c_in(X1,c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),X4,X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,X1,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_40,negated_conjecture,
( ~ c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,X1,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),
inference(sr,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
~ c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_32])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL442-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n002.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 00:35:16 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 2071639 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHNF-FFMF32-MFFFFFNN
% 0.14/0.44 % partial match(1): FGHNF-FFMF32-SFFFFFNN
% 0.14/0.44 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 2071642 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FGHNF-FFMF32-MFFFFFNN
% 0.14/0.44 % partial match(1): FGHNF-FFMF32-SFFFFFNN
% 0.14/0.44 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 12
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 12
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 12
% 0.14/0.44 % Processed clauses : 51
% 0.14/0.44 % ...of these trivial : 0
% 0.14/0.44 % ...subsumed : 15
% 0.14/0.44 % ...remaining for further processing : 36
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 7
% 0.14/0.44 % Backward-rewritten : 7
% 0.14/0.44 % Generated clauses : 52
% 0.14/0.44 % ...of the previous two non-redundant : 51
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 2
% 0.14/0.44 % Paramodulations : 51
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 14
% 0.14/0.44 % ...of those cached : 10
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 21
% 0.14/0.44 % Positive orientable unit clauses : 3
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 10
% 0.14/0.44 % Non-unit-clauses : 8
% 0.14/0.44 % Current number of unprocessed clauses: 5
% 0.14/0.44 % ...number of literals in the above : 9
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 15
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 105
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 99
% 0.14/0.44 % Non-unit clause-clause subsumptions : 11
% 0.14/0.44 % Unit Clause-clause subsumption calls : 19
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 1
% 0.14/0.44 % BW rewrite match successes : 1
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 1358
% 0.14/0.44 % Search garbage collected termcells : 24
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.005 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.007 s
% 0.14/0.44 % Maximum resident set size: 3644 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.007 s
% 0.14/0.44 % System time : 0.006 s
% 0.14/0.44 % Total time : 0.013 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------