TSTP Solution File: LAT291+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LAT291+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : Sun Jul 17 04:46:30 EDT 2022
% Result : Theorem 2.51s 126.82s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 21 unt; 0 def)
% Number of atoms : 201 ( 24 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 234 ( 88 ~; 89 |; 42 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-4 aty)
% Number of variables : 49 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_lopclset,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t37_lopclset) ).
fof(t40_filter_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& l3_lattices(X1) )
=> v3_filter_0(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+242.ax',t40_filter_0) ).
fof(t12_filter_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m1_filter_0(X2,X1)
=> ( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v14_lattices(X1)
& l3_lattices(X1) )
=> r2_hidden(k6_lattices(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+242.ax',t12_filter_0) ).
fof(t15_filter_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> m1_filter_0(u1_struct_0(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+242.ax',t15_filter_0) ).
fof(t37_lattice4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& l3_lattices(X1) )
=> k7_lattices(X1,k5_lattices(X1)) = k6_lattices(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+375.ax',t37_lattice4) ).
fof(t37_filter_0,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v3_filter_0(X1)
& l3_lattices(X1) )
=> v14_lattices(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+242.ax',t37_filter_0) ).
fof(t36_lattice4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& l3_lattices(X1) )
=> k7_lattices(X1,k6_lattices(X1)) = k5_lattices(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+375.ax',t36_lattice4) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(dt_k7_lattices,axiom,
! [X1,X2] :
( ( ~ v3_struct_0(X1)
& l3_lattices(X1)
& m1_subset_1(X2,u1_struct_0(X1)) )
=> m1_subset_1(k7_lattices(X1,X2),u1_struct_0(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+205.ax',dt_k7_lattices) ).
fof(t36_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1)) = k1_xboole_0 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t36_lopclset) ).
fof(t28_lopclset,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),X2)) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k7_lattices(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t28_lopclset) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& v17_lattices(X1)
& ~ v3_realset2(X1)
& l3_lattices(X1) )
=> k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k6_lattices(X1)) = k7_lopclset(X1) ),
inference(assume_negation,[status(cth)],[t37_lopclset]) ).
fof(c_0_13,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ v17_lattices(X2)
| ~ l3_lattices(X2)
| v3_filter_0(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t40_filter_0])])]) ).
fof(c_0_14,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& v17_lattices(esk1_0)
& ~ v3_realset2(esk1_0)
& l3_lattices(esk1_0)
& k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k6_lattices(esk1_0)) != k7_lopclset(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ l3_lattices(X3)
| ~ m1_filter_0(X4,X3)
| v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ v14_lattices(X3)
| ~ l3_lattices(X3)
| r2_hidden(k6_lattices(X3),X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t12_filter_0])])])])])]) ).
fof(c_0_16,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ l3_lattices(X2)
| m1_filter_0(u1_struct_0(X2),X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t15_filter_0])])]) ).
fof(c_0_17,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ v17_lattices(X2)
| ~ l3_lattices(X2)
| k7_lattices(X2,k5_lattices(X2)) = k6_lattices(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t37_lattice4])])]) ).
fof(c_0_18,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ v3_filter_0(X2)
| ~ l3_lattices(X2)
| v14_lattices(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t37_filter_0])])]) ).
cnf(c_0_19,plain,
( v3_filter_0(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
v17_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( r2_hidden(k6_lattices(X1),X2)
| v3_struct_0(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v14_lattices(X1)
| ~ v10_lattices(X1)
| ~ m1_filter_0(X2,X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( m1_filter_0(u1_struct_0(X1),X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( k7_lattices(X1,k5_lattices(X1)) = k6_lattices(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( v14_lattices(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v3_filter_0(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
v3_filter_0(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_29,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ v17_lattices(X2)
| ~ l3_lattices(X2)
| k7_lattices(X2,k6_lattices(X2)) = k5_lattices(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t36_lattice4])])]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_31,plain,
( v3_struct_0(X1)
| r2_hidden(k6_lattices(X1),X2)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ v14_lattices(X1)
| ~ m1_filter_0(X2,X1) ),
inference(cn,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
m1_filter_0(u1_struct_0(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_33,negated_conjecture,
k6_lattices(esk1_0) = k7_lattices(esk1_0,k5_lattices(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
v14_lattices(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_35,plain,
( k7_lattices(X1,k6_lattices(X1)) = k5_lattices(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ l3_lattices(X3)
| ~ m1_subset_1(X4,u1_struct_0(X3))
| m1_subset_1(k7_lattices(X3,X4),u1_struct_0(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k7_lattices])])]) ).
cnf(c_0_37,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
r2_hidden(k7_lattices(esk1_0,k5_lattices(esk1_0)),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_39,negated_conjecture,
k7_lattices(esk1_0,k6_lattices(esk1_0)) = k5_lattices(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_40,plain,
! [X2] :
( v3_struct_0(X2)
| ~ v10_lattices(X2)
| ~ v17_lattices(X2)
| v3_realset2(X2)
| ~ l3_lattices(X2)
| k8_funct_2(u1_struct_0(X2),k1_zfmisc_1(k7_lopclset(X2)),k9_lopclset(X2),k5_lattices(X2)) = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t36_lopclset])])]) ).
fof(c_0_41,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ v10_lattices(X3)
| ~ v17_lattices(X3)
| v3_realset2(X3)
| ~ l3_lattices(X3)
| ~ m1_subset_1(X4,u1_struct_0(X3))
| k4_xboole_0(k7_lopclset(X3),k8_funct_2(u1_struct_0(X3),k1_zfmisc_1(k7_lopclset(X3)),k9_lopclset(X3),X4)) = k8_funct_2(u1_struct_0(X3),k1_zfmisc_1(k7_lopclset(X3)),k9_lopclset(X3),k7_lattices(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t28_lopclset])])])])])]) ).
cnf(c_0_42,plain,
( m1_subset_1(k7_lattices(X1,X2),u1_struct_0(X1))
| v3_struct_0(X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l3_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
m1_subset_1(k7_lattices(esk1_0,k5_lattices(esk1_0)),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
k7_lattices(esk1_0,k7_lattices(esk1_0,k5_lattices(esk1_0))) = k5_lattices(esk1_0),
inference(rw,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_45,plain,
( k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k5_lattices(X1)) = k1_xboole_0
| v3_realset2(X1)
| v3_struct_0(X1)
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
~ v3_realset2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_47,plain,
! [X2] : k4_xboole_0(X2,k1_xboole_0) = X2,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_48,negated_conjecture,
k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k6_lattices(esk1_0)) != k7_lopclset(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_49,plain,
( k4_xboole_0(k7_lopclset(X1),k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),X2)) = k8_funct_2(u1_struct_0(X1),k1_zfmisc_1(k7_lopclset(X1)),k9_lopclset(X1),k7_lattices(X1,X2))
| v3_realset2(X1)
| v3_struct_0(X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,negated_conjecture,
m1_subset_1(k5_lattices(esk1_0),u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_22])]),c_0_23]) ).
cnf(c_0_51,negated_conjecture,
k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k5_lattices(esk1_0)) = k1_xboole_0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_20]),c_0_21]),c_0_22])]),c_0_46]),c_0_23]) ).
cnf(c_0_52,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
k8_funct_2(u1_struct_0(esk1_0),k1_zfmisc_1(k7_lopclset(esk1_0)),k9_lopclset(esk1_0),k7_lattices(esk1_0,k5_lattices(esk1_0))) != k7_lopclset(esk1_0),
inference(rw,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_20]),c_0_21]),c_0_22])]),c_0_53]),c_0_46]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT291+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 29 16:04:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.01/25.20 eprover: CPU time limit exceeded, terminating
% 2.01/25.22 eprover: CPU time limit exceeded, terminating
% 2.08/38.58 eprover: CPU time limit exceeded, terminating
% 2.08/39.03 eprover: CPU time limit exceeded, terminating
% 2.11/48.35 eprover: CPU time limit exceeded, terminating
% 2.20/71.40 eprover: CPU time limit exceeded, terminating
% 2.23/74.62 eprover: CPU time limit exceeded, terminating
% 2.31/88.87 eprover: CPU time limit exceeded, terminating
% 2.35/97.65 eprover: CPU time limit exceeded, terminating
% 2.37/101.22 eprover: CPU time limit exceeded, terminating
% 2.41/106.80 eprover: CPU time limit exceeded, terminating
% 2.48/120.70 eprover: CPU time limit exceeded, terminating
% 2.50/123.73 eprover: CPU time limit exceeded, terminating
% 2.50/124.25 eprover: CPU time limit exceeded, terminating
% 2.51/126.82 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 2.51/126.82 # Preprocessing time : 8.826 s
% 2.51/126.82
% 2.51/126.82 # Failure: Out of unprocessed clauses!
% 2.51/126.82 # OLD status GaveUp
% 2.51/126.82 # Parsed axioms : 32171
% 2.51/126.82 # Removed by relevancy pruning/SinE : 0
% 2.51/126.82 # Initial clauses : 96569
% 2.51/126.82 # Removed in clause preprocessing : 8831
% 2.51/126.82 # Initial clauses in saturation : 87738
% 2.51/126.82 # Processed clauses : 16
% 2.51/126.82 # ...of these trivial : 0
% 2.51/126.82 # ...subsumed : 2
% 2.51/126.82 # ...remaining for further processing : 14
% 2.51/126.82 # Other redundant clauses eliminated : 0
% 2.51/126.82 # Clauses deleted for lack of memory : 87722
% 2.51/126.82 # Backward-subsumed : 0
% 2.51/126.82 # Backward-rewritten : 0
% 2.51/126.82 # Generated clauses : 0
% 2.51/126.82 # ...of the previous two non-trivial : 0
% 2.51/126.82 # Contextual simplify-reflections : 0
% 2.51/126.82 # Paramodulations : 0
% 2.51/126.82 # Factorizations : 0
% 2.51/126.82 # Equation resolutions : 0
% 2.51/126.82 # Current number of processed clauses : 14
% 2.51/126.82 # Positive orientable unit clauses : 4
% 2.51/126.82 # Positive unorientable unit clauses: 0
% 2.51/126.82 # Negative unit clauses : 10
% 2.51/126.82 # Non-unit-clauses : 0
% 2.51/126.82 # Current number of unprocessed clauses: 0
% 2.51/126.82 # ...number of literals in the above : 0
% 2.51/126.82 # Current number of archived formulas : 0
% 2.51/126.82 # Current number of archived clauses : 0
% 2.51/126.82 # Clause-clause subsumption calls (NU) : 0
% 2.51/126.82 # Rec. Clause-clause subsumption calls : 0
% 2.51/126.82 # Non-unit clause-clause subsumptions : 0
% 2.51/126.82 # Unit Clause-clause subsumption calls : 9
% 2.51/126.82 # Rewrite failures with RHS unbound : 0
% 2.51/126.82 # BW rewrite match attempts : 0
% 2.51/126.82 # BW rewrite match successes : 0
% 2.51/126.82 # Condensation attempts : 0
% 2.51/126.82 # Condensation successes : 0
% 2.51/126.82 # Termbank termtop insertions : 9571909
% 2.51/126.82
% 2.51/126.82 # -------------------------------------------------
% 2.51/126.82 # User time : 13.437 s
% 2.51/126.82 # System time : 0.299 s
% 2.51/126.82 # Total time : 13.736 s
% 2.51/126.82 # Maximum resident set size: 385116 pages
% 2.51/126.82 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 2.51/126.82
% 2.51/126.82 # Failure: Resource limit exceeded (time)
% 2.51/126.82 # OLD status Res
% 2.51/126.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 2.51/126.82 # Preprocessing time : 1.237 s
% 2.51/126.82 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 2.51/126.82 # Preprocessing time : 8.949 s
% 2.51/126.82
% 2.51/126.82 # Failure: Out of unprocessed clauses!
% 2.51/126.82 # OLD status GaveUp
% 2.51/126.82 # Parsed axioms : 32171
% 2.51/126.82 # Removed by relevancy pruning/SinE : 0
% 2.51/126.82 # Initial clauses : 96569
% 2.51/126.82 # Removed in clause preprocessing : 8831
% 2.51/126.82 # Initial clauses in saturation : 87738
% 2.51/126.82 # Processed clauses : 16
% 2.51/126.82 # ...of these trivial : 0
% 2.51/126.82 # ...subsumed : 0
% 2.51/126.82 # ...remaining for further processing : 16
% 2.51/126.82 # Other redundant clauses eliminated : 0
% 2.51/126.82 # Clauses deleted for lack of memory : 87722
% 2.51/126.82 # Backward-subsumed : 0
% 2.51/126.82 # Backward-rewritten : 0
% 2.51/126.82 # Generated clauses : 0
% 2.51/126.82 # ...of the previous two non-trivial : 0
% 2.51/126.82 # Contextual simplify-reflections : 0
% 2.51/126.82 # Paramodulations : 0
% 2.51/126.82 # Factorizations : 0
% 2.51/126.82 # Equation resolutions : 0
% 2.51/126.82 # Current number of processed clauses : 16
% 2.51/126.82 # Positive orientable unit clauses : 14
% 2.51/126.82 # Positive unorientable unit clauses: 0
% 2.51/126.82 # Negative unit clauses : 1
% 2.51/126.82 # Non-unit-clauses : 1
% 2.51/126.82 # Current number of unprocessed clauses: 0
% 2.51/126.82 # ...number of literals in the above : 0
% 2.51/126.82 # Current number of archived formulas : 0
% 2.51/126.82 # Current number of archived clauses : 0
% 2.51/126.82 # Clause-clause subsumption calls (NU) : 0
% 2.51/126.82 # Rec. Clause-clause subsumption calls : 0
% 2.51/126.82 # Non-unit clause-clause subsumptions : 0
% 2.51/126.82 # Unit Clause-clause subsumption calls : 7
% 2.51/126.82 # Rewrite failures with RHS unbound : 0
% 2.51/126.82 # BW rewrite match attempts : 0
% 2.51/126.82 # BW rewrite match successes : 0
% 2.51/126.82 # Condensation attempts : 0
% 2.51/126.82 # Condensation successes : 0
% 2.51/126.82 # Termbank termtop insertions : 9571944
% 2.51/126.82
% 2.51/126.82 # -------------------------------------------------
% 2.51/126.82 # User time : 13.543 s
% 2.51/126.82 # System time : 0.325 s
% 2.51/126.82 # Total time : 13.868 s
% 2.51/126.82 # Maximum resident set size: 404696 pages
% 2.51/126.82 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 2.51/126.82 # Preprocessing time : 8.110 s
% 2.51/126.82
% 2.51/126.82 # Failure: Out of unprocessed clauses!
% 2.51/126.82 # OLD status GaveUp
% 2.51/126.82 # Parsed axioms : 32171
% 2.51/126.82 # Removed by relevancy pruning/SinE : 0
% 2.51/126.82 # Initial clauses : 96569
% 2.51/126.82 # Removed in clause preprocessing : 8831
% 2.51/126.82 # Initial clauses in saturation : 87738
% 2.51/126.82 # Processed clauses : 16
% 2.51/126.82 # ...of these trivial : 0
% 2.51/126.82 # ...subsumed : 5
% 2.51/126.82 # ...remaining for further processing : 11
% 2.51/126.82 # Other redundant clauses eliminated : 0
% 2.51/126.82 # Clauses deleted for lack of memory : 87723
% 2.51/126.82 # Backward-subsumed : 0
% 2.51/126.82 # Backward-rewritten : 1
% 2.51/126.82 # Generated clauses : 0
% 2.51/126.82 # ...of the previous two non-trivial : 1
% 2.51/126.82 # Contextual simplify-reflections : 0
% 2.51/126.82 # Paramodulations : 0
% 2.51/126.82 # Factorizations : 0
% 2.51/126.82 # Equation resolutions : 0
% 2.51/126.82 # Current number of processed clauses : 10
% 2.51/126.82 # Positive orientable unit clauses : 5
% 2.51/126.82 # Positive unorientable unit clauses: 0
% 2.51/126.82 # Negative unit clauses : 5
% 2.51/126.82 # Non-unit-clauses : 0
% 2.51/126.82 # Current number of unprocessed clauses: 0
% 2.51/126.82 # ...number of literals in the above : 0
% 2.51/126.82 # Current number of archived formulas : 0
% 2.51/126.82 # Current number of archived clauses : 1
% 2.51/126.82 # Clause-clause subsumption calls (NU) : 0
% 2.51/126.82 # Rec. Clause-clause subsumption calls : 0
% 2.51/126.82 # Non-unit clause-clause subsumptions : 0
% 2.51/126.82 # Unit Clause-clause subsumption calls : 2
% 2.51/126.82 # Rewrite failures with RHS unbound : 0
% 2.51/126.82 # BW rewrite match attempts : 1
% 2.51/126.82 # BW rewrite match successes : 1
% 2.51/126.82 # Condensation attempts : 0
% 2.51/126.82 # Condensation successes : 0
% 2.51/126.82 # Termbank termtop insertions : 9571913
% 2.51/126.82
% 2.51/126.82 # -------------------------------------------------
% 2.51/126.82 # User time : 12.495 s
% 2.51/126.82 # System time : 0.311 s
% 2.51/126.82 # Total time : 12.806 s
% 2.51/126.82 # Maximum resident set size: 368912 pages
% 2.51/126.82 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 2.51/126.82
% 2.51/126.82 # Failure: Resource limit exceeded (time)
% 2.51/126.82 # OLD status Res
% 2.51/126.82 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 2.51/126.82 # Preprocessing time : 1.119 s
% 2.51/126.82 # Running protocol protocol_eprover_95b56b3f38545d2cfee43b45856d192a814b65d5 for 23 seconds:
% 2.51/126.82 # Preprocessing time : 7.334 s
% 2.51/126.82
% 2.51/126.82 # Failure: Out of unprocessed clauses!
% 2.51/126.82 # OLD status GaveUp
% 2.51/126.82 # Parsed axioms : 32171
% 2.51/126.82 # Removed by relevancy pruning/SinE : 0
% 2.51/126.82 # Initial clauses : 96569
% 2.51/126.82 # Removed in clause preprocessing : 8831
% 2.51/126.82 # Initial clauses in saturation : 87738
% 2.51/126.82 # Processed clauses : 16
% 2.51/126.82 # ...of these trivial : 0
% 2.51/126.82 # ...subsumed : 0
% 2.51/126.82 # ...remaining for further processing : 16
% 2.51/126.82 # Other redundant clauses eliminated : 1
% 2.51/126.82 # Clauses deleted for lack of memory : 87724
% 2.51/126.82 # Backward-subsumed : 0
% 2.51/126.82 # Backward-rewritten : 0
% 2.51/126.82 # Generated clauses : 2
% 2.51/126.82 # ...of the previous two non-trivial : 2
% 2.51/126.82 # Contextual simplify-reflections : 0
% 2.51/126.82 # Paramodulations : 1
% 2.51/126.82 # Factorizations : 0
% 2.51/126.82 # Equation resolutions : 1
% 2.51/126.82 # Current number of processed clauses : 15
% 2.51/126.82 # Positive orientable unit clauses : 9
% 2.51/126.82 # Positive unorientable unit clauses: 0
% 2.51/126.82 # Negative unit clauses : 4
% 2.51/126.82 # Non-unit-clauses : 2
% 2.51/126.82 # Current number of unprocessed clauses: 0
% 2.51/126.82 # ...number of literals in the above : 0
% 2.51/126.82 # Current number of archived formulas : 0
% 2.51/126.82 # Current number of archived clauses : 0
% 2.51/126.82 # Clause-clause subsumption calls (NU) : 1
% 2.51/126.82 # Rec. Clause-clause subsumption calls : 0
% 2.51/126.82 # Non-unit clause-clause subsumptions : 0
% 2.51/126.82 # Unit Clause-clause subsumption calls : 12
% 2.51/126.82 # Rewrite failures with RHS unbound : 0
% 2.51/126.82 # BW rewrite match attempts : 0
% 2.51/126.82 # BW rewrite match successes : 0
% 2.51/126.82 # Condensation attempts : 0
% 2.51/126.82 # Condensation successes : 0
% 2.51/126.82 # Termbank termtop insertions : 9571974
% 2.51/126.82
% 2.51/126.82 # -------------------------------------------------
% 2.51/126.82 # User time : 11.499 s
% 2.51/126.82 # System time : 0.284 s
% 2.51/126.82 # Total time : 11.783 s
% 2.51/126.82 # Maximum resident set size: 381444 pages
% 2.51/126.82 # Running protocol protocol_eprover_6017f334107ca4679a9978dd19d7c76a8bd36e48 for 23 seconds:
% 2.51/126.82
% 2.51/126.82 # Failure: Resource limit exceeded (time)
% 2.51/126.82 # OLD status Res
% 2.51/126.82 # SinE strategy is GSinE(CountFormulas,,1.4,,02,20000,1.0)
% 2.51/126.82 # Preprocessing time : 1.083 s
% 2.51/126.82 # Running protocol protocol_eprover_29f46a864b4eba32a7d0333eeab34cc2a3bfeeb2 for 23 seconds:
% 2.51/126.82 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,04,500,1.0)
% 2.51/126.82 # Preprocessing time : 1.125 s
% 2.51/126.82
% 2.51/126.82 # Proof found!
% 2.51/126.82 # SZS status Theorem
% 2.51/126.82 # SZS output start CNFRefutation
% See solution above
% 2.51/126.82 # Proof object total steps : 55
% 2.51/126.82 # Proof object clause steps : 30
% 2.51/126.82 # Proof object formula steps : 25
% 2.51/126.82 # Proof object conjectures : 21
% 2.51/126.82 # Proof object clause conjectures : 18
% 2.51/126.82 # Proof object formula conjectures : 3
% 2.51/126.82 # Proof object initial clauses used : 17
% 2.51/126.82 # Proof object initial formulas used : 12
% 2.51/126.82 # Proof object generating inferences : 10
% 2.51/126.82 # Proof object simplifying inferences : 46
% 2.51/126.82 # Training examples: 0 positive, 0 negative
% 2.51/126.82 # Parsed axioms : 32171
% 2.51/126.82 # Removed by relevancy pruning/SinE : 31670
% 2.51/126.82 # Initial clauses : 1080
% 2.51/126.82 # Removed in clause preprocessing : 70
% 2.51/126.82 # Initial clauses in saturation : 1010
% 2.51/126.82 # Processed clauses : 6006
% 2.51/126.82 # ...of these trivial : 408
% 2.51/126.82 # ...subsumed : 3043
% 2.51/126.82 # ...remaining for further processing : 2555
% 2.51/126.82 # Other redundant clauses eliminated : 81
% 2.51/126.82 # Clauses deleted for lack of memory : 0
% 2.51/126.82 # Backward-subsumed : 12
% 2.51/126.82 # Backward-rewritten : 241
% 2.51/126.82 # Generated clauses : 36427
% 2.51/126.82 # ...of the previous two non-trivial : 30049
% 2.51/126.82 # Contextual simplify-reflections : 0
% 2.51/126.82 # Paramodulations : 36216
% 2.51/126.82 # Factorizations : 15
% 2.51/126.82 # Equation resolutions : 162
% 2.51/126.82 # Current number of processed clauses : 2293
% 2.51/126.82 # Positive orientable unit clauses : 719
% 2.51/126.82 # Positive unorientable unit clauses: 10
% 2.51/126.82 # Negative unit clauses : 221
% 2.51/126.82 # Non-unit-clauses : 1343
% 2.51/126.82 # Current number of unprocessed clauses: 21842
% 2.51/126.82 # ...number of literals in the above : 72595
% 2.51/126.82 # Current number of archived formulas : 0
% 2.51/126.82 # Current number of archived clauses : 256
% 2.51/126.82 # Clause-clause subsumption calls (NU) : 143918
% 2.51/126.82 # Rec. Clause-clause subsumption calls : 94659
% 2.51/126.82 # Non-unit clause-clause subsumptions : 1017
% 2.51/126.82 # Unit Clause-clause subsumption calls : 170432
% 2.51/126.82 # Rewrite failures with RHS unbound : 36
% 2.51/126.82 # BW rewrite match attempts : 904
% 2.51/126.82 # BW rewrite match successes : 107
% 2.51/126.82 # Condensation attempts : 0
% 2.51/126.82 # Condensation successes : 0
% 2.51/126.82 # Termbank termtop insertions : 1690460
% 2.51/126.82
% 2.51/126.82 # -------------------------------------------------
% 2.51/126.82 # User time : 2.006 s
% 2.51/126.82 # System time : 0.068 s
% 2.51/126.82 # Total time : 2.074 s
% 2.51/126.82 # Maximum resident set size: 102512 pages
% 2.51/137.13 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/137.13 eprover: No such file or directory
% 2.51/137.14 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/137.14 eprover: No such file or directory
% 2.51/137.15 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/137.15 eprover: No such file or directory
% 2.51/137.15 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/137.15 eprover: No such file or directory
% 2.51/143.14 eprover: CPU time limit exceeded, terminating
% 2.51/143.16 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.51/143.16 eprover: No such file or directory
% 2.51/143.17 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.51/143.17 eprover: No such file or directory
% 2.51/143.17 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.51/143.17 eprover: No such file or directory
% 2.51/143.18 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.51/143.18 eprover: No such file or directory
% 2.51/143.19 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.51/143.19 eprover: No such file or directory
% 2.51/143.72 eprover: CPU time limit exceeded, terminating
% 2.51/143.74 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/143.74 eprover: No such file or directory
% 2.51/143.75 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/143.75 eprover: No such file or directory
% 2.51/143.76 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/143.76 eprover: No such file or directory
% 2.51/143.76 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/143.76 eprover: No such file or directory
% 2.51/143.77 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.51/143.77 eprover: No such file or directory
%------------------------------------------------------------------------------