TSTP Solution File: SYN036-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN036-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 20:12:52 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 30
% Syntax : Number of clauses : 94 ( 5 unt; 19 nHn; 74 RR)
% Number of literals : 238 ( 0 equ; 117 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 9 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 46 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_18,negated_conjecture,
( q(X1)
| ~ n5(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_18) ).
cnf(clause_14,negated_conjecture,
( n5(s6)
| ~ n6 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_14) ).
cnf(clause_28,negated_conjecture,
( p(X1)
| ~ n1(X1)
| ~ p(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_28) ).
cnf(clause_24,negated_conjecture,
( n1(s2)
| ~ n2 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_24) ).
cnf(clause_17,negated_conjecture,
( q(X2)
| ~ n5(X1)
| ~ q(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_17) ).
cnf(clause_22,negated_conjecture,
( q(s3)
| ~ n3 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_22) ).
cnf(clause_27,negated_conjecture,
( p(X2)
| ~ n1(X1)
| ~ p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_27) ).
cnf(clause_12,negated_conjecture,
( p(s7)
| ~ n7 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_12) ).
cnf(clause_21,negated_conjecture,
( n3
| ~ q(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_21) ).
cnf(clause_20,negated_conjecture,
( q(X1)
| ~ n4 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_20) ).
cnf(clause_11,negated_conjecture,
( n7
| ~ p(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_11) ).
cnf(clause_10,negated_conjecture,
( p(X1)
| ~ n8 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_10) ).
cnf(clause_26,negated_conjecture,
( p(X1)
| p(s1(X1))
| n1(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_26) ).
cnf(clause_19,negated_conjecture,
( n4
| ~ q(s4) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_19) ).
cnf(clause_29,negated_conjecture,
( n9
| ~ n3
| ~ n4 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_29) ).
cnf(clause_9,negated_conjecture,
( n8
| ~ p(s8) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_9) ).
cnf(clause_33,negated_conjecture,
( n10
| ~ n7
| ~ n8 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_33) ).
cnf(clause_25,negated_conjecture,
( n1(X1)
| ~ p(X1)
| ~ p(s1(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_25) ).
cnf(clause_23,negated_conjecture,
( n2
| ~ n1(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_23) ).
cnf(clause_30,negated_conjecture,
( n3
| n4
| n9 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_30) ).
cnf(clause_34,negated_conjecture,
( n7
| n8
| n10 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_34) ).
cnf(clause_35,negated_conjecture,
( n8
| ~ n7
| ~ n10 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_35) ).
cnf(clause_6,negated_conjecture,
( n9
| n6
| ~ n2
| ~ n10 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_6) ).
cnf(clause_4,negated_conjecture,
( n2
| n9
| n6
| n10 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_4) ).
cnf(clause_1,negated_conjecture,
( ~ n2
| ~ n9
| ~ n6
| ~ n10 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_1) ).
cnf(clause_16,negated_conjecture,
( q(X1)
| q(s5(X1))
| n5(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_16) ).
cnf(clause_7,negated_conjecture,
( n2
| n10
| ~ n9
| ~ n6 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_7) ).
cnf(clause_15,negated_conjecture,
( n5(X1)
| ~ q(X1)
| ~ q(s5(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_15) ).
cnf(clause_31,negated_conjecture,
( n4
| ~ n3
| ~ n9 ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_31) ).
cnf(clause_13,negated_conjecture,
( n6
| ~ n5(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iA3xRdVxSN/E---3.1_17031.p',clause_13) ).
cnf(c_0_30,negated_conjecture,
( q(X1)
| ~ n5(X1)
| ~ q(X2) ),
clause_18 ).
cnf(c_0_31,negated_conjecture,
( n5(s6)
| ~ n6 ),
clause_14 ).
cnf(c_0_32,negated_conjecture,
( p(X1)
| ~ n1(X1)
| ~ p(X2) ),
clause_28 ).
cnf(c_0_33,negated_conjecture,
( n1(s2)
| ~ n2 ),
clause_24 ).
cnf(c_0_34,negated_conjecture,
( q(X2)
| ~ n5(X1)
| ~ q(X1) ),
clause_17 ).
cnf(c_0_35,negated_conjecture,
( q(s6)
| ~ q(X1)
| ~ n6 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( q(s3)
| ~ n3 ),
clause_22 ).
cnf(c_0_37,negated_conjecture,
( p(X2)
| ~ n1(X1)
| ~ p(X1) ),
clause_27 ).
cnf(c_0_38,negated_conjecture,
( p(s2)
| ~ p(X1)
| ~ n2 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( p(s7)
| ~ n7 ),
clause_12 ).
cnf(c_0_40,negated_conjecture,
( q(X1)
| ~ q(s6)
| ~ n6 ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
( q(s6)
| ~ n3
| ~ n6 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( n3
| ~ q(X1) ),
clause_21 ).
cnf(c_0_43,negated_conjecture,
( q(X1)
| ~ n4 ),
clause_20 ).
cnf(c_0_44,negated_conjecture,
( p(X1)
| ~ p(s2)
| ~ n2 ),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( p(s2)
| ~ n7
| ~ n2 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( n7
| ~ p(X1) ),
clause_11 ).
cnf(c_0_47,negated_conjecture,
( p(X1)
| ~ n8 ),
clause_10 ).
cnf(c_0_48,negated_conjecture,
( p(X1)
| p(s1(X1))
| n1(X1) ),
clause_26 ).
cnf(c_0_49,negated_conjecture,
( n4
| ~ q(s4) ),
clause_19 ).
cnf(c_0_50,negated_conjecture,
( q(X1)
| ~ n3
| ~ n6 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( n9
| ~ n3
| ~ n4 ),
clause_29 ).
cnf(c_0_52,negated_conjecture,
( n3
| ~ n4 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
( n8
| ~ p(s8) ),
clause_9 ).
cnf(c_0_54,negated_conjecture,
( p(X1)
| ~ n7
| ~ n2 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( n10
| ~ n7
| ~ n8 ),
clause_33 ).
cnf(c_0_56,negated_conjecture,
( n7
| ~ n8 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( n1(X1)
| ~ p(X1)
| ~ p(s1(X1)) ),
clause_25 ).
cnf(c_0_58,negated_conjecture,
( n2
| ~ n1(X1) ),
clause_23 ).
cnf(c_0_59,negated_conjecture,
( n1(X1)
| n7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_48]),c_0_46]) ).
cnf(c_0_60,negated_conjecture,
( n4
| ~ n3
| ~ n6 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_61,negated_conjecture,
( n3
| n4
| n9 ),
clause_30 ).
cnf(c_0_62,negated_conjecture,
( n9
| ~ n4 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_63,negated_conjecture,
( n8
| ~ n7
| ~ n2 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( n7
| n8
| n10 ),
clause_34 ).
cnf(c_0_65,negated_conjecture,
( n10
| ~ n8 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
( n1(X1)
| ~ n8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_47]),c_0_47]) ).
cnf(c_0_67,negated_conjecture,
( n8
| ~ n7
| ~ n10 ),
clause_35 ).
cnf(c_0_68,negated_conjecture,
( n7
| n2 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,negated_conjecture,
( n9
| ~ n6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_70,negated_conjecture,
( n9
| n6
| ~ n2
| ~ n10 ),
clause_6 ).
cnf(c_0_71,negated_conjecture,
( n10
| ~ n2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_72,negated_conjecture,
( n2
| ~ n8 ),
inference(spm,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( n8
| n2
| ~ n10 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( n2
| n9
| n6
| n10 ),
clause_4 ).
cnf(c_0_75,negated_conjecture,
( n9
| ~ n2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( n2
| ~ n10 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( n10
| n9 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_74]),c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( ~ n2
| ~ n9
| ~ n6
| ~ n10 ),
clause_1 ).
cnf(c_0_79,negated_conjecture,
n9,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
( q(X1)
| q(s5(X1))
| n5(X1) ),
clause_16 ).
cnf(c_0_81,negated_conjecture,
( n2
| n10
| ~ n9
| ~ n6 ),
clause_7 ).
cnf(c_0_82,negated_conjecture,
( ~ n10
| ~ n6 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]),c_0_76]) ).
cnf(c_0_83,negated_conjecture,
( n5(X1)
| ~ q(X1)
| ~ q(s5(X1)) ),
clause_15 ).
cnf(c_0_84,negated_conjecture,
( n4
| ~ n3
| ~ n9 ),
clause_31 ).
cnf(c_0_85,negated_conjecture,
( n6
| ~ n5(X1) ),
clause_13 ).
cnf(c_0_86,negated_conjecture,
( n3
| n5(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_80]),c_0_42]) ).
cnf(c_0_87,negated_conjecture,
~ n6,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_79])]),c_0_71]),c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( n5(X1)
| ~ n4 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_43]),c_0_43]) ).
cnf(c_0_89,negated_conjecture,
( n4
| ~ n3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_79])]) ).
cnf(c_0_90,negated_conjecture,
n3,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_91,negated_conjecture,
( n6
| ~ n4 ),
inference(spm,[status(thm)],[c_0_85,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
n4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN036-3 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 18:23:44 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.iA3xRdVxSN/E---3.1_17031.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 17136 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 17143 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 36
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 36
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 36
% 0.20/0.51 # Processed clauses : 119
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 14
% 0.20/0.51 # ...remaining for further processing : 105
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 21
% 0.20/0.51 # Backward-rewritten : 15
% 0.20/0.51 # Generated clauses : 96
% 0.20/0.51 # ...of the previous two non-redundant : 56
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 12
% 0.20/0.51 # Paramodulations : 96
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 12
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 33
% 0.20/0.51 # Positive orientable unit clauses : 3
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 29
% 0.20/0.51 # Current number of unprocessed clauses: 9
% 0.20/0.51 # ...number of literals in the above : 29
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 72
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1035
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 787
% 0.20/0.51 # Non-unit clause-clause subsumptions : 40
% 0.20/0.51 # Unit Clause-clause subsumption calls : 43
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 3
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1438
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.001 s
% 0.20/0.51 # Total time : 0.009 s
% 0.20/0.51 # Maximum resident set size: 1660 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.034 s
% 0.20/0.51 # System time : 0.009 s
% 0.20/0.51 # Total time : 0.042 s
% 0.20/0.51 # Maximum resident set size: 1692 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------