TSTP Solution File: SYN738-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN738-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Sat May 4 10:10:24 EDT 2024
% Result : Satisfiable 0.19s 0.49s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_22)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_23,negated_conjecture,
( ssPv4(X3)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv2(X1) ),
c_0_21,
[final] ).
cnf(c_0_24,negated_conjecture,
ssRr(X1,skf1(X1)),
clause1,
[final] ).
cnf(c_0_29,negated_conjecture,
( ssPv5(X1)
| ssPv7(X1)
| ~ ssRr(X1,X2)
| ~ ssPv8(X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X3) ),
c_0_22,
[final] ).
cnf(c_0_30,negated_conjecture,
( ssPv4(skf1(X1))
| ~ ssPv7(X2)
| ~ ssPv1(X1)
| ~ ssPv2(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
cnf(c_0_31,negated_conjecture,
( ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X1)
| ~ ssPv6(X1) ),
c_0_25,
[final] ).
cnf(c_0_34,negated_conjecture,
( ssPv5(X4)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X3)
| ~ ssRr(X1,X4)
| ~ ssPv4(X1) ),
c_0_26,
[final] ).
cnf(c_0_35,negated_conjecture,
( ssPv6(X3)
| ssPv4(X4)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv5(X1) ),
c_0_27,
[final] ).
cnf(c_0_37,negated_conjecture,
( ssPv8(X3)
| ssPv3(X4)
| ssPv4(X1)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4) ),
c_0_28,
[final] ).
cnf(c_0_41,negated_conjecture,
( ssPv7(X1)
| ssPv5(X1)
| ~ ssPv4(skf1(X1))
| ~ ssPv8(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]),
[final] ).
cnf(c_0_42,negated_conjecture,
( ssPv4(skf1(X1))
| ~ ssPv7(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv2(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ssPv7(skf1(X1))
| ~ ssPv6(X1)
| ~ ssPv1(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]),
[final] ).
cnf(c_0_44,negated_conjecture,
( ssPv1(X1)
| ssPv7(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv2(X1) ),
c_0_32,
[final] ).
cnf(c_0_45,negated_conjecture,
( ssPv7(X4)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv1(X3)
| ~ ssRr(X1,X4)
| ~ ssPv7(X1) ),
c_0_33,
[final] ).
cnf(c_0_46,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv6(X2)
| ~ ssPv4(X1)
| ~ ssPv3(X3)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_24]),
[final] ).
cnf(c_0_47,negated_conjecture,
( ssPv6(X1)
| ssPv4(skf1(X2))
| ~ ssPv5(X3)
| ~ ssPv5(X2)
| ~ ssRr(X2,X1)
| ~ ssRr(X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_24]),
[final] ).
cnf(c_0_48,negated_conjecture,
( ssPv8(X3)
| ssPv6(X4)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssRr(X1,X3)
| ~ ssRr(X1,X4)
| ~ ssPv3(X1) ),
c_0_36,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssPv4(X1)
| ssPv8(X2)
| ssPv3(skf1(X1))
| ~ ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]),
[final] ).
cnf(c_0_55,negated_conjecture,
( ssPv8(X3)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X1)
| ~ ssPv8(X1) ),
c_0_38,
[final] ).
cnf(c_0_56,negated_conjecture,
( ssPv5(X3)
| ssPv6(X1)
| ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3) ),
c_0_39,
[final] ).
cnf(c_0_57,negated_conjecture,
( ssPv5(X2)
| ssPv3(X3)
| ssPv5(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X1) ),
c_0_40,
[final] ).
cnf(c_0_61,negated_conjecture,
( ssPv7(X1)
| ssPv5(X1)
| ~ ssPv7(skf1(X1))
| ~ ssPv1(X1)
| ~ ssPv2(X1)
| ~ ssPv8(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[final] ).
cnf(c_0_62,negated_conjecture,
( ssPv7(skf1(X1))
| ~ ssPv6(X1)
| ~ ssPv1(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ssPv7(X1)
| ssPv1(X1)
| ~ ssPv2(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_24]),
[final] ).
cnf(c_0_64,negated_conjecture,
( ssPv7(skf1(X1))
| ~ ssPv7(X1)
| ~ ssPv1(X2)
| ~ ssPv3(X3)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_24]),
[final] ).
cnf(c_0_65,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv6(X2)
| ~ ssPv4(X1)
| ~ ssPv3(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_24]),
[final] ).
cnf(c_0_66,negated_conjecture,
( ssPv6(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv5(X2)
| ~ ssPv5(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_24]),
[final] ).
cnf(c_0_67,negated_conjecture,
( ssPv6(skf1(X1))
| ssPv8(X2)
| ~ ssPv6(X3)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2)
| ~ ssRr(X1,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_24]),
[final] ).
cnf(c_0_68,negated_conjecture,
( ssPv4(X1)
| ssPv8(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv7(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]),
[final] ).
cnf(c_0_69,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X3)
| ~ ssPv4(X1)
| ~ ssPv8(X1) ),
c_0_50,
[final] ).
cnf(c_0_70,negated_conjecture,
( ssPv6(X3)
| ~ ssRr(X1,X2)
| ~ ssPv6(X2)
| ~ ssRr(X1,X3)
| ~ ssPv4(X1)
| ~ ssPv5(X1) ),
c_0_51,
[final] ).
cnf(c_0_71,negated_conjecture,
( ssPv7(X1)
| ~ ssRr(X1,X2)
| ~ ssPv5(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssPv2(X1) ),
c_0_52,
[final] ).
cnf(c_0_72,negated_conjecture,
( ssPv7(X3)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssRr(X1,X3)
| ~ ssPv3(X1)
| ~ ssPv8(X1) ),
c_0_53,
[final] ).
cnf(c_0_73,negated_conjecture,
( ssPv8(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssRr(X1,X3)
| ~ ssPv2(X3)
| ~ ssPv1(X1) ),
c_0_54,
[final] ).
cnf(c_0_74,negated_conjecture,
( ssPv8(skf1(X1))
| ~ ssPv7(X2)
| ~ ssPv8(X1)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_24]),
[final] ).
cnf(c_0_75,negated_conjecture,
( ssPv6(X1)
| ssPv5(skf1(X1))
| ssPv8(X1)
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_24]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ssPv5(X1)
| ssPv5(X2)
| ssPv3(skf1(X2))
| ~ ssPv4(X2)
| ~ ssRr(X2,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_24]),
[final] ).
cnf(c_0_77,negated_conjecture,
( ssPv6(X1)
| ~ ssRr(X1,X2)
| ~ ssPv7(X2)
| ~ ssPv3(X1)
| ~ ssPv4(X1) ),
c_0_58,
[final] ).
cnf(c_0_78,negated_conjecture,
( ssPv2(X2)
| ssPv2(X1)
| ~ ssRr(X1,X2)
| ~ ssPv5(X1)
| ~ ssPv8(X1) ),
c_0_59,
[final] ).
cnf(c_0_79,negated_conjecture,
( ssPv4(X1)
| ssPv5(X1)
| ~ ssRr(X1,X2)
| ~ ssPv3(X2)
| ~ ssPv8(X1) ),
c_0_60,
[final] ).
cnf(c_0_80,negated_conjecture,
( ssPv7(X1)
| ssPv5(X1)
| ~ ssPv6(X1)
| ~ ssPv2(X1)
| ~ ssPv8(X2)
| ~ ssPv3(skf1(X1))
| ~ ssRr(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ssPv7(skf1(X1))
| ~ ssPv7(X1)
| ~ ssPv1(skf1(X1))
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_24]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ssPv5(skf1(X1))
| ~ ssPv6(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_24]),
[final] ).
cnf(c_0_83,negated_conjecture,
( ssPv6(skf1(X1))
| ssPv4(skf1(X1))
| ~ ssPv5(skf1(X1))
| ~ ssPv5(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_24]),
[final] ).
cnf(c_0_84,negated_conjecture,
( ssPv6(skf1(X1))
| ssPv8(skf1(X1))
| ~ ssPv6(X2)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_24]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ssPv4(X1)
| ssPv8(skf1(X1))
| ssPv3(skf1(X1))
| ~ ssPv7(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_68,c_0_24]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ ssPv4(X1)
| ~ ssPv4(X2)
| ~ ssPv8(X2)
| ~ ssPv3(skf1(X2))
| ~ ssRr(X2,X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_24]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ssPv6(skf1(X1))
| ~ ssPv6(X2)
| ~ ssPv5(X1)
| ~ ssPv4(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_24]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ssPv7(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv2(X1)
| ~ ssPv5(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_24]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ssPv7(skf1(X1))
| ~ ssPv7(X2)
| ~ ssPv8(X1)
| ~ ssPv3(X1)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_72,c_0_24]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ssPv8(X1)
| ~ ssPv1(X1)
| ~ ssPv2(skf1(X1))
| ~ ssPv3(X2)
| ~ ssRr(X1,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_24]),
[final] ).
cnf(c_0_91,negated_conjecture,
( ssPv8(skf1(X1))
| ~ ssPv7(skf1(X1))
| ~ ssPv8(X1)
| ~ ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_24]),
[final] ).
cnf(c_0_92,negated_conjecture,
( ssPv6(X1)
| ssPv5(skf1(X1))
| ssPv8(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_75,c_0_24]),
[final] ).
cnf(c_0_93,negated_conjecture,
( ssPv5(skf1(X1))
| ssPv5(X1)
| ssPv3(skf1(X1))
| ~ ssPv4(X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_24]),
[final] ).
cnf(c_0_94,negated_conjecture,
( ssPv6(X1)
| ~ ssPv7(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_24]),
[final] ).
cnf(c_0_95,negated_conjecture,
( ssPv2(skf1(X1))
| ssPv2(X1)
| ~ ssPv5(X1)
| ~ ssPv8(X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_24]),
[final] ).
cnf(c_0_96,negated_conjecture,
( ssPv5(X1)
| ssPv4(X1)
| ~ ssPv8(X1)
| ~ ssPv3(skf1(X1)) ),
inference(spm,[status(thm)],[c_0_79,c_0_24]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN738-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.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 : Fri May 3 10:51:10 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.XqcLUhqQbu/E---3.1_16779.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16857 completed with status 1
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.49 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with pid 16864 completed with status 1
% 0.19/0.49 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # No SInE strategy applied
% 0.19/0.49 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.19/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.49 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49
% 0.19/0.49 # No proof found!
% 0.19/0.49 # SZS status Satisfiable
% 0.19/0.49 # SZS output start Saturation
% See solution above
% 0.19/0.49 # Parsed axioms : 21
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 21
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 21
% 0.19/0.49 # Processed clauses : 56
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 56
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 42
% 0.19/0.49 # ...of the previous two non-redundant : 35
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 1
% 0.19/0.49 # Paramodulations : 42
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 0
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 56
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 55
% 0.19/0.49 # Current number of unprocessed clauses: 0
% 0.19/0.49 # ...number of literals in the above : 0
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 0
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 152
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 32
% 0.19/0.49 # Non-unit clause-clause subsumptions : 1
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 56
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 3115
% 0.19/0.49 # Search garbage collected termcells : 120
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.007 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.008 s
% 0.19/0.49 # Maximum resident set size: 1664 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.036 s
% 0.19/0.49 # System time : 0.006 s
% 0.19/0.49 # Total time : 0.042 s
% 0.19/0.49 # Maximum resident set size: 1712 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------