TSTP Solution File: GEO255+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO255+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:34:40 EDT 2023
% Result : Timeout 0.37s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 24 unt; 0 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 167 ( 66 ~; 71 |; 23 &)
% ( 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 : 99 ( 5 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X1,X4] :
( ( line(X2)
& distinct_points(X1,X4) )
=> ~ ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',con) ).
fof(oag8,axiom,
! [X2,X3] :
( ( line(X2)
& line(X3) )
=> ( unequally_directed_lines(X2,X3)
| unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag8) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag5) ).
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/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',bf_def) ).
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/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag6) ).
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/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag11) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oag10) ).
fof(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p',oagco9) ).
fof(c_0_9,negated_conjecture,
~ ! [X2,X1,X4] :
( ( line(X2)
& distinct_points(X1,X4) )
=> ~ ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X1) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X20,X21] :
( ~ line(X20)
| ~ line(X21)
| unequally_directed_lines(X20,X21)
| unequally_directed_lines(X20,reverse_line(X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag8])]) ).
fof(c_0_11,negated_conjecture,
( line(esk1_0)
& distinct_points(esk2_0,esk3_0)
& before_on_line(esk1_0,esk2_0,esk3_0)
& before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_13,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2))
| ~ line(X1)
| ~ line(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
line(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X23] : ~ unequally_directed_lines(X23,X23),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_16,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_17,plain,
! [X24,X25,X26] :
( ~ unequally_directed_lines(X24,X25)
| unequally_directed_lines(X24,X26)
| unequally_directed_lines(X25,X26) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])]) ).
cnf(c_0_18,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(esk1_0))
| unequally_directed_lines(X1,esk1_0)
| ~ line(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X43,X44] :
( ~ unequally_directed_lines(X43,X44)
| ~ unequally_directed_lines(X43,reverse_line(X44))
| left_convergent_lines(X43,X44)
| left_convergent_lines(X43,reverse_line(X44)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).
fof(c_0_21,plain,
! [X45,X46] :
( ~ left_convergent_lines(X45,X46)
& ~ left_convergent_lines(X45,reverse_line(X46)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).
fof(c_0_22,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_23,plain,
! [X37,X38] :
( ~ left_apart_point(X37,X38)
& ~ left_apart_point(X37,reverse_line(X38)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).
cnf(c_0_24,plain,
( unequally_directed_lines(X1,X3)
| unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_26,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_20]) ).
cnf(c_0_27,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,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_22]) ).
cnf(c_0_29,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_32,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_28,c_0_29]),c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_33,plain,
( distinct_points(X1,X2)
| ~ before_on_line(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
before_on_line(esk1_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,plain,
( ~ unequally_directed_lines(X1,line_connecting(X2,X3))
| ~ before_on_line(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,negated_conjecture,
( unequally_directed_lines(reverse_line(esk1_0),X1)
| unequally_directed_lines(esk1_0,X2)
| unequally_directed_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(X1))
| ~ unequally_directed_lines(reverse_line(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
fof(c_0_38,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_39,plain,
( before_on_line(X1,X2,X3)
| unequally_directed_lines(line_connecting(X2,X3),X4)
| unequally_directed_lines(X1,X4)
| ~ distinct_points(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( unequally_directed_lines(reverse_line(esk1_0),line_connecting(X1,X2))
| unequally_directed_lines(esk1_0,X3)
| ~ before_on_line(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(X1))
| unequally_directed_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
fof(c_0_44,plain,
! [X32,X33] : ~ unequally_directed_lines(line_connecting(X32,X33),reverse_line(line_connecting(X33,X32))),
inference(variable_rename,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( before_on_line(X1,esk3_0,esk2_0)
| unequally_directed_lines(line_connecting(esk3_0,esk2_0),X2)
| unequally_directed_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
unequally_directed_lines(reverse_line(esk1_0),line_connecting(esk3_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_19]) ).
cnf(c_0_47,negated_conjecture,
( before_on_line(reverse_line(esk1_0),X1,X2)
| unequally_directed_lines(esk1_0,reverse_line(line_connecting(X1,X2)))
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
unequally_directed_lines(reverse_line(esk1_0),line_connecting(esk2_0,esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_19]) ).
cnf(c_0_49,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(esk1_0,X1)
| unequally_directed_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_43]) ).
cnf(c_0_50,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( before_on_line(X1,esk3_0,esk2_0)
| unequally_directed_lines(line_connecting(esk3_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
~ before_on_line(reverse_line(esk1_0),esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( before_on_line(reverse_line(esk1_0),X1,X2)
| ~ distinct_points(X1,X2)
| ~ unequally_directed_lines(esk1_0,line_connecting(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
~ before_on_line(reverse_line(esk1_0),esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_35,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
distinct_points(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_56,negated_conjecture,
( unequally_directed_lines(esk1_0,line_connecting(X1,X2))
| unequally_directed_lines(esk1_0,X3)
| ~ before_on_line(reverse_line(X3),X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
before_on_line(reverse_line(line_connecting(esk2_0,esk3_0)),esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
~ unequally_directed_lines(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_40])]) ).
cnf(c_0_59,negated_conjecture,
~ unequally_directed_lines(esk1_0,line_connecting(esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_53]),c_0_55])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GEO255+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 06:53:15 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.5eIoqVnRv0/E---3.1_15495.p
% 0.37/300.19 # Version: 3.1pre001
% 0.37/300.19 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.19 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.19 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.19 # Starting sh5l with 300s (1) cores
% 0.37/300.19 # new_bool_3 with pid 15573 completed with status 0
% 0.37/300.19 # Result found by new_bool_3
% 0.37/300.19 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.19 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.19 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.37/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/300.19 # SAT001_MinMin_p005000_rr_RG with pid 15576 completed with status 0
% 0.37/300.19 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/300.19 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.19 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/300.19 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.37/300.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.19 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/300.19 # Preprocessing time : 0.001 s
% 0.37/300.19 # Presaturation interreduction done
% 0.37/300.19
% 0.37/300.19 # Proof found!
% 0.37/300.19 # SZS status Theorem
% 0.37/300.19 # SZS output start CNFRefutation
% See solution above
% 0.37/300.19 # Parsed axioms : 32
% 0.37/300.19 # Removed by relevancy pruning/SinE : 13
% 0.37/300.19 # Initial clauses : 36
% 0.37/300.19 # Removed in clause preprocessing : 0
% 0.37/300.19 # Initial clauses in saturation : 36
% 0.37/300.19 # Processed clauses : 178
% 0.37/300.19 # ...of these trivial : 4
% 0.37/300.19 # ...subsumed : 64
% 0.37/300.19 # ...remaining for further processing : 110
% 0.37/300.19 # Other redundant clauses eliminated : 0
% 0.37/300.19 # Clauses deleted for lack of memory : 0
% 0.37/300.19 # Backward-subsumed : 2
% 0.37/300.19 # Backward-rewritten : 0
% 0.37/300.19 # Generated clauses : 463
% 0.37/300.19 # ...of the previous two non-redundant : 329
% 0.37/300.19 # ...aggressively subsumed : 0
% 0.37/300.19 # Contextual simplify-reflections : 0
% 0.37/300.19 # Paramodulations : 415
% 0.37/300.19 # Factorizations : 48
% 0.37/300.19 # NegExts : 0
% 0.37/300.19 # Equation resolutions : 0
% 0.37/300.19 # Total rewrite steps : 136
% 0.37/300.19 # Propositional unsat checks : 0
% 0.37/300.19 # Propositional check models : 0
% 0.37/300.19 # Propositional check unsatisfiable : 0
% 0.37/300.19 # Propositional clauses : 0
% 0.37/300.19 # Propositional clauses after purity: 0
% 0.37/300.19 # Propositional unsat core size : 0
% 0.37/300.19 # Propositional preprocessing time : 0.000
% 0.37/300.19 # Propositional encoding time : 0.000
% 0.37/300.19 # Propositional solver time : 0.000
% 0.37/300.19 # Success case prop preproc time : 0.000
% 0.37/300.19 # Success case prop encoding time : 0.000
% 0.37/300.19 # Success case prop solver time : 0.000
% 0.37/300.19 # Current number of processed clauses : 90
% 0.37/300.19 # Positive orientable unit clauses : 18
% 0.37/300.19 # Positive unorientable unit clauses: 0
% 0.37/300.19 # Negative unit clauses : 15
% 0.37/300.19 # Non-unit-clauses : 57
% 0.37/300.19 # Current number of unprocessed clauses: 205
% 0.37/300.19 # ...number of literals in the above : 738
% 0.37/300.19 # Current number of archived formulas : 0
% 0.37/300.19 # Current number of archived clauses : 20
% 0.37/300.19 # Clause-clause subsumption calls (NU) : 634
% 0.37/300.19 # Rec. Clause-clause subsumption calls : 422
% 0.37/300.19 # Non-unit clause-clause subsumptions : 47
% 0.37/300.19 # Unit Clause-clause subsumption calls : 56
% 0.37/300.19 # Rewrite failures with RHS unbound : 0
% 0.37/300.19 # BW rewrite match attempts : 9
% 0.37/300.19 # BW rewrite match successes : 0
% 0.37/300.19 # Condensation attempts : 0
% 0.37/300.19 # Condensation successes : 0
% 0.37/300.19 # Termbank termtop insertions : 6888
% 0.37/300.19
% 0.37/300.19 # -------------------------------------------------
% 0.37/300.19 # User time : 0.014 s
% 0.37/300.19 # System time : 0.000 s
% 0.37/300.19 # Total time : 0.014 s
% 0.37/300.19 # Maximum resident set size: 1844 pages
% 0.37/300.19
% 0.37/300.19 # -------------------------------------------------
% 0.37/300.19 # User time : 0.015 s
% 0.37/300.19 # System time : 0.003 s
% 0.37/300.19 # Total time : 0.018 s
% 0.37/300.19 # Maximum resident set size: 1712 pages
% 0.37/300.20 % E---3.1 exiting
%------------------------------------------------------------------------------