TSTP Solution File: GEO205+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO205+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:32:06 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 20 unt; 0 def)
% Number of atoms : 168 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 146 ( 49 ~; 78 |; 7 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn; 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',con) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',apart3) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',ceq3) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',apart4) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',apart1) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',apart5) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',cu1) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',ci3) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',ceq2) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.E2VRTqitcX/E---3.1_1729.p',apart2) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& ~ distinct_lines(X2,X3) )
=> ( convergent_lines(X1,X3)
& ~ distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_13,plain,
! [X29,X30,X31] :
( ~ convergent_lines(X29,X30)
| convergent_lines(X29,X31)
| convergent_lines(X30,X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
fof(c_0_14,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& ~ distinct_lines(esk2_0,esk3_0)
& ( ~ convergent_lines(esk1_0,esk3_0)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_16,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X28] : ~ convergent_lines(X28,X28),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X32,X33,X34] :
( ~ convergent_lines(X32,X33)
| distinct_lines(X33,X34)
| convergent_lines(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
cnf(c_0_21,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
fof(c_0_23,plain,
! [X10,X11,X12] :
( ~ distinct_points(X10,X11)
| distinct_points(X10,X12)
| distinct_points(X11,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
cnf(c_0_24,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
| ~ convergent_lines(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
fof(c_0_31,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_32,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_points(intersection_point(esk1_0,esk3_0),X1)
| ~ convergent_lines(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( convergent_lines(X1,esk1_0)
| convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
fof(c_0_35,plain,
! [X9] : ~ distinct_points(X9,X9),
inference(variable_rename,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk3_0),X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
fof(c_0_37,plain,
! [X36,X37,X38] :
( ~ distinct_lines(X36,X37)
| distinct_lines(X36,X38)
| distinct_lines(X37,X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_38,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_39,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_points(intersection_point(esk1_0,esk3_0),X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_36]) ).
cnf(c_0_41,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( convergent_lines(esk2_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk3_0))
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_44,plain,
! [X17,X18,X19,X20] :
( ~ distinct_points(X17,X18)
| ~ distinct_lines(X19,X20)
| apart_point_and_line(X17,X19)
| apart_point_and_line(X17,X20)
| apart_point_and_line(X18,X19)
| apart_point_and_line(X18,X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_45,negated_conjecture,
( convergent_lines(esk2_0,X1)
| distinct_lines(esk1_0,X2)
| distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk3_0))
| distinct_points(intersection_point(esk1_0,esk2_0),X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_43]) ).
fof(c_0_47,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_48,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
distinct_lines(esk1_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_45]),c_0_21]) ).
cnf(c_0_50,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk2_0))
| distinct_points(X1,intersection_point(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_46]) ).
fof(c_0_51,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_52,plain,
! [X26,X27] :
( ~ convergent_lines(X26,X27)
| ~ apart_point_and_line(intersection_point(X26,X27),X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])]) ).
cnf(c_0_53,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X2,esk3_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_39,c_0_50]) ).
fof(c_0_55,plain,
! [X24,X25] :
( ~ convergent_lines(X24,X25)
| ~ apart_point_and_line(intersection_point(X24,X25),X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])]) ).
cnf(c_0_56,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
fof(c_0_58,plain,
! [X39,X40,X41] :
( ~ apart_point_and_line(X39,X40)
| distinct_lines(X40,X41)
| apart_point_and_line(X39,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
cnf(c_0_59,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_33])]) ).
cnf(c_0_61,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_33])]) ).
cnf(c_0_63,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
fof(c_0_64,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
cnf(c_0_65,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| distinct_lines(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_63]),c_0_17])]) ).
fof(c_0_66,plain,
! [X35] : ~ distinct_lines(X35,X35),
inference(variable_rename,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_65]),c_0_17])]) ).
cnf(c_0_68,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GEO205+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 06:57:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/tmp/tmp.E2VRTqitcX/E---3.1_1729.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 1819 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # SAT001_MinMin_p005000_rr_RG with pid 1828 completed with status 0
% 0.16/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.001 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 15
% 0.16/0.47 # Removed by relevancy pruning/SinE : 0
% 0.16/0.47 # Initial clauses : 17
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 17
% 0.16/0.47 # Processed clauses : 439
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 254
% 0.16/0.47 # ...remaining for further processing : 185
% 0.16/0.47 # Other redundant clauses eliminated : 0
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 18
% 0.16/0.47 # Backward-rewritten : 3
% 0.16/0.47 # Generated clauses : 1265
% 0.16/0.47 # ...of the previous two non-redundant : 1066
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 1043
% 0.16/0.47 # Factorizations : 222
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 0
% 0.16/0.47 # Total rewrite steps : 206
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 147
% 0.16/0.47 # Positive orientable unit clauses : 11
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 4
% 0.16/0.47 # Non-unit-clauses : 132
% 0.16/0.47 # Current number of unprocessed clauses: 639
% 0.16/0.47 # ...number of literals in the above : 3765
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 38
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 6776
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 2187
% 0.16/0.47 # Non-unit clause-clause subsumptions : 263
% 0.16/0.47 # Unit Clause-clause subsumption calls : 203
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 6
% 0.16/0.47 # BW rewrite match successes : 6
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 15896
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.032 s
% 0.16/0.47 # System time : 0.002 s
% 0.16/0.47 # Total time : 0.034 s
% 0.16/0.47 # Maximum resident set size: 1744 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.034 s
% 0.16/0.47 # System time : 0.003 s
% 0.16/0.47 # Total time : 0.037 s
% 0.16/0.47 # Maximum resident set size: 1732 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------