TSTP Solution File: LAT300+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT300+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Mon May 20 23:26:42 EDT 2024
% Result : Theorem 3.98s 2.01s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 15 unt; 0 def)
% Number of atoms : 200 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 232 ( 84 ~; 77 |; 41 &)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 1 sgn 55 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',existence_m1_subset_1) ).
fof(dt_m2_filter_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( ~ v1_xboole_0(X2)
& m2_lattice4(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_filter_2) ).
fof(t24_filter_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
& r2_hidden(X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_filter_2) ).
fof(existence_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ? [X3] : m2_subset_1(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',existence_m2_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3))
& v1_xboole_0(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t5_subset) ).
fof(dt_m2_lattice4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+375.ax',dt_m2_lattice4) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(dt_m2_subset_1,axiom,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
=> m1_subset_1(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',dt_m2_subset_1) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) )
& ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_10,plain,
! [X66,X67] :
( ( ~ m1_subset_1(X67,X66)
| r2_hidden(X67,X66)
| v1_xboole_0(X66) )
& ( ~ r2_hidden(X67,X66)
| m1_subset_1(X67,X66)
| v1_xboole_0(X66) )
& ( ~ m1_subset_1(X67,X66)
| v1_xboole_0(X67)
| ~ v1_xboole_0(X66) )
& ( ~ v1_xboole_0(X67)
| m1_subset_1(X67,X66)
| ~ v1_xboole_0(X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,plain,
! [X90] : m1_subset_1(esk5_1(X90),X90),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_12,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( ~ v1_xboole_0(X2)
& m2_lattice4(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_filter_2]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
& r2_hidden(X3,X2) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t24_filter_2])]) ).
fof(c_0_14,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ? [X3] : m2_subset_1(X3,X1,X2) ),
inference(fof_simplification,[status(thm)],[existence_m2_subset_1]) ).
fof(c_0_15,plain,
! [X231,X232,X233] :
( ~ r2_hidden(X231,X232)
| ~ m1_subset_1(X232,k1_zfmisc_1(X233))
| ~ v1_xboole_0(X233) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_16,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
m1_subset_1(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v10_lattices(X1)
& l3_lattices(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_lattice4]) ).
fof(c_0_19,plain,
! [X92,X93] :
( ( ~ v1_xboole_0(X93)
| ~ m2_filter_2(X93,X92)
| v3_struct_0(X92)
| ~ v10_lattices(X92)
| ~ l3_lattices(X92) )
& ( m2_lattice4(X93,X92)
| ~ m2_filter_2(X93,X92)
| v3_struct_0(X92)
| ~ v10_lattices(X92)
| ~ l3_lattices(X92) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_20,negated_conjecture,
! [X54] :
( ~ v3_struct_0(esk1_0)
& v10_lattices(esk1_0)
& l3_lattices(esk1_0)
& m2_filter_2(esk2_0,esk1_0)
& ( ~ m1_subset_1(X54,u1_struct_0(esk1_0))
| ~ r2_hidden(X54,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_21,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_22,plain,
! [X218,X219] :
( v1_xboole_0(X218)
| v1_xboole_0(X219)
| ~ m1_subset_1(X219,k1_zfmisc_1(X218))
| m2_subset_1(esk36_2(X218,X219),X218,X219) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_23,plain,
( ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| ~ v1_xboole_0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( v1_xboole_0(X1)
| r2_hidden(esk5_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_25,plain,
! [X133,X134] :
( v3_struct_0(X133)
| ~ v10_lattices(X133)
| ~ l3_lattices(X133)
| ~ m2_lattice4(X134,X133)
| m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_26,plain,
( m2_lattice4(X1,X2)
| v3_struct_0(X2)
| ~ m2_filter_2(X1,X2)
| ~ v10_lattices(X2)
| ~ l3_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_31,plain,
! [X221,X222,X223] :
( ( ~ m2_subset_1(X223,X221,X222)
| m1_subset_1(X223,X222)
| v1_xboole_0(X221)
| v1_xboole_0(X222)
| ~ m1_subset_1(X222,k1_zfmisc_1(X221)) )
& ( ~ m1_subset_1(X223,X222)
| m2_subset_1(X223,X221,X222)
| v1_xboole_0(X221)
| v1_xboole_0(X222)
| ~ m1_subset_1(X222,k1_zfmisc_1(X221)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
cnf(c_0_32,plain,
( v1_xboole_0(X1)
| v1_xboole_0(X2)
| m2_subset_1(esk36_2(X1,X2),X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( v1_xboole_0(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ v1_xboole_0(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
( v3_struct_0(X1)
| m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v10_lattices(X1)
| ~ l3_lattices(X1)
| ~ m2_lattice4(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
m2_lattice4(esk2_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_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_36,plain,
( v3_struct_0(X2)
| ~ v1_xboole_0(X1)
| ~ m2_filter_2(X1,X2)
| ~ v10_lattices(X2)
| ~ l3_lattices(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,plain,
( m1_subset_1(X1,X3)
| v1_xboole_0(X2)
| v1_xboole_0(X3)
| ~ m2_subset_1(X1,X2,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( m2_subset_1(esk36_2(X1,X2),X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(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_34,c_0_35]),c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_40,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_27]),c_0_28]),c_0_29])]),c_0_30]) ).
fof(c_0_41,plain,
! [X1,X2] :
( ( ~ v1_xboole_0(X1)
& ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
=> m1_subset_1(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_subset_1]) ).
cnf(c_0_42,plain,
( m1_subset_1(X1,X2)
| v1_xboole_0(X2)
| ~ m2_subset_1(X1,X3,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3)) ),
inference(csr,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_43,negated_conjecture,
m2_subset_1(esk36_2(u1_struct_0(esk1_0),esk2_0),u1_struct_0(esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
fof(c_0_44,plain,
! [X215,X216,X217] :
( v1_xboole_0(X215)
| v1_xboole_0(X216)
| ~ m1_subset_1(X216,k1_zfmisc_1(X215))
| ~ m2_subset_1(X217,X215,X216)
| m1_subset_1(X217,X215) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_45,negated_conjecture,
m1_subset_1(esk36_2(u1_struct_0(esk1_0),esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39])]),c_0_40]) ).
cnf(c_0_46,plain,
( v1_xboole_0(X1)
| v1_xboole_0(X2)
| m1_subset_1(X3,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1))
| ~ m2_subset_1(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( ~ m1_subset_1(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_48,negated_conjecture,
r2_hidden(esk36_2(u1_struct_0(esk1_0),esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_45]),c_0_40]) ).
cnf(c_0_49,plain,
( m1_subset_1(X1,X2)
| v1_xboole_0(X3)
| ~ m2_subset_1(X1,X2,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(csr,[status(thm)],[c_0_46,c_0_33]) ).
cnf(c_0_50,negated_conjecture,
~ m1_subset_1(esk36_2(u1_struct_0(esk1_0),esk2_0),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_43]),c_0_39])]),c_0_40]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT300+4 : TPTP v8.2.0. Released v3.4.0.
% 0.14/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:33:42 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/2.01 # Version: 3.1.0
% 3.98/2.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 3.98/2.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.98/2.01 # Starting new_bool_3 with 897s (3) cores
% 3.98/2.01 # Starting new_bool_1 with 897s (3) cores
% 3.98/2.01 # Starting sh5l with 299s (1) cores
% 3.98/2.01 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 3.98/2.01 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 26861 completed with status 0
% 3.98/2.01 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 3.98/2.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 3.98/2.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.98/2.01 # Starting new_bool_3 with 897s (3) cores
% 3.98/2.01 # Starting new_bool_1 with 897s (3) cores
% 3.98/2.01 # Starting sh5l with 299s (1) cores
% 3.98/2.01 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 3.98/2.01 # SinE strategy is gf120_h_gu_R02_F100_L20000
% 3.98/2.01 # Search class: FGHSS-FSLM31-MFFFFFNN
% 3.98/2.01 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 3.98/2.01 # Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 3.98/2.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 3.98/2.01 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 26868 completed with status 0
% 3.98/2.01 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 3.98/2.01 # Preprocessing class: FMLLMLLLSSSNFFN.
% 3.98/2.01 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.98/2.01 # Starting new_bool_3 with 897s (3) cores
% 3.98/2.01 # Starting new_bool_1 with 897s (3) cores
% 3.98/2.01 # Starting sh5l with 299s (1) cores
% 3.98/2.01 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 299s (1) cores
% 3.98/2.01 # SinE strategy is gf120_h_gu_R02_F100_L20000
% 3.98/2.01 # Search class: FGHSS-FSLM31-MFFFFFNN
% 3.98/2.01 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 3.98/2.01 # Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 3.98/2.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 3.98/2.01 # Preprocessing time : 0.008 s
% 3.98/2.01 # Presaturation interreduction done
% 3.98/2.01
% 3.98/2.01 # Proof found!
% 3.98/2.01 # SZS status Theorem
% 3.98/2.01 # SZS output start CNFRefutation
% See solution above
% 3.98/2.01 # Parsed axioms : 34682
% 3.98/2.01 # Removed by relevancy pruning/SinE : 34602
% 3.98/2.01 # Initial clauses : 214
% 3.98/2.01 # Removed in clause preprocessing : 2
% 3.98/2.01 # Initial clauses in saturation : 212
% 3.98/2.01 # Processed clauses : 810
% 3.98/2.01 # ...of these trivial : 0
% 3.98/2.01 # ...subsumed : 307
% 3.98/2.01 # ...remaining for further processing : 502
% 3.98/2.01 # Other redundant clauses eliminated : 0
% 3.98/2.01 # Clauses deleted for lack of memory : 0
% 3.98/2.01 # Backward-subsumed : 1
% 3.98/2.01 # Backward-rewritten : 2
% 3.98/2.01 # Generated clauses : 1984
% 3.98/2.01 # ...of the previous two non-redundant : 1874
% 3.98/2.01 # ...aggressively subsumed : 0
% 3.98/2.01 # Contextual simplify-reflections : 26
% 3.98/2.01 # Paramodulations : 1982
% 3.98/2.01 # Factorizations : 2
% 3.98/2.01 # NegExts : 0
% 3.98/2.01 # Equation resolutions : 0
% 3.98/2.01 # Disequality decompositions : 0
% 3.98/2.01 # Total rewrite steps : 98
% 3.98/2.01 # ...of those cached : 81
% 3.98/2.01 # Propositional unsat checks : 0
% 3.98/2.01 # Propositional check models : 0
% 3.98/2.01 # Propositional check unsatisfiable : 0
% 3.98/2.01 # Propositional clauses : 0
% 3.98/2.01 # Propositional clauses after purity: 0
% 3.98/2.01 # Propositional unsat core size : 0
% 3.98/2.01 # Propositional preprocessing time : 0.000
% 3.98/2.01 # Propositional encoding time : 0.000
% 3.98/2.01 # Propositional solver time : 0.000
% 3.98/2.01 # Success case prop preproc time : 0.000
% 3.98/2.01 # Success case prop encoding time : 0.000
% 3.98/2.01 # Success case prop solver time : 0.000
% 3.98/2.01 # Current number of processed clauses : 291
% 3.98/2.01 # Positive orientable unit clauses : 25
% 3.98/2.01 # Positive unorientable unit clauses: 0
% 3.98/2.01 # Negative unit clauses : 39
% 3.98/2.01 # Non-unit-clauses : 227
% 3.98/2.01 # Current number of unprocessed clauses: 1479
% 3.98/2.01 # ...number of literals in the above : 6296
% 3.98/2.01 # Current number of archived formulas : 0
% 3.98/2.01 # Current number of archived clauses : 211
% 3.98/2.01 # Clause-clause subsumption calls (NU) : 33826
% 3.98/2.01 # Rec. Clause-clause subsumption calls : 8960
% 3.98/2.01 # Non-unit clause-clause subsumptions : 161
% 3.98/2.01 # Unit Clause-clause subsumption calls : 427
% 3.98/2.01 # Rewrite failures with RHS unbound : 0
% 3.98/2.01 # BW rewrite match attempts : 1
% 3.98/2.01 # BW rewrite match successes : 1
% 3.98/2.01 # Condensation attempts : 0
% 3.98/2.01 # Condensation successes : 0
% 3.98/2.01 # Termbank termtop insertions : 1074563
% 3.98/2.01 # Search garbage collected termcells : 345372
% 3.98/2.01
% 3.98/2.01 # -------------------------------------------------
% 3.98/2.01 # User time : 0.368 s
% 3.98/2.01 # System time : 0.078 s
% 3.98/2.01 # Total time : 0.446 s
% 3.98/2.01 # Maximum resident set size: 67776 pages
% 3.98/2.01
% 3.98/2.01 # -------------------------------------------------
% 3.98/2.01 # User time : 1.347 s
% 3.98/2.01 # System time : 0.118 s
% 3.98/2.01 # Total time : 1.465 s
% 3.98/2.01 # Maximum resident set size: 53828 pages
% 3.98/2.01 % E---3.1 exiting
%------------------------------------------------------------------------------