TSTP Solution File: LCL644+1.001 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL644+1.001 : TPTP v8.1.2. Released v4.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:27:29 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 3 unt; 0 def)
% Number of atoms : 481 ( 0 equ)
% Maximal formula atoms : 370 ( 68 avg)
% Number of connectives : 786 ( 312 ~; 402 |; 71 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 17 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 47 ( 0 sgn; 45 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) )
| p1(X1) )
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ ( p1(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.qZYB41MTcl/E---3.1_31655.p',main) ).
fof(c_0_1,plain,
! [X1] :
( epred1_1(X1)
<=> ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) ) )
| p1(X1) )
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ ( p1(X1)
& ! [X2] :
( ~ r1(X1,X2)
| p1(X2) )
& p1(X1) ) ) ) ) ),
introduced(definition) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ~ ( epred1_1(X1)
& ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p2(X1) ) )
| p1(X2)
| p2(X2)
| ~ ( p1(X2)
& ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1) )
& p1(X2) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]),c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X4,X6,X9,X10,X12,X14] :
( ( r1(esk1_0,esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p2(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X9)
| p2(X9)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p2(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X10)
| p1(X10)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( r1(esk1_0,esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p2(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X9)
| p2(X9)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p2(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X10)
| p1(X10)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| r1(X4,esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( r1(esk1_0,esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p2(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X9)
| p2(X9)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p2(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X10)
| p1(X10)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| r1(X6,esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( r1(esk1_0,esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p2(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X9)
| p2(X9)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ p2(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( ~ r1(esk4_0,X10)
| p1(X10)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& ( p1(esk4_0)
| ~ epred1_1(esk1_0)
| ~ p1(esk3_1(X6))
| ~ p1(X6)
| ~ p1(X6)
| ~ r1(esk1_0,X6)
| p2(X6)
| ~ p2(esk2_1(X4))
| ~ p2(X4)
| ~ r1(esk1_0,X4)
| p1(X4) )
& r1(esk1_0,esk5_0)
& ~ p1(esk5_0)
& ( ~ r1(esk5_0,X12)
| p1(X12) )
& p1(esk5_0)
& r1(esk1_0,esk6_0)
& ~ p1(esk6_0)
& ( ~ r1(esk6_0,X14)
| p1(X14) )
& p1(esk6_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,negated_conjecture,
~ p1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
p1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL644+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 12:36:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.qZYB41MTcl/E---3.1_31655.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 31767 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUNF-FSLS11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 31781 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGUNF-FSLS11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.003 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 1
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 121
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 121
% 0.20/0.50 # Processed clauses : 2
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 1
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 1
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 119
% 0.20/0.50 # ...number of literals in the above : 615
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 0
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5233
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1884 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.007 s
% 0.20/0.50 # Total time : 0.013 s
% 0.20/0.50 # Maximum resident set size: 1672 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------