TSTP Solution File: GEO254+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO254+1 : TPTP v8.2.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : Mon May 20 19:58:56 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 19 unt; 0 def)
% Number of atoms : 172 ( 0 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 175 ( 65 ~; 79 |; 24 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 4 sgn 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(bf_def,axiom,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( distinct_points(X1,X4)
& ~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) )
& ~ ( left_apart_point(X4,X2)
| left_apart_point(X4,reverse_line(X2)) )
& ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',bf_def) ).
fof(con,conjecture,
! [X1,X4,X2] :
( ( distinct_points(X1,X4)
& ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X4,X2) )
=> ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(oag1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag1) ).
fof(oag2,axiom,
! [X1,X4,X5] :
( distinct_points(X1,X4)
=> ( distinct_points(X1,X5)
| distinct_points(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag2) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) )
=> ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X2,X6)
| unequally_directed_lines(X3,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oagco9) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(c_0_10,plain,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( distinct_points(X1,X4)
& ~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) )
& ~ ( left_apart_point(X4,X2)
| left_apart_point(X4,reverse_line(X2)) )
& ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
inference(fof_simplification,[status(thm)],[bf_def]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X4,X2] :
( ( distinct_points(X1,X4)
& ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X4,X2) )
=> ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_12,plain,
! [X10,X11,X12] :
( ( distinct_points(X11,X12)
| ~ before_on_line(X10,X11,X12) )
& ( ~ left_apart_point(X11,X10)
| ~ before_on_line(X10,X11,X12) )
& ( ~ left_apart_point(X11,reverse_line(X10))
| ~ before_on_line(X10,X11,X12) )
& ( ~ left_apart_point(X12,X10)
| ~ before_on_line(X10,X11,X12) )
& ( ~ left_apart_point(X12,reverse_line(X10))
| ~ before_on_line(X10,X11,X12) )
& ( ~ unequally_directed_lines(X10,line_connecting(X11,X12))
| ~ before_on_line(X10,X11,X12) )
& ( ~ distinct_points(X11,X12)
| left_apart_point(X11,X10)
| left_apart_point(X11,reverse_line(X10))
| left_apart_point(X12,X10)
| left_apart_point(X12,reverse_line(X10))
| unequally_directed_lines(X10,line_connecting(X11,X12))
| before_on_line(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,plain,
! [X36,X37] :
( ~ left_apart_point(X36,X37)
& ~ left_apart_point(X36,reverse_line(X37)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])])]) ).
fof(c_0_14,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[oag1]) ).
fof(c_0_15,plain,
! [X18,X19,X20] :
( ~ distinct_points(X18,X19)
| distinct_points(X18,X20)
| distinct_points(X19,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag2])])]) ).
fof(c_0_16,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& ~ apart_point_and_line(esk1_0,esk3_0)
& ~ apart_point_and_line(esk2_0,esk3_0)
& ( ~ before_on_line(esk3_0,esk1_0,esk2_0)
| ~ before_on_line(esk3_0,esk2_0,esk1_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_17,plain,
( left_apart_point(X1,X3)
| left_apart_point(X1,reverse_line(X3))
| left_apart_point(X2,X3)
| left_apart_point(X2,reverse_line(X3))
| unequally_directed_lines(X3,line_connecting(X1,X2))
| before_on_line(X3,X1,X2)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X17] : ~ distinct_points(X17,X17),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_20,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( before_on_line(X1,X2,X3)
| unequally_directed_lines(X1,line_connecting(X2,X3))
| ~ distinct_points(X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ before_on_line(esk3_0,esk1_0,esk2_0)
| ~ before_on_line(esk3_0,esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( before_on_line(X1,esk1_0,esk2_0)
| unequally_directed_lines(X1,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X38,X39] :
( ~ unequally_directed_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| left_convergent_lines(X38,reverse_line(X39)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_29,plain,
! [X40,X41] :
( ~ left_convergent_lines(X40,X41)
& ~ left_convergent_lines(X40,reverse_line(X41)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
fof(c_0_30,plain,
! [X25,X26,X27] :
( ~ unequally_directed_lines(X25,X26)
| unequally_directed_lines(X25,X27)
| unequally_directed_lines(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
cnf(c_0_31,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0))
| ~ before_on_line(esk3_0,esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( before_on_line(X1,esk2_0,esk1_0)
| unequally_directed_lines(X1,line_connecting(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_33,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( unequally_directed_lines(X1,X3)
| unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk2_0,esk1_0))
| unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk2_0,esk1_0))
| unequally_directed_lines(line_connecting(esk1_0,esk2_0),X1)
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_39,plain,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
inference(fof_simplification,[status(thm)],[oagco9]) ).
cnf(c_0_40,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk2_0,esk1_0))
| unequally_directed_lines(esk3_0,X1)
| ~ unequally_directed_lines(line_connecting(esk1_0,esk2_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_41,plain,
! [X31,X32] : ~ unequally_directed_lines(line_connecting(X31,X32),reverse_line(line_connecting(X32,X31))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk2_0,esk1_0))
| unequally_directed_lines(esk3_0,reverse_line(X1))
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_43,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1)
| unequally_directed_lines(esk3_0,reverse_line(X2))
| unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( unequally_directed_lines(esk3_0,reverse_line(line_connecting(esk1_0,esk2_0)))
| unequally_directed_lines(esk3_0,reverse_line(X1))
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( unequally_directed_lines(esk3_0,reverse_line(line_connecting(esk1_0,esk2_0)))
| unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0)) ),
inference(ef,[status(thm)],[c_0_45]) ).
cnf(c_0_47,negated_conjecture,
( unequally_directed_lines(reverse_line(line_connecting(esk1_0,esk2_0)),X1)
| unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0))
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0))
| unequally_directed_lines(esk3_0,X1)
| ~ unequally_directed_lines(reverse_line(line_connecting(esk1_0,esk2_0)),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(esk1_0,esk2_0))
| unequally_directed_lines(esk3_0,reverse_line(X1))
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
fof(c_0_50,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_51,negated_conjecture,
( unequally_directed_lines(esk3_0,reverse_line(X1))
| unequally_directed_lines(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_45]) ).
fof(c_0_52,plain,
! [X24] : ~ unequally_directed_lines(X24,X24),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_50])]) ).
cnf(c_0_53,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(esk3_0,X1)
| unequally_directed_lines(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_54,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(esk3_0,X3)
| unequally_directed_lines(esk3_0,X1)
| unequally_directed_lines(X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(X1,X2))
| unequally_directed_lines(esk3_0,line_connecting(X2,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
unequally_directed_lines(esk3_0,line_connecting(X1,X1)),
inference(ef,[status(thm)],[c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( unequally_directed_lines(line_connecting(X1,X1),X2)
| unequally_directed_lines(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
~ unequally_directed_lines(esk3_0,reverse_line(line_connecting(X1,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO254+1 : TPTP v8.2.0. Bugfixed v6.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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 : Sun May 19 15:00:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 # Version: 3.1.0
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 3090 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.20/0.55 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 3093 completed with status 0
% 0.20/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.002 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 32
% 0.20/0.55 # Removed by relevancy pruning/SinE : 16
% 0.20/0.55 # Initial clauses : 33
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 33
% 0.20/0.55 # Processed clauses : 1019
% 0.20/0.55 # ...of these trivial : 1
% 0.20/0.55 # ...subsumed : 788
% 0.20/0.55 # ...remaining for further processing : 230
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 30
% 0.20/0.55 # Backward-rewritten : 0
% 0.20/0.55 # Generated clauses : 1947
% 0.20/0.55 # ...of the previous two non-redundant : 1696
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 1
% 0.20/0.55 # Paramodulations : 1319
% 0.20/0.55 # Factorizations : 628
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 185
% 0.20/0.55 # ...of those cached : 179
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 186
% 0.20/0.55 # Positive orientable unit clauses : 3
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 7
% 0.20/0.55 # Non-unit-clauses : 176
% 0.20/0.55 # Current number of unprocessed clauses: 712
% 0.20/0.55 # ...number of literals in the above : 3610
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 44
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 30136
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 6403
% 0.20/0.55 # Non-unit clause-clause subsumptions : 802
% 0.20/0.55 # Unit Clause-clause subsumption calls : 77
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 4
% 0.20/0.55 # BW rewrite match successes : 0
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 23306
% 0.20/0.55 # Search garbage collected termcells : 481
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.061 s
% 0.20/0.55 # System time : 0.005 s
% 0.20/0.55 # Total time : 0.067 s
% 0.20/0.55 # Maximum resident set size: 1840 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.063 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.071 s
% 0.20/0.55 # Maximum resident set size: 1760 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------